Practical codes for queueing channels: An algebraic, state-space, message-passing approach

2008 IEEE Information Theory Workshop, ITW

Volumn , Issue , 2008, Pages 318-322

  Coleman, Todd P ^a   Kiyavash, Negar ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CHLORINE COMPOUNDS; CLUSTER ANALYSIS; CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; DECODING; GRAPH THEORY; INFORMATION THEORY; MATRIX ALGEBRA; MESSAGE PASSING; PROBABILITY DISTRIBUTIONS; PROGRAMMING THEORY; RANDOM VARIABLES; STATE SPACE METHODS;

ARRIVAL PROCESS; CODE-WORDS; CODING SCHEMES; CONDITIONAL DISTRIBUTIONS; CUMULATIVE DISTRIBUTIONS; DEPARTURE PROCESS; FACTOR GRAPHS; FINITE FIELDS; GRAPHICAL STRUCTURES; INTER-SYMBOL INTERFERENCES; LDPC CODING; LOW-COMPLEXITY; PROBABILISTIC DYNAMICS; SPARSE GRAPHS; STATE SPACES; TIMING CHANNELS;

ITERATIVE DECODING;

EID: 51849162372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2008.4578677     Document Type: Conference Paper

References (19)

1. V. Anantharam and S. Verdu, "Bits through queues," IEEE Transactions on Information Theory, vol. 42, no. 1, pp. 4-18, 1996.
2. _, "Reflections on the 1998 Information Theory Society Paper Award: Bits Through Queues," IEEE Information Theory Society Newsletter, pp. 100-102, December 1999.
3. R. Sundaresan and S. Verdu, "Sequential decoding for the exponential server timing channel," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 705-709, March 2000.
4. A. B. Wagner and V. Anantharam, "Zero-rate reliability of the exponential-server timing channel," IEEE Transactions on Information Theory, vol. 51, no. 2, pp. 447-465, February 2005.
5. T. P. Coleman, N. Kiyavash, and V. Subramanian, "The rate-distortion function of poisson processes with a queueing distortion measure," in IEEE Data Compression Conference, Snowbird, Utah, 2008.
6. R. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer, 1996.
7. L. Kleinrock, Queueing Systems. Vol 1: Theory. New York, NY: Wiley, 1975.
8. R. G. Gallager, Information Theory and Reliable Communication. New York: John Wiley & Sons, 1968.
9. G. Forney, "Codes on graphs: Normal realizations," IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 520-548, 2001.
10. H. Loeliger, "An introduction to factor graphs," IEEE Signal Processing Magazine, vol. 21, no. 1, pp. 28-41, 2004.
11. A. S. Bedekar and M. Azizoglu, "The information-theoretic capacity of discrete-time queues," IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 446-461, 1998.
12. B. Prabhakar and R. Gallager, "Entropy and the timing capacity of discrete queues," IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 357-370, February 2003.
13. A. Bennatan and D. Burshtein, "Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels," IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 549-583, February 2006.
14. E. A. Ratzer and D. J. C. Mackay, "Sparse low-density parity-check codes for channels with cross-talk," in Proceedings of IEEE Information Theory Workshop (ITW), March/April 2003.
15. C. Fragouloi, R. D. Wesel, D. Sommer, and G. Fettweis, "Turbo codes with nonuniform QAM constellations," in Proceedings of IEEE International Conference on Communication, Helsinki, Finland, June 2001, pp. 70-73.
16. F.-W. Sun and H. C. A. van Tilborg, "Approaching capacity by equiprobable signaling on the Gaussian channel," IEEE Transactions on Information Theory, vol. 39, no. 5, pp. 1714-1716, September 1993.
17. Z. Wu, J. Cioffi, M. Inc, and C. Sunnyvale, "Low-complexity iterative decoding with decision-aided equalization for magnetic recording channels," Selected Areas in Communications, IEEE Journal on, vol. 19, no. 4, pp. 699-708, 2001.
18. M. Tuchler, R. Koetter, and A. Singer, "Turbo equalization: principles and new results," Communications, IEEE Transactions on, vol. 50, no. 5, pp. 754-767, 2002.
19. A. Kavcic, X. Ma, and M. Mitzenmacher, "Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds," Information Theory, IEEE Transactions on, vol. 49, no. 7, pp. 1636-1652, 2003.