By Topic

Reduced complexity algebraic type Viterbi decoding of q-ary convolutional codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
K. S. Zigangirov ; Dept. of Telecommun., Lund Univ., Sweden

A reduced complexity algebraic type algorithm is described for decoding of convolutional codes over GF(q), q>2. It is founded on the same principles as algebraic-sequentia1 decoding. It is proved that for large q, the algorithm has better complexity-reliability tradeoff than the conventional Viterbi algorithm

Published in:

Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on

Date of Conference:

17-22 Sep 1995