29 research outputs found

    Structured LDPC codes with low error floor based on PEG Tanner graphs

    Get PDF
    Abstract-Progressive edge-growth (PEG) algorithm was proven to be a simple and effective approach to design good LDPC codes. However, the Tanner graph constructed by PEG algorithm is non-structured which leads the positions of 's of the corresponding parity check matrix fully random. In this paper, we propose a general method based on PEG algorithm to construct structured Tanner graphs. These hardware-oriented LDPC codes can reduce the VLSI implementation complexity. Similar to PEG method, our CP-PEG approach can be used to construct both regular and irregular Tanner graphs with flexible parameters. For the consideration of encoding complexity and error floor, the modifications of proposed algorithm are discussed. Simulation results show that our codes, in terms of bit error rate (BER) or packet error rate (PER), outperform other PEG-based LDPC codes and are better than the codes in IEEE 802.16e

    Turbo Decoder Using Contention-Free Interleaver and Parallel Architecture

    Full text link

    Turbo decoder architecture for beyond-4G applications

    No full text
    This book describes the most recent techniques for turbo decoder implementation, especially for 4G and beyond 4G applications.聽The authors reveal techniques for the design of high-throughput decoders for future telecommunication systems, enabling designers to reduce hardware cost and shorten processing time.聽Coverage includes an explanation of VLSI implementation of the turbo decoder, from basic functional units to advanced parallel architecture. The authors discuss both hardware architecture techniques and experimental results, showing the variations in area/throughput/performance with respecThis book describes the most recent techniques for turbo decoder implementation, especially for 4G and beyond 4G applications.聽 The authors reveal techniques for the design of high-throughput decoders for future telecommunication systems, enabling designers to reduce hardware cost and shorten processing time.聽 Coverage includes an explanation of VLSI implementation of the turbo decoder, from basic functional units to advanced parallel architecture. Several state-of-the-art techniques that improve complexity and/or throughput are introduced. 聽The authors discuss both hardware architecture techniques and experimental results, showing the variations in area/throughput/performance with respect to several techniques. This book also illustrates turbo decoders for 3GPP-LTE/LTE-A and IEEE 802.16e/m standards, which provide a low-complexity but high-flexibility circuit structure to support these standards and enables designs that reconfigure block size and parallelism.聽 Case studies include the discussions of both throughput and performance of each mode (block size/parallelism/iteration).聽 This book not only highlights the critical design issues that restrict the speedup of parallel architecture, but it also provides the solutions to overcome these limitations by modifying slightly the turbo codec of modern standards. 聽 聽 路聽聽聽聽聽聽聽聽 Offers readers a complete introduction to practical turbo decoder design; 路聽聽聽聽聽聽聽聽 Describes different design methodologies and explains the trade-offs between performance improvement and overhead; 路聽聽聽聽聽聽聽聽 Explains modern techniques for state-of-the-art designs; 路聽聽聽聽聽聽聽聽 Includes simulation and implementation results with respect to various decoder circuit designs; 路聽聽聽聽聽聽聽聽 Reveals novel approaches to higher operating efficiency of turbo decoders for beyond 4G applications

    Turbo Decoder Architecture for Beyond-4G Applications

    No full text
    VIII, 100 p. 36 illus., 3 illus. in color.online

    Re-Polarization Processing in Extended Polar Codes

    No full text

    A Low-Power Reed-Solomon Decoder For Stm-16 Optical Communications

    No full text
    In this paper, a low-power Reed-Solomon (RS) decoder for STM-16 optical communications is presented. It mainly contains one RS decoder and four 2K-bit embedded memory for correcting the received codewords. Except the novel syndrome calculator reducing half the syndrome computations, our proposal also features a modified Berlekamp-Massey algorithm in the key equation solver and a terminated mechanism in the Chien search circuit. The RS decoder is implemented by 0 CMOS 1P5M standard cells with gate counts of 32 9K and area of 2 . Simulation results show our approach can work successfully at the data rate of 2 5-Gbps and achieve 80% reduction of power dissipation on the average. 1

    A 520k (18900, 17010) Array Dispersion LDPC Decoder Architectures for NAND Flash Memory

    No full text
    corecore