Constrained capacities for faster-than-nyquist signaling

IEEE Transactions on Information Theory

Volumn 55, Issue 2, 2009, Pages 764-775

  Rusek, Ffredrik ^a   Anderson, John B ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

Bandwidth efficient coding; Cconstrained capacities; Cfaster than Nyquist (FTN) signaling; Coded modulation; Intersymbol interference (ISI)

Indexed keywords

BEAMFORMING; INTERSYMBOL INTERFERENCE; MODULATION; POWER SPECTRAL DENSITY; PULSE SHAPING CIRCUITS; TELECOMMUNICATION SYSTEMS; TURBO CODES;

CCONSTRAINED CAPACITIES; CFASTER-THAN-NYQUIST (FTN) SIGNALING; CODED MODULATION; INTERSYMBOL INTERFERENCE (ISI); LINEAR MODULATIONS; ORTHOGONAL PULSE; ORTHOGONAL SIGNALING; PULSE SHAPES; SIGNAL POWER; ULTIMATE CAPACITIES;

SIGNALING;

EID: 61349138256     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2009832     Document Type: Article

References (27)

1. J. E. Mazo, "Faster-than-Nyquist signaling," Bell Syst. Tech. J. vol. 54, pp. 1451-1462, Oct. 1975.
2. D. Hajela, "On computing the minimum distance for faster-than-Nyquist signaling," IEEE Trans. Inf. Theory, vol. 36, no. 2, pp. 289-295, Mar. 1990.
3. J. E. Mazo and H. J. Landau, "On the minimum distance problem for faster-than-Nyquist signaling," IEEE Trans. Inf. Theory, vol. 34, no. 6, pp. 1420-1427, Nov. 1988.
4. A. D. Liveris and C. N. Georghiades, "Exploiting faster-than-Nyquist signaling," IEEE Trans. Commun., vol. 51, no. 9, pp. 1502-1511, Sep. 2003.
5. F. Rusek and J. B. Anderson, "Non binary and precoded faster than Nyquist signaling," IEEE Trans. Commun., vol. 56, no. 5, pp. 808-817, May 2008.
6. F. Rusek and J. B. Anderson, "Serial and parallel concatenations based on faster-than-Nyquist signaling," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 970-974.
7. F. Rusek and J. B. Anderson, "On information rates of faster-than-Nyquist signaling," in Proc. IEEE Global Communication Conf., San Francisco, CA, Nov. 2006.
8. E. N. Gilbert, "Increased information rate by oversampling," IEEE Trans. Inf. Theory, vol. 39, no. 6, pp. 1973-1976, Nov. 1993.
9. S. Shamai (ShItz), "Information rates by oversampling the sign of a bandlimited process," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1230-1236, Jul. 1994.
10. J. G. Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2001.
11. J. B. Anderson and A. Svensson, Coded Modulation Systems. New York: Plenum, 2003.
12. G. D. Forney, Jr., "Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Inf. Theory, vol. IT-18, no. 3, pp. 363-378, May 1972.
13. G. Ungerboeck, "Adaptive maximum-likelihood receiver for carrier-modulated data-transmission systems," IEEE Trans. Commun. vol. COM-22, no. 5, pp. 624-636, May 1974.
14. S. Shamai (Shitz), L. H. Ozarow, and A. D. Wyner, "Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs," IEEE Trans. Inf. Theory, vol. 37, no. 6, pp. 1527-1539, Nov. 1991.
15. W. Hirt, "Capacity and Information Rates of Discrete-Time Channels with Memory," Ph.D. dissertation, Inst. Signal and Information Processing, Swiss Federal Inst. Technol, Zurich, 1988, ETH 8671.
16. A. D. Liveris, "On Distributed Coding, Quantization of Channel Measurements and Faster-than-Nyquist Signaling," Ph.D. dissertation, Dept. Elec. Eng, Texas A&M Univ., College Station, TX, 2006.
17. R. A. Gibby and J. W. Smith, "Some extensions of Nyquist's telegraph transmission theory," Bell Syst. Tech. J., vol. 44, pp. 1487-1510, Sep. 1965.
18. F. Rusek, D. Kapetanovic, and J. B. Anderson, "The effect of symbol rate on constrained capacity for linear modulation," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, Jul. 2008, pp. 1093-1097.
19. B. Le Floch, M. Alard, and C. Berrou, "Coded orthogonal frequency division multiplex," Proc. IEEE, vol. 83, no. 6, pp. 982-996, Jun. 1995.
20. S. Shamai (Shitz) and R. Laroia, "The intersymbol interference channel: Lower bounds on capacity and channel precoding loss," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1388-1404, Sep. 1996.
21. S. Shamai (Shitz) and A. Dembo, "Bounds on the symmetric binary cutoff rate for dispersive Gaussian channels," IEEE Trans. Commun., vol. 42, no. 1, pp. 39-53, Jan. 1994.
22. D. M. Arnold, H.-A. Loeliger, P. O. Vontobel, A. Kavčić, and W. Zeng, "Simulation-based computation of information rates for channels with memory," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3498-3508, Aug. 2006.
23. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite state ISI channels," in Proc. IEEE Global Communication Conf., San Antonio, TX, Nov. 2001, pp. 2992-2996.
24. G. Colavolpe and A. Barbieri, "On MAP symbol detection for ISI channels using the Ungerboeck observation model," IEEE Commun. Lett., vol. 9, no. 8, pp. 720-722, Aug. 2005.
25. A. Said, "Design of Optimal Signals for Bandwidth-Efficient Linear Coded Modulation," Ph.D. dissertation, Dept. Elec., Computer and Systems Eng., Polytechnical Inst., Troy, NY, 1994.
26. A. Said and J. B. Anderson, "Design of optimal signals for bandwidth-efficient linear coded modulation," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 701-713, Mar. 1998.
27. G. J. Foschini, "Contrasting performance of faster binary signaling with QAM," Bell Syst. Tech. J., vol. 63, pp. 1419-1445, Oct. 1984.