Decoders : High Performance Algorithms and Architectures
نویسندگان
چکیده
Viterbi Decoders (VDs) are today widely used as forward error correction (FEC) devices in many digital communications and multimedia products, including mobile (cellular) phones, video and audio broadcasting receivers, and modems. VDs are implementations of the Viterbi Algorithm (VA) used for decoding convolutional or trellis codes. The continuing success of convolutional and trellis codes for FEC applications in almost all modern digital communication and multimedia products is based on three main factors:
منابع مشابه
Low-complexity Multi-Bit Iterative Decoders: Algorithms and Hardware Architectures
We present a new type of iterative decoders for low-density parity check (LDPC) codes that use simple Boolean functions for variable node processing and surpass the belief propagation decoders in the error floor region. We discuss the error performance, guaranteed error correction capability and speed and implementation complexity of these decoders as factors crucial for application that requir...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملA high throughput architecture for a low complexity soft-output demapping algorithm
Iterative channel decoders such as Turbo-Code and LDPC decoders show exceptional performance and therefore they are a part of many wireless communication receivers nowadays. These decoders require a soft input, i.e., the logarithmic likelihood ratio (LLR) of the received bits with a typical quantization of 4 to 6 bits. For computing the LLR values from a received complex symbol, a soft demapper...
متن کاملCapacity Approaching Codes , Iterative Decoding Algorithms , and Their Applications
Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes, in particular, are evaluated in terms of ...
متن کاملVlsi. Circuit Complexity and Decoding Performance Analysis for Low-power Rsc Turbo-code and Iterative Block Decoders Design *
A VLSI circuit complexity analysis for low-power decoder designs is presented. Two low-complexity adaptive decoder architectures incorporating the ~ecursive systematic codes (turbo-codes) and the block-codes are considered in this paper. The system performance degradation due to the algorithm approximations for realizing the low complexity decoders is also investigated. The decoders are impleme...
متن کاملEfficient realizations of encoders and decoders based on the 2-D discrete wavelet transform
| In this paper we present architectures and scheduling algorithms for encoders and decoders that are based on the 2-D Discrete Wavelet Transform. We consider the design of encoders and decoders individually, as well as in an integrated encoder-decoder system. We propose architec-tures ranging from SIMD processor arrays to folded archi-tectures that are suitable for single chip implementations....
متن کامل