Related Experiment Video
Updated: Oct 2, 2025

Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
Hardware Implementation of a Fixed-Point Decoder for Low-Density Lattice Codes
Rachna Srivastava1, Vincent C Gaudet1, Patrick Mitran1
1Department of Electrical and Computer Engineering, University of Waterloo, 200 University Ave. W., Waterloo, ON N2L 3G1 Canada.
Abstract:
This paper describes a field-programmable gate array (FPGA) implementation of a fixed-point low-density lattice code (LDLC) decoder where the Gaussian mixture messages that are exchanged during the iterative decoding process are approximated to a single Gaussian. A detailed quantization study is first performed to find the minimum number of bits required for the fixed-point decoder to attain a frame error rate (FER) performance similar to floating-point. Then efficient numerical methods are devised to approximate the required non-linear functions. Finally, the paper presents a comparison of the performance of the different decoder architectures as well as a detailed analysis of the resource requirements and throughput trade-offs of the primary design blocks for the different architectures. A novel pipelined LDLC decoder architecture is proposed where resource re-utilization along with pipelining allows for a parallelism equivalent to 50 variable nodes on the target FPGA device. The pipelined architecture attains a throughput of 10.5 Msymbols/sec at a distance of 5 dB from capacity which is a 1.8 improvement in throughput compared to an implementation with 20 parallel variable nodes without pipelining. This implementation also achieves 24 improvement in throughput over a baseline serial decoder.
Related Concept Videos
Lattice Centering and Coordination Number
Types of Unit Cells
Imagine taking a large number of identical...
Bewley Lattice Diagram
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is...

