We consider an iterative phase synchronization scheme based on maximum a posteriori probability algorithm.In classical approaches,the phase noise estimation model considers one sample per symbol at the channel and rec...We consider an iterative phase synchronization scheme based on maximum a posteriori probability algorithm.In classical approaches,the phase noise estimation model considers one sample per symbol at the channel and receiver.However,information theoretic studies suggested use of more than one sample per symbol at the channel and receiver for achieving higher performance.In this article,a soft-information aided iterative receiver is derived,which uses off-the-shelf blocks for detection and demodulation by keeping the complexity of the receiver acceptable.We consider here two samples per symbols at the channel and receiver in a pragmatic paradigm.It is shown that phase noise estimation can be significantly improved at the expense of modest processing overhead.Simulation results are presented for low-density parity check coded quadrature amplitude modulations.Our results show a significant performance improvement for strong phase noise values compared to classical receiver approaches.展开更多
The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm i...The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger＇s style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated.展开更多
文摘We consider an iterative phase synchronization scheme based on maximum a posteriori probability algorithm.In classical approaches,the phase noise estimation model considers one sample per symbol at the channel and receiver.However,information theoretic studies suggested use of more than one sample per symbol at the channel and receiver for achieving higher performance.In this article,a soft-information aided iterative receiver is derived,which uses off-the-shelf blocks for detection and demodulation by keeping the complexity of the receiver acceptable.We consider here two samples per symbols at the channel and receiver in a pragmatic paradigm.It is shown that phase noise estimation can be significantly improved at the expense of modest processing overhead.Simulation results are presented for low-density parity check coded quadrature amplitude modulations.Our results show a significant performance improvement for strong phase noise values compared to classical receiver approaches.
文摘The famous F5 algorithm for computing Grobner basis was presented by Faugere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger＇s style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated.
