On Complexity, Energy- and Implementation-Efficiency of Channel Decoders

@article{Kienle2011OnCE,
  title={On Complexity, Energy- and Implementation-Efficiency of Channel Decoders},
  author={Frank Kienle and Norbert Wehn and Heinrich Meyr},
  journal={IEEE Transactions on Communications},
  year={2011},
  volume={59},
  pages={3301-3310}
}
Future wireless communication systems require efficient and flexible baseband receivers. Meaningful efficiency metrics are key for design space exploration to quantify the algorithmic and the implementation complexity of a receiver. Most of the current established efficiency metrics are based on counting operations, thus neglecting important issues like data and storage complexity. In this paper we introduce suitable energy and area efficiency metrics which resolve the afore-mentioned… 

Figures and Tables from this paper

When Channel Coding Hits the Implementation Wall

This paper will highlight implementation challenges for the most advanced channel coding techniques, i.e. Turbo codes, Low Density Parity Check (LDPC) codes and Polar codes and present decoder architectures for all three code classes that are designed for highest throughput.

Computational Complexity Analysis of FEC Decoding on SDR Platforms

Three high efficient coding schemes including Turbo, QC-LDPC and Convolutional code (CC) are investigated and the analytical FEC complexity results are beneficial for the design and optimization of high throughput software defined FEC decoding platforms.

Advanced iterative channel coding schemes: When Shannon meets Moore

This paper highlights the strong interrelation of code structure, decoding algorithms, communications performance and efficient implementation in state-of-the-art semiconductor technology in some advanced iterative channel coding techniques and demonstrates challenges and limitations with respect to throughput and latency.

Energy-efficient gear-shift LDPC decoders

This paper presents LDPC decoder designs based on gear-shift algorithms, which can use multiple decoding algorithms or update rules over the course of decoding a single frame, and improves upon state-of-the-art decoders with comparable error correction performance.

High throughput decoding methods and architectures for polar codes with high energy-efficiency and low latency

This work proposes high throughput and energy-efficient decoders for polar codes using combinational logic targeting, but not limited to, next generation communication services such as optical communications, Massive Machine-Type Communications (mMTC) and Terahertz communications.

Latency and Reliability Trade-Off With Computational Complexity Constraints: OS Decoders and Generalizations

This article investigates the performance of OS decoders as a function of decoding complexity and proposes an empirical model that accurately quantifies the corresponding trade-off, and shows that the decoding time has a drastic effect on the design of URLLC systems when constraints on decoding complexity are considered.

Towards higher speed decoding of convolutional turbocodes

This work proposes a high throughput low complexity radix-16 SISO decoder intended to break the bottleneck that appears because of the recursive operations in the heart of the turbo decoding algorithm and proposes two techniques so that the architecture can be used in practical applications.

Advanced wireless digital baseband signal processing beyond 100 Gbit/s

This paper highlights the challenges for wireless digital baseband signal processing beyond 100 Gbit/s and the limitations of today's architectures and discusses techniques on algorithmic and architectural level, which aim to close this gap.

ASIC Design of a Noisy Gradient Descent Bit Flip Decoder for 10GBASE-T Ethernet Standard

The results indicate that the NGDBF decoder has a better area efficiency and a better energy efficiency compared to other state-of-art decoders and provides better error performance when operated in medium to high signal to noise ratios.

Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders

This comparison enables to identify applications where polar codes are superior to existing error-correction coding solutions as well as to determine the most promising research direction in terms of the hardware implementation of polar decoders.
...

References

SHOWING 1-10 OF 28 REFERENCES

Architecture-aware low-density parity-check codes

A high-throughput memory-efficient decoder architecture for architecture-aware low-density parity-check (LDPC) codes is proposed based on a novel turbo-decoding algorithm that achieves savings of 89.13 % and 62.5 % in power consumption and silicon area over state-of-the-art.

Evaluation of High Throughput Turbo-Decoder Architectures

This is the first comparison of this totally different architectural approach for high throughput Turbo-decoder architectures and the 3GPP conditions for performance comparisons were applied.

A unified parallel radix-4 turbo decoder for mobile WiMAX and 3GPP-LTE

A new hardware architecture that can share hardware resources for the two standards such as Mobile WiMAX and 3GPP-LTE is proposed, which mainly consists of eight retimed radix-4 soft-input soft-output (SISO) decoders to achieve high throughput and a dual-mode parallel hardware interleaver to support both almost regular permutations (ARP) and quadratic polynomial permutation (QPP) interleavers defined in the two Standards.

A Reconfigurable ASIP for Convolutional and Turbo Decoding in an SDR Environment

  • T. VogtN. Wehn
  • Computer Science
    IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2008
The ASIP outperforms state-of-the-art decoder architectures targeting software defined radio by at least a factor of three while consuming only 60% or less of the logic area.

Low-power VLSI decoder architectures for LDPC codes

This paper jointly design the code and the decoder to induce the structural regularity needed for a reduced-complexity parallel decoder architecture and proposes a new approach for computing reliability metrics based on the BCJR algorithm that reduces the message switching activity in the decoding compared to existing approaches.

Low cost LDPC decoder for DVB-S2

This investigation of generic LDPC-implementations found that scalable sub-block parallelism enables efficient implementations for a wide range of applications and achieves half the chip-size of known solutions for the DVB-S2 case.

On the Fair Comparison of FEC Schemes

  • Stefano Galli
  • Business
    2010 IEEE International Conference on Communications
  • 2010
Two new metrics for the high-level comparison of Forward Error Correction (FEC) schemes are proposed and applied to the study of Turbo and LDPC codes, confirming the technical validity of the selection of the LDPC-based proposal over the Turbo Code one.

A 150Mbit/s 3GPP LTE Turbo code decoder

This paper investigates efficient decoder architectures for highly punctured LTE Turbo codes by presenting a 150 Mbit/s 3GPP LTE Turbo code decoder, which is part of an industrial SDR multi-standard baseband processor chip.

Data transfer and storage exploration for real-time implementation of a digital audio broadcast receiver on a Trimedia processor

It is shown how the platform independent data transfer and storage related bottlenecks are first eliminated, so in a second phase, the resulting application source code can be transformed to optimally exploit the available memory hierarchy while efficiently using the sub-word-level acceleration capabilities provided by Trimedia's instruction set architecture.

A 24Mb/s radix-4 logMAP turbo decoder for 3GPP-HSDPA mobile wireless

A 24Mb/s 3GPP-HSDPA radix-4 logMAP turbo decoder is designed for 3G data terminals. It features an approximate radix-4 logsum circuit to achieve 145MHz operation. Power is reduced using 1/2-iteration