Efficient VLSI Architectures for Error-correcting Coding

Efficient VLSI Architectures for Error-correcting Coding PDF Author: Tong Zhang
Publisher:
ISBN:
Category :
Languages : en
Pages : 242

Book Description


VLSI Architectures for Modern Error-Correcting Codes

VLSI Architectures for Modern Error-Correcting Codes PDF Author: Xinmiao Zhang
Publisher: CRC Press
ISBN: 148222965X
Category : Technology & Engineering
Languages : en
Pages : 410

Book Description
Error-correcting codes are ubiquitous. They are adopted in almost every modern digital communication and storage system, such as wireless communications, optical communications, Flash memories, computer hard drives, sensor networks, and deep-space probing. New-generation and emerging applications demand codes with better error-correcting capability. On the other hand, the design and implementation of those high-gain error-correcting codes pose many challenges. They usually involve complex mathematical computations, and mapping them directly to hardware often leads to very high complexity. VLSI Architectures for Modern Error-Correcting Codes serves as a bridge connecting advancements in coding theory to practical hardware implementations. Instead of focusing on circuit-level design techniques, the book highlights integrated algorithmic and architectural transformations that lead to great improvements on throughput, silicon area requirement, and/or power consumption in the hardware implementation. The goal of this book is to provide a comprehensive and systematic review of available techniques and architectures, so that they can be easily followed by system and hardware designers to develop en/decoder implementations that meet error-correcting performance and cost requirements. This book can be also used as a reference for graduate-level courses on VLSI design and error-correcting coding. Particular emphases are placed on hard- and soft-decision Reed-Solomon (RS) and Bose-Chaudhuri-Hocquenghem (BCH) codes, and binary and non-binary low-density parity-check (LDPC) codes. These codes are among the best candidates for modern and emerging applications due to their good error-correcting performance and lower implementation complexity compared to other codes. To help explain the computations and en/decoder architectures, many examples and case studies are included. More importantly, discussions are provided on the advantages and drawbacks of different implementation approaches and architectures.

Efficient VLSI Architectures for Error Control Coders

Efficient VLSI Architectures for Error Control Coders PDF Author: Sang-Min Kim
Publisher:
ISBN:
Category :
Languages : en
Pages : 274

Book Description


High-speed VLSI Architectures for Error-correcting Codes and Cryptosystems

High-speed VLSI Architectures for Error-correcting Codes and Cryptosystems PDF Author: Xinmiao Zhang
Publisher:
ISBN:
Category :
Languages : en
Pages : 346

Book Description


VLSI Architectures For Soft-Decision Decoding Of Reed-Solomon Codes

VLSI Architectures For Soft-Decision Decoding Of Reed-Solomon Codes PDF Author: Jiangli Zhu
Publisher: LAP Lambert Academic Publishing
ISBN: 9783659239427
Category :
Languages : en
Pages : 184

Book Description
Error-correcting coding has become one integral part in nearly all the modern data transmission and storage systems. Due to the powerful error-correcting capability, Reed-Solomon (RS) codes are among the most extensively used error-correcting codes with applications in wireless communications, deep-space probing, magnetic and optical recording, and digital television. Traditional hard-decision decoding (HDD) algorithms of RS codes can correct as many symbol errors as half the minimum distance of the code. Recently, much attention has been paid to algebraic soft-decision decoding (ASD) algorithms of RS codes. These algorithms incorporate channel probabilities into an algebraic interpolation process. As a result, significant coding gain can be achieved with a complexity that is polynomial in codeword length. Practical ASD algorithms include the Koetter-Vardy, low-complexity Chase (LCC) and bit-level generalized minimum distance (BGMD) decodings. This book focuses on the design of efficient VLSI architectures for ASD decoders.

Advanced Hardware Design for Error Correcting Codes

Advanced Hardware Design for Error Correcting Codes PDF Author: Cyrille Chavet
Publisher: Springer
ISBN: 3319105698
Category : Technology & Engineering
Languages : en
Pages : 197

