Title :
Bounded minimum distance decoding of unit memory codes
Author :
Dettmar, Uwe ; Serger, U.K.
Author_Institution :
Inst. fur Netzwerk- und Signaltheorie, Tech. Hochschule Darmstadt, Germany
fDate :
3/1/1995 12:00:00 AM
Abstract :
We propose an algorithm for bounded minimum distance decoding of (partial) unit memory codes up to half the “designed” extended row distance. It makes use of a reduced trellis with the nodes found by bounded minimum distance decoding of the block codes used in the unit memory code. The results can be extended to general multimemory codes. The complexity of this algorithm is upper bounded by 2(d¯ 1r-2dα) times the complexity of the bounded minimum distance decoder of the block codes in the unit memory code. Here dα is the linear increase of the designed extended row distance d¯ir
Keywords :
Viterbi decoding; block codes; computational complexity; convolutional codes; maximum likelihood decoding; Viterbi trellis; algorithm complexity; block codes; bounded minimum distance decoder; bounded minimum distance decoding; convolutional codes; extended row distance; maximum likelihood decoding; multimemory codes; nodes; reduced trellis; unit memory codes; Algorithm design and analysis; Block codes; Computer errors; Convolutional codes; Decoding; Encoding; Error correction; Error correction codes; Information theory; Linear code; Maximum likelihood decoding; Notice of Violation; Semiconductor device packaging; Semiconductor memory; Table lookup;
Journal_Title :
Information Theory, IEEE Transactions on
