.png){kind=icon}
Return
A simplified computational kernel for trellis-based decoding
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2004.825743.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A simplified branch metric and add-compare-select (ACS) unit is presented for use in trellis-based decoding architectures. The simplification is based on a complementary property of best feedforward and some systematic feedback encoders. As a result, one adder is saved in every other ACS unit. Furthermore, only half the branch metrics have to be calculated. It is shown that this simplification becomes especially beneficial for rate 1/2 convolutional codes. Consequently, area and power consumption will be reduced in a hardware implementation.
Keywords:
add-compare-select (ACS)
branch metric
logMAP
very large-scale integration (VLSI)
Viterbi decoding
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSave no more
no more