By Topic

Searching for good fast recovery convolutional codes using importance sampling methods

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

2 Author(s)
Yung Chung Wei ; Dept. of Eng., Australian Nat. Univ., Canberra, ACT, Australia ; Lei Wei

In this paper, we study importance sampling (IS) methods to construct long convolutional codes with fast recovery capability. For codes with long memory length (m⩾12), the simulation method based on IS can avoid the excessive amount of computation required by other methods like analytical computation and standard Monte Carlo simulation. We establish a suboptimal IS method to search for good fast recovery convolutional codes with long memory lengths. The speed-up factors of two to six orders of magnitude over standard Monte Carlo simulation are obtained. Finally, we outline the code search procedures, present the code search results and give some applications of the codes

Published in:

Communications, 2000. ICC 2000. 2000 IEEE International Conference on  (Volume:3 )

Date of Conference: