Simplified Soft Demapping Algorithm for Gray-APSK
暂无分享,去创建一个
[1] Patrick Robertson,et al. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain , 1995, Proceedings IEEE International Conference on Communications ICC '95.
[2] Paola Bisaglia,et al. Simplified soft-output demapper for binary interleaved COFDM with application to HIPERLAN/2 , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).
[3] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[4] Hideki Imai,et al. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..
[5] Xiaofei Zhang,et al. Recursive Bit Metric Generation for PSK Signals with Gray Labeling , 2012, IEEE Communications Letters.
[6] C. Thomas,et al. Digital Amplitude-Phase Keying with M-Ary Alphabets , 1974, IEEE Trans. Commun..
[7] Shuai Yang,et al. A Simplified Soft Decision Demapping Algorithm of 16-APSK Signals in AWGN Channels , 2010, 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing.
[8] Meixiang Zhang,et al. Efficient soft demapping for M-ary APSK , 2011, ICTC 2011.
[9] Zhixing Yang,et al. APSK Constellation with Gray Mapping , 2011, IEEE Communications Letters.
[10] Shlomo Shamai,et al. The capacity of average and peak-power-limited quadrature Gaussian channels , 1995, IEEE Trans. Inf. Theory.
[11] Jack E. Volder. The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..
[12] Zhaocheng Wang,et al. Simplified Soft Demapper for APSK with Product Constellation Labeling , 2012, IEEE Transactions on Wireless Communications.