By Topic

On classes of rate k/(k+1) convolutional codes and their decoding techniques

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
$31 $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

3 Author(s)
CharnKeitKong, P. ; Nat. Electron. & Comput. Technol., Bangkok, Thailand ; Imai, H. ; Yamaguchi, K.

For the class of rate k/(k+1) convolutional codes, Yamada et al. (1983) proposed an efficient maximum-likelihood decoding algorithm called the YHM algorithm. In order to reduce the complexity of the YHM algorithm, this paper presents two techniques for simplifying the trellis diagram used in the YHM algorithm. We further observe that the proposed techniques effectively reduce the complexity of the YHM algorithm for two classes Ξ and Ξf (which is a subclass of Ξ) of rate k/(k+1) convolutional codes. The construction of codes in these classes is also discussed. It is shown that Ξ codes with d free=3,4 can be obtained by simple construction. A code search algorithm for Ξ codes with dfree⩾5 is also introduced. Computer searches are performed to construct good Ξ and Ξf codes. For specified decoding complexities, a number of these new codes give better error performance than previously reported codes

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 6 )