Downloads: 139 | Views: 148
M.Tech / M.E / PhD Thesis | Electronics & Communication Engineering | India | Volume 4 Issue 7, July 2015
A Memory Efficient -Fully Parallel QC-LDPC Encoder
Vishnu Nampoothiri V | Sajith Sethu P
Abstract: Low-Density Parity Check codes are a special class of linear block codes widely used in communication and disk storage systems, due to their Shannon limit approaching performance and their favourable structure. A special class of LDPC codes, called QC-LDPC codes, allows for efficient hardware implementations of encoding and decoding algorithms by exploiting the structure of the Parity Check Matrix (PCM), which is composed of circulant permutation matrices. These codes have encoding advantage over other types of LDPC codes. In this paper an efficient QC-LDPC encoder and decoder are developed. Belief propagation algorithm is used for decoding. Overall system is developed in Matlab and performances are compared for different rates. This work also introduces a memory efficient high throughput VHDL implementation for the encoder. Due to their error correction strength, QC-LDPC codes have been recently adopted in several industrial standards such as wireless local area networks (Wi-Fi, IEEE802.11 n, ac, and ad) and Digital Video Broadcasting- Satellite- Second Generation (DVB-S2).
Keywords: QC-LDPC codes, Encoding algorithm, Multilevel Expansion, LU decomposition, Parallel LDPC encoder, Throughput
Edition: Volume 4 Issue 7, July 2015,
Pages: 323 - 327
Similar Articles with Keyword 'Throughput'
Downloads: 128 | Weekly Hits: ⮙1 | Monthly Hits: ⮙1
Research Paper, Electronics & Communication Engineering, India, Volume 3 Issue 3, March 2014Pages: 108 - 112
Design and Simulation of Four Stage Pipelining Architecture Using the Verilog
Rakesh M. R
Research Paper, Electronics & Communication Engineering, India, Volume 12 Issue 3, March 2023Pages: 1717 - 1724
Enhancing Node Activation in Sensor Networks Using MOCL - RFSA for Maximized Coverage, Connectivity, and Minimized Interference
R. Christal Jebi  | S. Baulkani