适用于BICM-ID系统的星座成形方法

doi:10.11959/j.issn.1000-436x.2015117

Abstract

Abstract:

A novel method of constellation mapping is presented for bit-interleaved coded modulation (BICM) by combining geometry shaping with probabilistic shaping.The transmitted signal points of a practical signal constellation approach the optimal input distribution by exploiting a many-to-one mapping with some signal points unused.With this method,shaping gain can be achieved conveniently with the help of iterative decoding between demodulation and decoder.The optimizations of signal constellation and the mapping from symbols to signal points are performed by the analysis of capacity and the extrinsic information transfer chart.Simulation results show that the proposed constellation mapping outperforms the traditional Gray mapping for BICM with iterative decoding in both AWGN and Rayleigh channels.And the shaping gain achieved can be improved with the increase of the constellation size.

Key words: bit-interleaved coded modulation, iterative decoding, constellation mapping, shaping gain

Qi LI,Lin ZHOU,Bo ZHANG,Bao-ming BAI. Simple constellation shaping for BICM-ID[J]. Journal on Communications, 2015, 36(6): 149-156.

Figures/Tables 8

References 17

[1]	CAIRE G , TARICCO G , BIGLIERI E . Bit-interleaved coded modulation[J]. IEEE Trans on Information Theory, 1998,44(3): 927-946.
[2]	LI X , RITCEY J A . Trellis-coded modulation with bit interleaving and iterative decoding[J]. IEEE Journal on Selected Areas in Communications, 1999,17(4): 715-724.
[3]	CHINDAPOL A , RITCEY J A . Design,analysis,and performance evaluation for BICM-ID with square QAM constellations in Rayleigh fading channels[J]. IEEE Journal on Selected Areas in Communications, 2001,19(5): 944-957.
[4]	TAN J , STUBER G L . Analysis and design of symbol mappers for iteratively decoded BICM[J]. IEEE Trans on Wireless Communications, 2005,4(2): 662-672.
[5]	SCHRECKENBACH F , GORTZ N , HAGENAUER J ,et al. Optimizationof symbol mappings for bit-interleaved coded modulation with iterative decoding[J]. IEEE Communications Letters, 2003,7(12): 593-595.
[6]	XIE Q , YANG Z , SONG J ,et al. EXIT-chart-matching-aided near-capacity coded modulation design and a BICM-ID design example for both Gaussian and Rayleigh channels[J]. IEEE Trans on Vehicular Technology, 2013,62(3): 1216-1227.
[7]	LE GOFF S Y . Signal constellations for bit-interleaved coded modulation[J]. Information Theory,IEEE Trans , 2003,49(1): 307-313.
[8]	CRONIE H S . Signal shaping for bit-Interleaved coded modulation on the AWGN channel[J]. IEEE Trans on Communications, 2010,58(12): 3428-3435.
[9]	MA X , LI P . Coded modulation using superimposed binary codes[J]. IEEE Trans on Information Theory, 2004,50(12): 3331-3343.
[10]	LE GOFF S Y , BOON K K , TSIMENIDIS C C ,et al. Constellation shaping for bandwidth-efficient turbo-coded modulation with iterative receiver[J]. IEEE Trans on Wireless Communications, 2007,6(6): 2223-2233.
[11]	VALENTI M C , XIANG X . Constellation shaping for bit-interleaved LDPC coded APSK[J]. IEEE Trans on Communications, 2012,60(10): 2960-2970.
[12]	YANG F , YAN K , XIE Q ,et al. Non-equiprobable APSK constellation labeling design for BICM systems[J]. IEEE Communications Letters, 2013,17(6): 1276-1279.
[13]	BOCHERER G .Probabilistic signal shaping for bit-Interleaved coded modulation[EB/OL].arXiv:1401.6190.2014..
[14]	AGRELL E , ALVARADO A . Achieving the Shannon limit with probabilistically shaped BICM[A]. Proc of IEEE International Symposium on Information Theory[C]. Cambridge MA,IEEE, 2012. 2421-2425.
[15]	AGRELL E , ALVARADO A . Signal shaping for BICM at low SNR[J]. Information Theory,IEEE Transactions , 2013,59(4): 2396-2410.
[16]	GALLAGER R G . Information Theory and Reliable Communication[M]. New York: WileyPress, 1968.
[17]	TEN BRINK S . Convergence behavior of iteratively decoded parallel concatenated codes[J]. IEEE Transactions on Communications, 2001,49(10): 1727-1737.

Metrics

Recommended 0

No Suggested Reading articles found!

Simple constellation shaping for BICM-ID

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 8

References 17

Related Articles 11

Metrics

Recommended 0

[1]	You-fu YANG,Jian-wei LIU,Qi-shan ZHANG,Chun-di XIU. Multiple symbol soft-output non-coherent detection of serial concatenated CPM [J]. Journal on Communications, 2012, 33(8): 113-118.
[2]	De-feng REN,Jian-hua GE,Feng-kui GONG,Yong WANG. Novel low-delay scheme for parallel Turbo decoding [J]. Journal on Communications, 2011, 32(6): 38-44.
[3]	Yi-chao ZHU,Liang-cai GAN,Jian-bing GUO,Jun-qiao XIONG. Performance of convolutionally coded differential frequency hopping systems in partial-band jamming [J]. Journal on Communications, 2009, 30(12): 85-92.
[4]	Guo-hua ZHANG,Xin-mei WANG. Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code [J]. Journal on Communications, 2008, 29(6): 101-106.
[5]	Xing-cheng LIU,Zhi ZHU. Study on the SOVA decoding algorithm for Turbo codes based on modified path-metric [J]. Journal on Communications, 2008, 29(4): 124-129.
[6]	Feng-kui GONG,Jian-hua GE,Yong WANG. Simplified MD-LSD demapping algorithm for BICM-ID systems with multi-dimensional mappings [J]. Journal on Communications, 2008, 29(2): 111-115.
[7]	Peng-wei TENG,Yi-ming WANG,Hong-bo ZHU. Iterative channel estimation based on the Turbo principle for UWB system [J]. Journal on Communications, 2008, 29(1): 77-82.
[8]	Wei-wei YIN,Le-nan WU. Joint source-channel iterative decoding based on hidden markov model [J]. Journal on Communications, 2006, 27(7): 61-65.
[9]	Jin LI,Han HUA,Jing-yu HUA,Xiao-hu YOU. Analysis of stop criterions in the decoder of parallel concatenated LDPC codes [J]. Journal on Communications, 2006, 27(4): 95-100.
[10]	IAOXiao-qiang Q,AIYue-ming C,UXin X,UYou-yun X. Joint iterative decision feedback channel estimation and detection for Turbo coded V-BLAST MIMO-OFDM systems [J]. Journal on Communications, 2006, 27(1): 106-111.
[11]	Shan-bao HE,Chun-ming ZHAO,Zhi-hua SHI,Ming JIANG. Low-density parity-check codes based on sparse binary sequences [J]. Journal on Communications, 2005, 26(6): 81-86.