Abstract
Both turbo Hadamard codes and concatenated zigzag Hadamard codes are ultimate-Shannonlimit-approaching channel codes. The former one requires the use of Bahl-Cocke-Jelinek-Raviv (BCJR) in the iterative decoding process, making the decoder structure more complex and limiting its throughput. The latter one, however, does not involve BCJR decoding. Hence its decoder structure can be much simpler and can potentially operate at a much higher throughput. In this paper, we investigate the hardware design of a concatenated zigzag Hadamard encoder/decoder system and implement it onto an FPGA board. We design a decoder capable of decoding multiple codewords at the same time, and the proposed system can operate with a throughput of 1.44 Gbps - an increase of 50% compared with the turbo Hadamard encoder/decoder system. As for the error performance, the encoder/decoder system with a 6-bit quantization achieves a bit error rate of 2 × 10 -5 at E b /N 0 = -0.2 dB.
Highlights
With the fast development of communication technologies, the requirements on forward-error-correction (FEC) codes are becoming more and more rigorous
We investigate the hardware design of a concatenated zigzag Hadamard encoding/decoding system
CONCATENATED ZIGZAG HADAMARD CODE Fig. 2 shows the code structure of a CZHC [14] with M component codes. (When the zigzag Hadamard encoders in Fig. 2 are replaced by convolutional Hadamard encoders, the output codeword becomes a turbo Hadamard codes (THCs) [12].) M copies of the same but interleaved information bits are sent to M zigzag Hadamard encoders producing M copies of parity bits
Summary
With the fast development of communication technologies, the requirements on forward-error-correction (FEC) codes are becoming more and more rigorous. We investigate the hardware design of a concatenated zigzag Hadamard encoding/decoding system. S. Jiang et al.: Hardware Design of Concatenated Zigzag Hadamard Encoder/Decoder System With High Throughput. C. CONCATENATED ZIGZAG HADAMARD CODE Fig. 2 shows the code structure of a CZHC [14] with M component codes. (When the zigzag Hadamard encoders in Fig. 2 are replaced by convolutional Hadamard encoders, the output codeword becomes a THC [12].) M copies of the same but interleaved information bits are sent to M zigzag Hadamard encoders producing M copies of parity bits. The r information bits in each segment together with the common bit are sent to the Hadamard encoder, producing Hadamard codewords. 4) Send the original information bits together with all the parity-check bits generated from all component encoders to the channel
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
