In this paper, we propose an efficient architecture based on pre-computation for Viterbi decoders incorporating T-algorithm. Through optimization at both. A Fast ACSU Architecture for Viterbi Decoder Using T-Algorithm. Jinjin He, Huaping Liu, Senior Member, IEEE, and Zhongfeng Wang*, Senior Member, IEEE. High performance ACS for Viterbi decoder using pipeline T-Algorithm .. Z. Wang, A fast ACSU architecture for Viterbi decoder using T-Algorithm, in: Proc.
|Published (Last):||8 March 2009|
|PDF File Size:||11.2 Mb|
|ePub File Size:||9.41 Mb|
|Price:||Free* [*Free Regsitration Required]|
Implementation of Viterbi coder for text to speech synthesis M. In other words, If there are m remaining metrics after comparison in a stage, the computational overhead from this stage is at least m addition operations. Article Tools Print this article.
Low power Viterbi decoder for Trellis coded Modulation using T-algorithm
This architecture has been optimized to meet the iteration bound . Gor decoder Search for additional papers on this topic.
Firstbranch metrics are calculated in the B unit BMU from the received symbols. In this section, we address an important issue regarding SMU design when T -algorithm is employed.
There was a problem providing the content you requested
Modern digital communication systems usually employ convolutional codes with large constraint length for good decoding performance, which leads to large complexity and power consumption in Viterbi decoders. Ganesh KumarA. Topics Discussed in This Paper. Sri lakshmi is currently working as an assi. Therefore, the hardware overhead of the proposed VD is expected.
Low power Viterbi decoder for Trellis coded
The Basic idea of the precomputation algorithm was presented in . Thus we next focus on the power comparison between the full trellis VD and the proposed scheme. This is because t-algodithm former decoder has a much longer critical path and the synthesis tool took extra measures to improve the clock speed. This algorithm is architectyre for TCM systems which always employ high-rate convolutional codes.
In other words, the states can be grouped into m clusters, where all the clusters have the same number of states and all the states in the same cluster will be extended by the same Bs. Consider a VD for a convoluional code with a constraint length k, where each state receives p candidate paths. Seshasayanan International Conference on Information…. Where q is any positive qrchitecture that is less than n. Implementation of such a table is not trivial.
Very large scale integration VLSI systems. Implementing the 4-to-2 priority encoder is much simpler than implementing the to-6 priority encoder.
References Publications referenced by this vigerbi. However, for TCM systems, where high-rate convolutional codes are always employed, Two steps of precomputation could achieve the iteration bound or make a big difference in terms of clock speed. T-Algorithm has been shown to very efficient in reducing the power consumption ,. The precomputation architecture that incorporates T-algorithm efficiently reduces the power consumption of VDs without reducing the decoding speed appreciably.
In the conventional implementation of T -algorithm, the decoder can use the optimal state state with Poptwhich is always enabled, to output or trace back data. T-algoritnm, we assume that each remaining metric would cause a computational overhead of one addition operation. So, In terms of power consumption, the viterbi decoder is dominant module in a TCM decoder. Therefore, it is worth to discuss the optimal number of precomputation steps.
jsing In order to reduce the computational complexity as well as power consumption, low power schemes should be exploited for the VD in a TCM decoder. Each PM in all VDs is quantized as 12 bits.
Its t-algorjthm table is shown in Table II and the corresponding logics are shown in 10 and Viterbi decoder Viterbi algorithm Convolutional code Clock rate Computation.
Showing of 6 references.
A fast ACSU architecture for Viterbi decoder using T-algorithm – Semantic Scholar
This process is straightforward, although the mathematical details are tedious. The soft inputs of all VDs are quantized with 7 bits. Also, any kinds of low-power scheme would introduce extra hardware like the purge unit shown in Fig.
In the 1-step pre-computation architecture, we have pointed out that for the particular code shown in Fig. The synthesis targets to achieve the maximum clock speed for each case and the results are shown in Table III. There are two different types of SMU in the literature: