Hardware Implementation of a Fixed-Point Decoder for Low-Density Lattice Codes
Open Access
- 31 January 2022
- journal article
- research article
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 94 (1) , 101-116
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 $$\times$$ improvement in throughput compared to an implementation with 20 parallel variable nodes without pipelining. This implementation also achieves 24 $$\times$$ improvement in throughput over a baseline serial decoder.
Keywords
Funding Information
- Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada
- Intel Corporation
- CMC Microsystems
This publication has 20 references indexed in Scilit:
- Early stopping criterion for message-passing decoding of LDLC2015
- Parallel Concatenated Convolutional Lattice Codes With Constrained StatesIEEE Transactions on Communications, 2015
- Lattice Codes for Many-to-One Interference Channels With and Without Cognitive MessagesIEEE Transactions on Information Theory, 2015
- Practical code design for compute-and-forward2011
- Nested linear/lattice codes for structured multiterminal binningIEEE Transactions on Information Theory, 2002
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997
- On coding without restrictions for the AWGN channelIEEE Transactions on Information Theory, 1994
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981