Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Dhingra, Ripple
- Convolutional Code Optimization for Various Constraint Lengths Using PSO
Abstract Views :294 |
PDF Views:0
Authors
Affiliations
1 IET Bhaddal, Punjab, IN
2 Dept. of Electronics Engineering, IET Bhaddal, Punjab, IN
1 IET Bhaddal, Punjab, IN
2 Dept. of Electronics Engineering, IET Bhaddal, Punjab, IN
Source
International Journal of Electronics and Communication Engineering, Vol 5, No 2 (2012), Pagination: 151-157Abstract
For transmitting and retrieving the digital data efficiently, channel coding techniques are used. Convolutional code is the most reliable method for transmitting or retrieving the error free data. Convolutional code encoder consists of shift registers and mod-2 adders. The performance of convolutional code depends upon the connections between shift registers and mod-2 adders. In this paper we are proposing a method for good convolutional code encoder structure for various constraint lengths using particle swarm optimization (PSO). The simulation results show that the proposed algorithm reduces the bit error rate (BER) with increase in constraint length.Keywords
Convolutional Code, PSO (Particle Swarm Optimization), BER (Bit Error Rate)
References
- Begin, G., Hacooun, D. and Paquin, C., Nov 1990, “Further Results on High- Rate Punctured Convolutional Codes for Viterbi and sequential decoding,” IEEE Transaction on information theory, Vol. 38, No. 11, pp. 1922-1928.
- Chang, J., Hawang, D. and lin,M., Sept 1997 , “ Some extended results on the search for good convolution codes,” IEEE Transaction on communication, Vol. 43, No. 5, pp. 1682-1697.
- Frenger, P., Orten, P.and Ottosson, T., Nov 1999, “Convolutional codes with optimum distance spectrum,” IEEE communication letters, Vol. 3, No. 11, pp. 317-319.
- Huang, X., Zhang,Y.and Xu, J., 200 , “Fast decoding of convolutional codes based on PS,” IEEE Fourth International Conference on Natural Computation, pp. 619-623.
- Berhia,H., Belkasmi, H. and Elbouanani, F., 2008, “ On decoding of convolutional codes using Genetic Algorithm,” IEEE International Conference on Computer and Communication Engineering, pp. 667-670.
- Kennedy, J. and Eberhart, R., 1995, “Particle Swarm Optimization,” IEEE International Conference on Neural Networks, Vol 4, pp. 1942–1948.
- Zhang, Q., Li, X. and Tran, Q., 2005, “A Modified PARTICLE SWARM OPTIMIZATION Algorithm”. IEEE International Conference on Machine Learning and Cybernetics, pp. 2993-2995.
- Schutze, O., Tabli, E. and Coello, C., 2007, “A Memetic PSO Algorithm for scalar optimization problems,” IEEE Swarm Intelligence symposium.
- Virabtamath, S.V. and Attimard, G.V., 2010, “Impact of constraint length on performance of Convolutional CODEC in AWGN channel for image application,” International Journal of Engineering Science and Technology, Vol. 2, pp. 4696-4700.
- Wesel, R.D., 2002, “Convolutional Code,” University of California at Los Angeles, California, pp. 1-8.
- Cedervall, M. and Johannesson, R., Nov.1989, “A fast algorithm for computing distance spectrum of convolution codes,” IEEE Transaction on Information Theory, Vol. 35, pp.1146-1159.
- Fran, Chan, C. and Haccoun, D., Nov 1997, “ Adaptive viterbi decoding of convolutional codes over memoryless channels,” IEEE Transaction on Communications, Vol. 45, No.11..
- Shi, Y. and Eberhart, R., 1998, “ A modified particle swarm optimizer,” IEEE International Conference on Evolutionary Computation, pp. 69–73.
- Larsen, K.J. , May 1973,“ Short convolutional codes with maximal free distance for rates 1/2, 1/3 and 1/4,”. IEEE Transaction on Information Theory, Vol. IT-19, pp. 371–372.