TY - JOUR
T1 - Determinate State Convolutional Codes
AU - Collins, Oliver M.
AU - Hizlan, Murad
PY - 1993/1/1
Y1 - 1993/1/1
N2 - A deteminate state convolutional code is formed from a conventional convolutional code by pruning away some of the possible state transitions in the decoding trellis. This staged power transfer proves to be an extremely efficient way of enhancing the performance of a concatenated coding system. This paper analyzes the decoder complexity and free distances of these new codes, determines some important statistical properties of the decoder output, and provides simulation results of performance at the low signal-to-noise ratios where a real communications system, would operate. The paper concludes with concise, practical examples. © 1993, Walter de Gruyter. All rights reserved.
AB - A deteminate state convolutional code is formed from a conventional convolutional code by pruning away some of the possible state transitions in the decoding trellis. This staged power transfer proves to be an extremely efficient way of enhancing the performance of a concatenated coding system. This paper analyzes the decoder complexity and free distances of these new codes, determines some important statistical properties of the decoder output, and provides simulation results of performance at the low signal-to-noise ratios where a real communications system, would operate. The paper concludes with concise, practical examples. © 1993, Walter de Gruyter. All rights reserved.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0027840339&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=0027840339&origin=inward
U2 - 10.1109/26.250827
DO - 10.1109/26.250827
M3 - Article
SN - 0090-6778
VL - 41
SP - 1785
EP - 1794
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 12
ER -