Abstract—Generally, the Log-MAP kernel of the turbo decoding consume large memories in hardware implement-tation. In this paper, we propose a new Log-MAP kernel to reduce memory usage. The comparison result shows our proposed architecture can reduce the memory size to 26 % of the classical architecture. We also simplify the memory data access in this kernel design without extra address generaters. For 3GPP standard, a prototyping chip of the turbo decoder is implemented to verify the proposed memory-reduced Log-MAP kernel in 3.04×3.04mm2 core area in UMC 0.18um CMOS process. I
The introduction of turbo codes in 1993 was a breakthrough in constructing error correction codes th...
This paper proposes a SIMD technique to implement efficiently the Max-Log-MAP algorithm on a DSP [2]...
Following the increasing interest in non-binary coding schemes, turbo codes over different Galois fi...
In the advent of very high data rates of the upcoming 3G long-term evolution telecommunication syste...
Abstract—Due to the powerful error correcting performance, turbo codes have been adopted in many wir...
SUMMARY As turbo decoding is a highly memory-intensive algorithm consuming large power, a major issu...
Abstract—This paper presents the Max Log Maximum a Posteriori (MAX Log MAP) architecture which influ...
© 2017 IEEE. Implementation of an efficient turbo decoder with low complexity, short delay and insig...
Abstract. In this paper, a new method to reduce up to 90 % of the memory necessary (for a four memor...
Abstract|Most implementations of turbo decoding make use of the so-called \log-MAP algorithm", ...
Abstract—Iterative decoding of convolutional turbo code (CTC) has a large memory power consumption. ...
Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, ye...
International audienceIn the field of mobile communication systems, the energy issue of a turbo deco...
Due to their powerful error correcting capability and superior coding gain, Turbo Codes are used in ...
Reconfiguration between decoding algorithms, employed in the 3rd generation mobile communication sta...
The introduction of turbo codes in 1993 was a breakthrough in constructing error correction codes th...
This paper proposes a SIMD technique to implement efficiently the Max-Log-MAP algorithm on a DSP [2]...
Following the increasing interest in non-binary coding schemes, turbo codes over different Galois fi...
In the advent of very high data rates of the upcoming 3G long-term evolution telecommunication syste...
Abstract—Due to the powerful error correcting performance, turbo codes have been adopted in many wir...
SUMMARY As turbo decoding is a highly memory-intensive algorithm consuming large power, a major issu...
Abstract—This paper presents the Max Log Maximum a Posteriori (MAX Log MAP) architecture which influ...
© 2017 IEEE. Implementation of an efficient turbo decoder with low complexity, short delay and insig...
Abstract. In this paper, a new method to reduce up to 90 % of the memory necessary (for a four memor...
Abstract|Most implementations of turbo decoding make use of the so-called \log-MAP algorithm", ...
Abstract—Iterative decoding of convolutional turbo code (CTC) has a large memory power consumption. ...
Motivated by the importance of hardware implementation in practical turbo decoders, a simplified, ye...
International audienceIn the field of mobile communication systems, the energy issue of a turbo deco...
Due to their powerful error correcting capability and superior coding gain, Turbo Codes are used in ...
Reconfiguration between decoding algorithms, employed in the 3rd generation mobile communication sta...
The introduction of turbo codes in 1993 was a breakthrough in constructing error correction codes th...
This paper proposes a SIMD technique to implement efficiently the Max-Log-MAP algorithm on a DSP [2]...
Following the increasing interest in non-binary coding schemes, turbo codes over different Galois fi...