A new labeling search algorithm for Bit-Interleaved Coded Modulation with Iterative Decoding
| Autor: | Guangzeng Feng, Xuelan Zou |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Theoretical computer science
Harmonic mean Data_CODINGANDINFORMATIONTHEORY Bit interleaved coded modulation Transmission (telecommunications) Search algorithm Performance comparison Euclidean geometry Bit error rate Electrical and Electronic Engineering Algorithm Decoding methods Computer Science::Information Theory Mathematics |
| Zdroj: | Journal of Electronics (China). 25:59-64 |
| ISSN: | 1993-0615 0217-9822 |
| DOI: | 10.1007/s11767-006-0242-y |
| Popis: | Bit-Interleaved Coded Modulation with Iterative Decoding (BICM-ID) is a bandwidth efficient transmission, where the bit error rate is reduced through the iterative information exchange between the inner demapper and the outer decoder. The choice of the symbol mapping is the crucial design parameter. This paper indicates that the Harmonic Mean of the Minimum Squared Euclidean (HMMSE) distance is the best criterion for the mapping design. Based on the design criterion of the HMMSE distance, a new search algorithm to find the optimized labeling maps for BICM-ID system is proposed. Numerical results and performance comparison show that the new labeling search method has a low complexity and outperforms other labeling schemes using other design criterion in BICM-ID system, therefore it is an optimized labeling method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink