Presentation 2003/7/16
An Efficient Searching Method for Best Convolutional Codes Using Iterative Calculation of Weight Spectrum
Yuuki OGAMI, Hiroshi SASANO, Takuya NISHIMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) To find the best convolutional code, we calculate weight spectrum of all code candidates. Since the number of codes grows exponentially with constraint length, it becomes very difficult to obtain the best code with relatively large constraint length. We show a new method of searching for the best convolutional code efficiently. The method searches first adequately restricted range of the code tree and iterates the search with expanding the range gradually to obtain weight spectrum of the code. In this search it discards codes with bad performance without calculating weight spectrum completly. We show that the proposed method can find the best code more efficiently than those presented before do.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) convolutional code / best code / weight spectrum / iterative calculation
Paper # IT2003-25
Date of Issue

Conference Information
Committee IT
Conference Date 2003/7/16(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient Searching Method for Best Convolutional Codes Using Iterative Calculation of Weight Spectrum
Sub Title (in English)
Keyword(1) convolutional code
Keyword(2) best code
Keyword(3) weight spectrum
Keyword(4) iterative calculation
1st Author's Name Yuuki OGAMI
1st Author's Affiliation School of Science and Engineering, Kinki University()
2nd Author's Name Hiroshi SASANO
2nd Author's Affiliation School of Science and Engineering, Kinki University
3rd Author's Name Takuya NISHIMURA
3rd Author's Affiliation School of Science and Engineering, Kinki University
Date 2003/7/16
Paper # IT2003-25
Volume (vol) vol.103
Number (no) 215
Page pp.pp.-
#Pages 5
Date of Issue