Abstract

Flexible and iterative baseband receivers with advanced channel codes like turbo codes are widely adopted nowadays, ensuring promising error rate performances. Extension of this principle with an additional iterative feedback loop to the demapping function has proven to provide substantial error performance gain at the cost of increased complexity. However, this complexity overhead constitutes commonly an obstacle for its consideration in real implementations. This article illustrates the opposite of what is commonly assumed and proposes a complexity adaptive iterative receiver performing iterative demapping with turbo decoding (TBICM-ID-SSD). Targeting identical error rate, the article shows that for certain system configurations TBICM-ID-SSD presents lower complexity than TBICM-SSD (without iterative demapping). This original result is obtained when considering the equivalent number of iterations through detailed analysis of the corresponding computational and memory access complexity. The analysis is conducted for different parameters in terms of modulation orders and code rates and independently from the architecture for a fair comparison. Considering the proposed adaptive receiver which is able to perform both TBICM-ID-SSD and TBICM-SSD modes, results demonstrate a reduced complexity with TBICM-SSD for high modulation orders. However, for low modulation orders as for QPSK, results show a reduction in arithmetic operations and read access memory up to 45.9% and 47%, respectively for using the TBICM-ID-SSD mode rather than TBICM-SSD performing six turbo decoding iterations over Rayleigh fading channel with erasures.

Highlights

  • Advanced wireless communication standards impose the use of modern techniques to improve spectral efficiency and reliability

  • If the TBICM-signal space diversity (SSD) mode requires x iterations to process a frame composed of number of modulated symbols (NMSymb) modulated symbols, the complexity C1 for TBICM-SSD can be calculated as the sum of the complexity of one demapping process and x decoding processes

  • This last equation allows to obtain the number of TBICM-ID-SSD iterations y = yLim corresponding to identical complexity for both modes

Read more

Summary

Introduction

Advanced wireless communication standards impose the use of modern techniques to improve spectral efficiency and reliability. Combining SSD technique with TBICM-ID at the receiver side has shown excellent error rate performance results in severe channel conditions (erasure, multi-path, real fading models) [6,7]. These results were behind the adoption of this system in DVB-T2 standard (using LDPC channel code). System model and algorithms This section describes the system model and the considered parameters of the transmitter, channel, and receiver of Figure 1 It gives a brief presentation of the underlined algorithms for the iterative demapping and decoding.

Branch metric γk
Extrinsic information
Arithmetic operations Normalized arithmetic operations
Complexity analysis for a chosen x
Load Store Arith Load Store
We can conclude from the results above that using
Complexity analysis for different values of x
The complexity reduction over iterations for using
Findings
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.