A method in timing processing for Viterbi algorithm is proposed in this article based on the block diagram of composition. Further more, a solution scheme is proposed for soft-decision in each part of Viterbi decoder,...
详细信息
ISBN:
(纸本)9781467344975
A method in timing processing for Viterbi algorithm is proposed in this article based on the block diagram of composition. Further more, a solution scheme is proposed for soft-decision in each part of Viterbi decoder, and the problem about the timing of the clock pulse for hard-decision and serial input/parallel output in the decoding with soft-decision is introduced.
Among new technologies, Ultra Wideband (UWB) is gathering interests as a short-reach transmission system. At present, as one of the prevailing UWB systems, the MultiBand - orthogonal frequency division multiplexing (M...
详细信息
Among new technologies, Ultra Wideband (UWB) is gathering interests as a short-reach transmission system. At present, as one of the prevailing UWB systems, the MultiBand - orthogonal frequency division multiplexing (MB-OFDM) system has attracted much attention where convolutional code (CC) is used. The main contribution of this paper is to evaluate the bit error rate (BER) and decoding complexity performances of MB-OFDM with concatenated coding scheme and Dual Carrier Modulation (DCM) on IEEE 802.15.3a UWB multipath channel model. We employ the CC for the inner code and the Reed Solomon (RS) code for the outer code in the concatenated coding scheme. From the results of our computer simulation, we show good combination of coding rates in the concatenated coding scheme at the data rates of about 320, 400 480 Mbps. We also show that MB-OFDM with concatenated coding scheme can achieve the better BER than MB-OFDM with only CC. In addition, we show that the BER improvement of MB-OFDM with concatenated coding scheme over that with only CC becomes larger as the data rate becomes higher.
We investigate several types of linear codes constructed from two families of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. Plane models for such cu...
详细信息
We investigate several types of linear codes constructed from two families of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. Plane models for such curves are provided, and the Weierstrass semigroup at an F-q-rational point is shown to be symmetric.
In this paper, a trade-off analysis between concatenated codes consisting of a convolutional (CC) followed by a Reed-Solomon (RS) code versus low-density parity-check (LDPC) codes is presented. The analysis is based o...
详细信息
ISBN:
(纸本)9781467325660
In this paper, a trade-off analysis between concatenated codes consisting of a convolutional (CC) followed by a Reed-Solomon (RS) code versus low-density parity-check (LDPC) codes is presented. The analysis is based on a twofold criterion: coding gain for a target bit error rate (BER) of 10-6 and required decoder hardware complexity for a target data throughput of 10 Gbps. Furthermore, we have investigated relevant parameters which directly impact an efficient hardware implementation as well as the error correction performance of the LDPC decoder. These parameters include an attenuation factor in the min-sum layered (MSL) decoding algorithm, the finite word length of soft information and an early-termination (ET) strategy. The error correction performances are evaluated for 16-QAM modulation over an independent Rayleigh fading channel. The complexity of the RS-CC and LDPC decoders is estimated based on synthesis results using an Infineon 40 nm CMOS design kit.
暂无评论