Book Description
This book provides thorough coverage of error correcting techniques. It includes essential basic concepts and the latest advances on key topics in design, implementation, and optimization of hardware/software systems for error correction. The book’s chapters are written by internationally recognized experts in this field. Topics include evolution of error correction techniques, industrial user needs, architectures, and design approaches for the most advanced error correcting codes (Polar Codes, Non-Binary LDPC, Product Codes, etc). This book provides access to recent results, and is suitable for graduate students and researchers of mathematics, computer science, and engineering. • Examines how to optimize the architecture of hardware design for error correcting codes; • Presents error correction codes from theory to optimized architecture for the current and the next generation standards; • Provides coverage of industrial user needs advanced error correcting techniques. Advanced Hardware Design for Error Correcting Codes includes a foreword by Claude Berrou.

Low Complexity, High Speed VLSI Architectures for Error Correction Decoders

Low Complexity, High Speed VLSI Architectures for Error Correction Decoders PDF Author: Yanni Chen
Publisher:
ISBN:
Category :
Languages : en
Pages : 294

Book Description


Efficient VLSI Architectures for Non-binary Low Density Parity Check Decoding

Efficient VLSI Architectures for Non-binary Low Density Parity Check Decoding PDF Author: Fang Cai
Publisher:
ISBN:
Category :
Languages : en
Pages : 95

Book Description
Non-binary low-density parity-check (NB-LDPC) codes can achieve better error-correcting performance than binary LDPC codes when the code length is moderate at the cost of higher decoding complexity. The high complexity is mainly caused by the complicated computations in the check node processing and the large memory requirement. In this thesis, two VLSI designs for NB-LDPC decoders based on two novel check node processing schemes are proposed. The first design is based on forward-backward check node processing. A novel scheme and corresponding architecture are developed to implement the elementary step of the check node processing. In our design, layered decoding is applied and only nm less than q messages are kept on each edge of the associated Tanner graph. The computation units and the scheduling of the computations are optimized in the context of layered decoding to reduce the area requirement and increase the speed. This thesis also introduces an overlapped method for the check node processing among different layers to further speed up the decoding. From complexity and latency analysis, our design is much more efficient than any previous design. Our proposed decoder for a (744, 653) code over GF(32) has also been synthesized on a Xilinx Virtex-2 Pro FPGA device. It can achieve a throughput of 9.30 Mbps when 15 decoding iterations are carried out. The second design is based on a proposed trellis based check node processing scheme. The proposed scheme first sorts out a limited number of the most reliable variable-to-check (v-to-c) messages, then the check-to-variable (c-to-v) messages to all connected variable nodes are derived independently from the sorted messages without noticeable performance loss. Compared to the previous iterative forward-backward check node processing, the proposed scheme not only significantly reduced the computation complexity, but eliminated the memory required for storing the intermediate messages generated from the forward and backward processes. Inspired by this novel c-to-v message computation method, we propose to store the most reliable v-to-c messages as 'compressed' c-to-v messages. The c-to-v messages will be recovered from the compressed format when needed. Accordingly, the memory requirement of the overall decoder can be substantially reduced. Compared to the previous Min-max decoder architecture, the proposed design for a (837, 726) code over GF(32) can achieve the same throughput with only 46% of the area.

Efficient VLSI architectures for space-time coding algorithms

Efficient VLSI architectures for space-time coding algorithms PDF Author: Georgios Passas
Publisher:
ISBN:
Category :
Languages : en
Pages : 318

Book Description


VLSI Architectures and Associated CAD Algorithms for High Performance LDPC Codecs

VLSI Architectures and Associated CAD Algorithms for High Performance LDPC Codecs PDF Author: Marghoob Mohiyuddin
Publisher:
ISBN:
Category :
Languages : en
Pages : 82

Book Description
Error correcting codes are widely used in digital communication and storage applications. Traditionally, codec implementation complexity has been measured with a software implementation in mind. We address the VLSI implementation issues for the design of a class of error correcting codes - Low Density Parity Check Codes (LDPCs). Keeping hardware implementation issues in mind, we propose a heuristic algorithm to design an LDPC code. We also motivate the case for multi-rate LDPC coding/decoding and propose a reconfigurable VLSI architecture for multirate LDPC decoders. In addition, we describe a heuristic algorithm that computes an effective LDPC code of any given rate which by construction can be implemented on our reconfigurable LDPC decoder