Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to ...Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the states involved in the computation, an adaptive pruning method for the trellis is proposed. In this scheme, we prune the states which have the low forward-backward quantities below a carefully-chosen threshold. Thus, a wandering trellis with much less states is achieved, which contains most of the states with quite high probability. Simulation results reveal that, with the proper scaling factor, significant complexity reduction in the forward-backward algorithm is achieved at the expense of slight performance degradation.展开更多
The authors define the holomorphic Fourier transform of holomorphic functions on complex reductive groups, prove some properties such as the Fourier inversion formula, and give some applications. The definition of the...The authors define the holomorphic Fourier transform of holomorphic functions on complex reductive groups, prove some properties such as the Fourier inversion formula, and give some applications. The definition of the holomorphic Fourier transform makes use of the notion of K-admissible measures. The authors prove that K-admissible measures are abundant, and the definition of holomorphic Fourier transform is independent of the choice of K-admissible measures.展开更多
基金supported in part by National Natural Science Foundation of China (61101114, 61671324) the Program for New Century Excellent Talents in University (NCET-12-0401)
文摘Forward-backward algorithm, used by watermark decoder for correcting non-binary synchronization errors, requires to traverse a very large scale trellis in order to achieve the proper posterior probability, leading to high computational complexity. In order to reduce the number of the states involved in the computation, an adaptive pruning method for the trellis is proposed. In this scheme, we prune the states which have the low forward-backward quantities below a carefully-chosen threshold. Thus, a wandering trellis with much less states is achieved, which contains most of the states with quite high probability. Simulation results reveal that, with the proper scaling factor, significant complexity reduction in the forward-backward algorithm is achieved at the expense of slight performance degradation.
基金supported by the 973 Project Foundation of China (#TG1999075102)
文摘The authors define the holomorphic Fourier transform of holomorphic functions on complex reductive groups, prove some properties such as the Fourier inversion formula, and give some applications. The definition of the holomorphic Fourier transform makes use of the notion of K-admissible measures. The authors prove that K-admissible measures are abundant, and the definition of holomorphic Fourier transform is independent of the choice of K-admissible measures.
