Together with convolutional encoders, Viterbi decoders are commonly used to provide an excellent probability of error correction in wireless transmission. The encoder constraint length k must be set at higher values t...
详细信息
Together with convolutional encoders, Viterbi decoders are commonly used to provide an excellent probability of error correction in wireless transmission. The encoder constraint length k must be set at higher values to achieve an improved bit error rate. With the growth of the Internet of Things (IoT) in recent years, there is inevitable demand for low-power IoT applications. Unfortunately, an increase in the value of k causes the complexity of the algorithm to increase exponentially. Consequently, the Viterbi decoder's power consumption will increase exponentially, which is a detriment to many wireless communication devices. many of the Viterbi decoder's reduced complexity decoding approaches discussed in the past concentrated on the particular level of algorithms and architectures. most of the studies focused on the difficulty of the decoder's Add-Compare Select Unit (ACSU) repetitive processing. This paper analyzes many variations carried out in the ACSU of the Viterbi algorithm. Several separate algorithms were compared and an approach to a combined algorithm was suggested. This paper offered an in-depth description of the reduced computation and its design for the proposed algorithm. Each algorithm and reduced complexity are compared with the conventional VD. The impact of power consumption is evaluated through the bit-error-rate (BER) vs Signal-to-Noise ratio (SNR), such that the proposed algorithm was found to have the best dB gain between 0 dB and 5 dB, indicating a significant power improvement over the other algorithms.
Viterbi decoders are widely employed along with convolutional encoders to provide an excellent error correction probability in digital wireless transmissions. To achieve lower error rates, the constraint length (k) of...
详细信息
ISBN:
(纸本)9781538662885
Viterbi decoders are widely employed along with convolutional encoders to provide an excellent error correction probability in digital wireless transmissions. To achieve lower error rates, the constraint length (k) of the encoder, has to be defined at higher values. However, higher (k) results in increasingly complex implementations of the Viterbi algorithm. As a result, the power consumption of the Viterbi decoder will increase exponentially which is to the disadvantage of many wireless communication devices. many reduced complexity decoding techniques of the Viterbi decoder presented in the past focused on algorithm and architecture specific levels. most of the studies concentrated on the Add-Compare Select Unit (ACSU) of the decoder, due to its nature of repetitive processing;also add to the complexity of the process. This paper presents a review of several variations of the Viterbi algorithm performed in the ACSU. The comparison was made among several different algorithms with the most optimal algorithm presented in this paper. A combined algorithm approach is proposed at the end of the review for future improvement.
暂无评论