Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
720222 | The Journal of China Universities of Posts and Telecommunications | 2014 | 7 Pages |
Abstract
Punctured convolution codes (PCCs) have a lot of applications in modern communication system. The efficient way to search for best PCCs with longer constraint lengths is desired since the complexity of exhaustive search becomes unacceptable. An efficient search method to find PCCs is proposed and simulated. At first, PCCs' searching problem is turned into an optimization problem through analysis of PCCs' judging criteria, and the inefficiency to use pattern search (PS) for many local optimums is pointed out. The simulated annealing (SA) is adapted to the non-convex optimization problem to find best PCCs with low complexity. Simulation indicates that SA performs very well both in complexity and success ratio, and PCCs with memories varying from 9 to 12 and rates varying from 2/3 to 4/5 searched by SA are presented.
Related Topics
Physical Sciences and Engineering
Engineering
Electrical and Electronic Engineering
Authors
Wei-xia ZOU, Zhen-yu WANG, Gui-ye WANG, Guang-long DU, Ying GAO,