Open Access Open Access  Restricted Access Subscription or Fee Access

Mobility Effects Combating through Efficient Low Complexity Technique

M. A. M. El-Bendary

Abstract


In this paper, efficient techniques are presented for reducing the mobility bad effects with enhancing the computational complexity of the overall system. It proposes the chaotic interleaver algorithm for the convolutional codes with the Viterbi decoding is presented. The presented interleaver is based on chaotic Baker map. It is applied with the (2,1,3) convolutional codes and compared with the (2,1,7) convolutional codes. The proposed interleaver is applied to different bits stream lengths of 1024, 2048, 4096, 8192, and 16384 bits. The simulation results show the superiority of the proposed chaotic interleaved convolutional codes scheme over the traditional schemes in the image transmission over the mobile channels with respect the shorter constraint length of the encoder. Also, the chaotic interleaver performs better with the packet length increasing. The chaotic interleaver enhances the security with the different secret key for every transmitted packet. The computer simulations are carried out using the widely accepted Jakes’ model. The results reveal that the proposed scenarios can be applied to the long bit stream packets technologies such as Wimax.


Keywords


Interleaved Convolutional Codes, Chaotic Interleaver, Wireless Communications, Mobility

Full Text:

PDF

References


Yuan D.,“The estimating on performance to interleaved BCH codes applied to the mobile communication channel”, IEEETENCON’91 India, Aug., 1991.

V. Bhargava, D. Haccoun, R. Matyas, and P. Nuspl, Digital Communications by Satellite. New York: Wiley, 1981.

S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliff, NJ: Prentice-Hall, 1983.

D. F. Yuan, Z. W. Li, A. Sui, and J. Luo, “Performance of interleaved (2,1,7) convolutional codes in mobile image communication system,” in Proc. IEEE Wireless Communications and Networking Conference (WCNC ’00), vol. 2, pp. 634–637, Chicago, Ill, USA, September 2000.

F. Chan and D. Haccoun, “Adaptive Viterbi Decoding of Convolutional Codes over Memoryless Channels,” IEEE Transactions on Communications, Vol. 45, No. 11, November 1997.

N. Benvenuto, L. Bettella, and R. Marchesani, “Performance of the Viterbi Algorithm forInterleaved Convolutional Codes,” IEEE Transactions on Vehicular Technology, Vol. 47, No. 3, August 1998.

J. J. Kong and K. K. Parhi, “Interleaved Convolutional Code and Its Viterbi Decoder Architecture,” EURASIP Journal on Applied Signal Processing 2003:13, 1328–1334.

J. S. Lee, Y. Wei Su and C. C. Shen,“ A Comparative Study of Wireless Protocols: Bluetooth, UWB, ZigBee, and Wi-Fi”, The 33rd Annual Conference of the IEEE Industrial Electronics Society (IECON), Nov. 5-8, 2007, Taipei, Taiwan.

B. Sidhu, H. Singh, and A. Chhabra,“Emerging Wireless Standards - WiFi, ZigBeeand WiMAX s”, World Academy of Science, Engineering and Technology 25 2007.

C. Xu, “Soft decoding algorithm for RS-CC concatenated codes in WIMAX system,” Vehicular Technology Conference, 2007.

Gazi, O. and A. ¨Ozg¨ur Yılmaz, “Turbo product codes based on convolutional codes,” ETRI Journal, Vol. 28, No. 4, August 2006.

M. Lentmaier and K. Sh. Zigangirov, “On Generalized Low-Density Parity-Check Codes Based on Hamming Component Codes,” IEEE Communications Letters, Vol. 3, No. 8, Aug. 1999.

M. Kaiser, W. Fong, and M. Sikora,“A Comparison of Decoding Latency for Block and Convolutional Codes”, Proceeding, ISCTA'09, Ambleside, UK.

J. Hagenauer, and L. Papke,“ Iterative Decoding of Binary Block and Convolutional Codes”, IEEE Transactions on Information Theory, Vol. 42, No. 2, March 1996.

S. Vafi, and T. Wysocki,“Performance of convolutional interleavers with different spacing parameters in turbo codes,” Proc. 6th Australian Workshop on Communications Theory, 2005, pp. 8-12.

E. N. Farag, M. I Elmasry, Mixed Signal VLSI Wireless Design Circuits and System, 1st Edition, Kluwer Academic Publishers, 1999.

T. S. Rappaport, “Wireless Communications”, Prentice Hall 1996.

S. H. Lee and E. K. Joo, , “The Effect of Block Interleaving in an LDPC-Turbo Concatenated Code”, ETRI Journal, Volume 28, Number 5, October 2006

G. Pekhteryev, Z. Sahinoglu, P. Orlik, and G. Bhatti, “Error Protection for Progressive Image Transmission Over Memoryless and Fading Channels”, IEEE Transactions on Communications, Vol. 46, No. 12, Dec. 1998.

F. Han, X. Yu, . and S. Han, " Improved Baker Map for Image Encryption" Proceedings of the First International Symposium on Systems and Control In Aerospace and Astronautics, ISSCAA 2006, pp.1273-1276.

J. Fridrich, “Image Encryption Based On Chaotic Maps" Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 1997, pp. 1105-1110.

F. Huang, F. Lei, " A Novel Symmetric Image Encryption Approach Based on a New Invertible Two-dimensional Map" Proceedings of the International Conference on Intelligent Information Hiding and Multimedia Signal Processing IIHMSP 2008, pp. 1340-1343.

S. C. Koduru and V. Chandrasekaran, “Integrated Confusion-Diffusion Mechanisms for Chaos Based Image Encryption” Proceedings of the IEEE 8th International Conference on Computer and Information Technology Workshops, 2008, pp. 260-263.

K. Usman, H. Juzojil and I. Nakajimal, “Medical Image Encryption Based on Pixel Arrangement and Random Permutation for Transmission Security" Proceedings of the 9th International Conference on e-Health Networking, Application and Services, 2007, pp. 244-247.

I. F. Elashry, O. S. Farag Allah, A. M. Abbas, S. El-Rabaie and F. E. Abd El-Samie, “ Homomorphic Image Encryption” Journal of Electronic Imaging, Vol . 18, No. 3, 033002, 2009, SPIE.

W. C. Jakes,“ Microwave Mobile Communications,” New York, John Wiley & SonsInc. ISBN 0-471-43720-4, 1-Feb. 1975.

Aldrich,“Correlations Genuine and Spurious in Pearson and Yule,” Statistical Science 10: 364-376. hppt://www.jstor.org/stable/2246135.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.