A Min-Sum Iterative Decoder Based on Pulsewidth Message Encoding
Résumé
In this brief, we introduce a new iterative decoder implementation called pulsewidth-modulated min-sum (PWM-MS), in which messages are exchanged in a pulsewidth-encoded format. The advantages of this method are low switching activity, very low complexity check nodes, low routing congestion, and excellent energy efficiency. We implement a fully parallel PWM offset MS decoder for a (660, 484) regular (4, 15) low-density parity-check code with 4-bit quantization in 0.13-μm CMOS, with a core area of 5.76 mm2 (4.24-mm2 cell area or 556K equivalent and gates). In postlayout simulations, this decoder achieves an average information throughput of 5.71 Gb/s and an energy consumption of 65.8 pJ per information bit at a signal-to-noise ratio of 5.5 dB. Our results show a 21% reduction in area, a 0.6-dB improvement in coding gain, and an energy efficiency improvement of 19% over the comparable bit-serial MS decoder architecture. We also demonstrate 3-bit implementations, in which the coding gain is traded off for further improvements in throughput, area, and energy efficiency.
Mots clés
4-bit quantization
CMOS
LDPC codes
bit rate 5.71 Gbit/s
bit-serial min-sum decoder architecture
efficiency 19 percent
energy 65.8 pJ
energy efficiency
gain 0.6 dB
low routing congestion
low switching activity
low-density parity-check code
minsum iterative decoder
parallel PWM offset min-sum
pulsewidth message encoding
size 0.13 mum
very low complexity check nodes
CMOS integrated circuits
iterative decoding
parity check codes
Domaines
ElectroniqueOrigine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...