SCRAP Header

FEC – Based Iterative transmission data through wireless network

IJEECC Front Page
Author(s):
B.Usha, S.Priyanga, A.Mary
Volume
1, Issue 2
Pages:
219-222
Year of Publication:
December, 2014
Indian Journal of Emerging Electronics in Computer Communications
ISSN:
2393-8366
Citation: B.Usha, S.Priyanga, A.Mary."FEC – Based Iterative transmission data through wireless network." Indian Journal of Emerging Electronics in Computer Communications,1.2(2014):219-222.
Full Text Download

Abstract:
Transform data from one wireless network to another in efficient manner.Perform number of operation directly on the transformed data with the controlled loss of accuracy. Turbo codes and Forward error correcting codes (FEC) scheme for data and overhead channels. Many efficient algorithms have been proposed for decoding these codes. Introduce a universal decoder to handle these two families of codes. TCP congestion control is implemented. The present work exploits the parity-check matrix (H) representation of tail biting convolutional and turbo codes. Enabling decoding via a unified belief propagation (BP) algorithm. BP algorithm provides a highly effective general methodology for devising low-complexity iterative decoding algorithms for all convolutional code classes as well as turbo codes. Performance analysis in terms of accuracy and memory footprint.
Keywords:Traffic analysis, iterative decoding, progressive transmission.

References:

  1. Ahmed Refaey, Sébastien Roy, and Paul Fortier “A New Approach for FEC Decoding Based on the BP Algorithm in LTE and WiMAX Systems” Department of Electrical and Computer Engineering Université Laval, G1V 0A6, Québec, Canada
  2. V. K. Goyal, “Multiple description coding: Compression meets the network,” IEEE Signal Process. Mag., vol. 18, no. 5, pp. 74–93, Sep. 2001
  3. W. Yu, M. Ardakani, B. Smith, F. FKschischang,“Complexity optimized low-density parity-check codes for Gallager decoding algorithm B”.
  4. M. van der Schaar and H. Radha, “Unequal packet loss resilience for fine-granular-scalability video,” IEEE Trans. Multimedia, vol. 3, no. 4,pp. 381–394, Dec. 2001.
  5. D. J. C. MacKay,“Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory, Vol. 45, No. 2, pp. 399-431,1999.
  6. A. J. Viterbi, “Convolutional Codes and their Performance in Communication Systems,” IEEE Trans. On Commun., vol. 19, no. 15, pp. 751-772,1971.
  7. Y. Shen, P. C. Cosman, and L. B. Milstein, “Video coding with fixed length packetization for a tandem channel,” IEEE Trans. Image Process., vol. 15, no. 2, pp. 273–288, Feb. 2006.
  8. P. Cosman, J. Rogers, P. G. Sherwood, and K. Zeger, “Combined forward error control and packetized zerotree wavelet encoding for transmission of images over varying channels,” IEEE Trans. Image Process., vol. 9, no. 6, pp. 982–993, Jun. 2000.
  9. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo codes,” IEEE Intl. Conf. on Commun., vol. 2, Geneva, Switzerland, pp. 1064-1070, 1993.
  10. P. G. Sherwood and K. Zeger, “Error protection for progressive image transmission over memoryless and fading channels,” IEEE Trans. Commun., vol. 46, no. 12, pp. 1555–1559, Dec. 1998.