Channel Coding Essay

1320 Words3 Pages

In wireless networks we have high and time varying packet losses due to the effect of fading. One way to provide communication without effect of fading is to introduce channel coding and network coding in the system operation. Channel coding (redundant symbols/ bits at the physical layer) is to add redundant information into inside the packet to recover errors in the original information. Network coding (redundant packets at the network layer) is to add redundant information across multiple packets. The channel coding can be called as error correction and the latter network coding can be called as erasure correction. Specially, channel coding is a conventional error correction technique it can be used for point-to-point communication …show more content…

Conversely, erasure correction is always used as end-to-end communication. It can be operated on the packet level, and can be used at either link layer, network layer, or application layer. The traditional network coding allows the intermediate nodes along multiple interleaved paths to generate redundant network-coded packets without decoding all original packets in a distributed manner [1], [2], while the redundancy on network layer can also be used for error correction. Here we explain how to use joint network channel coding scheme based on LDPC codes for multiple access relay channel in section I and Section II. We proposed some preliminaries for our proposed schemes of Min-max relay selection algorithm on Section III. We proposed En masse relay selection schemes and detailed explanation about in Section IV. We shown that En masse relay selection schemes achieves significant performance gains compared to min-max selection criterion in Section V. II. NON-BINARY JOINT NETWORK CHANNEL …show more content…

R. Li, R. W. Yeung, and N. Cai, “Linear Network Coding,” IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371–381, Feb. 2003. [2] C. Fragouli, J.-Y. L. Boudec, and J.Widmer, “Network coding: an instant primer,” ACM SIGCOMM Comput. Commun. Rev., no. 1, Jan. 2006. [3] J. Huang, S. Zhou, and P. Willett, “Near-Shannon-limit linear-time encodable Non binary irregular LDPC codes,” in Proc. 2009 IEEE GLOBECOM, pp. 867–872. [4] R. G. Gallager, Low Density Parity Check Codes. MIT Press, 1963. [5] A.Bennatan and D. Burshtein, “Design and analysis of non binary LDPC codes for arbitrary discrete memoryless channels,” IEEE Trans. Inf. Theory, vol. 52, Feb. 2006. [6] F.R.Kschischang, B. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm, ”IEEE Trans.Inf. Theory, vol. 42, p. 498–519, Feb. 2001. [7] A. Chakrabarti, A. de Baynast, A. Sabharwal, and B. Aazhang. Ldpc code design for half-duplex decode-and-forward relaying. In Proc. 43rd Allerton Conf. on Communication, Control, and Computing, Sept. 2005. [8] X. Qin and R. Berry, “Opportunistic splitting algorithms for wireless networks,” in Proc. 2004 INFOCOM, pp.

More about Channel Coding Essay

Open Document