Complexity of Distributed Source Coding using LDPCA Codes 


Vol. 35,  No. 4, pp. 329-336, Apr.  2010


PDF
  Abstract

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Jang, J. W. Kang, S. Kim, "Complexity of Distributed Source Coding using LDPCA Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 4, pp. 329-336, 2010. DOI: .

[ACM Style]

Min Jang, Jin Whan Kang, and Sang-Hyo Kim. 2010. Complexity of Distributed Source Coding using LDPCA Codes. The Journal of Korean Institute of Communications and Information Sciences, 35, 4, (2010), 329-336. DOI: .

[KICS Style]

Min Jang, Jin Whan Kang, Sang-Hyo Kim, "Complexity of Distributed Source Coding using LDPCA Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 4, pp. 329-336, 4. 2010.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880