Fully-Parallel Stochastic Decoder for Rate Compatible Modulation

Fang Lu

doi:10.1109/TCSI.2018.2812779

Return

Fully-Parallel Stochastic Decoder for Rate Compatible Modulation

2018-10-01

PRE

Fang Lu

董艳 (Yan Dong) *

Chang Wen Chen

DOI：10.1109/TCSI.2018.2812779

Original

Original request for help

Save

Abstract

En 中文

Rate compatible modulations (RCMs) are attractive for achieving seamless and blind rate adaptation under time varying channel. Although the decoding of RCM is inherently parallel, the highly complex processing nodes, and routing congestion have prohibited the implementation of fully-parallel decoders for high throughput. In this paper, we propose a new stochastic decoding algorithm for RCM to achieve desired parallel decoding. This algorithm provides even much better decoding performance than the floating-point belief propagation decoding algorithm with 20 iterations. To evaluate the effectiveness of the proposed algorithm, we apply it for the implementation of a field-programmable gate-array fully-parallel stochastic decoder that decodes a 400 x 400 mapping matrix. Several novel structure techniques, including the RAM-based channel stream generator and the configurable variable node, are exploited to reduce the logical resources consumption. The implemented decoder achieves a clock frequency of 220 MHz and provides a maximum throughput about 136Mb/s at SNR = 10 dB and the number of symbols is 400. To the best of our knowledge, this decoder is the first reported fully-parallel RCM decoder which achieves the highest decoding throughput. This research validates the potential of stochastic RCM decoding as a practical approach for area-efficient and high throughput decoders.

Keywords:

Rate compatible modulation (RCM)

iterative decoding

stochastic decoding

field programmable gate array (FPGA)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.