2007
DOI: 10.1109/tcsii.2007.891753
|View full text |Cite
|
Sign up to set email alerts
|

Survivor Path Processing in Viterbi Decoders Using Register Exchange and Traceforward

Abstract: Abstract-This brief proposes a new class of hybrid VLSI architectures for survivor path processing to be used in Viterbi decoders. The architecture combines the benefits of register exchange and traceforward algorithms, that is, low storage requirement and latency versus implementation efficiency. Based on a structural comparison, it becomes evident that the architecture can be efficiently applied to codes with a larger number of states where traceback-based architectures, which increase latency, are usually d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…In the literature, the SMU can be designed in RE [8,11,12,14,15] and trace back (TB) [12,13] styles. The RE style has shorter latency and higher decoding speed than the TB style.…”
Section: Segment-based Vdmentioning
confidence: 99%
“…In the literature, the SMU can be designed in RE [8,11,12,14,15] and trace back (TB) [12,13] styles. The RE style has shorter latency and higher decoding speed than the TB style.…”
Section: Segment-based Vdmentioning
confidence: 99%
“…The register-exchange (RE) approach is chosen since the number of states is low. Since an additional subset signal memory is needed for TCM, the least overhead is introduced since the decoding latency is the lowest compared to trace-back architectures, which have a least twice the latency [8]. Additionally, for TCM a demapper needs to be employed that delivers the most likely subset signal at a certain time.…”
Section: Survivor Path Unitmentioning
confidence: 99%
“…Depending on the algorithm used for the SP unit, the architecture becomes more or less related to the number of bits b and states N per trellis stage. For example, the register-exchange algorithm requires the trellis to be directly mapped onto hardware [8], which gives a stronger connection to b and N.…”
Section: Introductionmentioning
confidence: 99%
“…Nevertheless, the signature-based error detection schemes proposed in [5] can improve the reliability of the decoder circuits with minimum hardware redundancy. The hybrid VLSI architectures for SMU presented in [10] combine the benefits of Register Exchange (RE) and Traceforward (TF) algorithms to improve the latency and storage requirements of the Viterbi Decoder by trading-off implementation efficiency. However, as per the concern in the VLSI hardware implementation, BMU and SMU transpire to be purely forward logic, whereas PMU is recursive.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, PMU becomes an imperative power dissipator and speed bottleneck in achieving high throughput for the Viterbi decoder [11]. PMU also occupies a significant area (dependent on the transistor count) deeming its design [5,10,12]. The Add-Compare-Select (ACS) computational units in the PMU are time shared by several states in low-speed Viterbi Decoders whereas, there are ACSUs (equivalent to the number of states) in the PMU of a high-speed Viterbi Decoder [13].…”
Section: Introductionmentioning
confidence: 99%