The maximum squared correlation, sum capacity, and total asymptotic efficiency of minimum total-squared-correlation binary signature sets

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 348-355

  Karystinos, George N ^a,b   Pados, Dimitris A ^a  

^a UNIVERSITY AT BUFFALO   (United States)

^b Wright State University   (United States)

Author keywords

Binary sequences; Code division multiplexing; Code division multiple access (CDMA); Codes; Signal design; Spread spectrum communications; Welch bound

Indexed keywords

BINARY SEQUENCES; CODE DIVISION MULTIPLE ACCESS; CODES (SYMBOLS); MATRIX ALGEBRA; OPTIMIZATION; SIGNAL TO NOISE RATIO; WHITE NOISE;

CODE DIVISION MULTIPLEXING; SIGNAL DESIGN; WELCH BOUNDS;

SPREAD SPECTRUM COMMUNICATION;

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

References (17)

1. L. R. Welch, "Lower bounds on the maximum cross correlation of signals," IEEE Trans. Inf. Theory, vol. IT-20, no. 3, pp. 397-399, May 1974.
2. M. Rupf and J. L. Massey, "Optimum sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1261-1266, Jul. 1994.
3. P. Viswanath, V. Anantharam, and D. N. C. Tse, "Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1968-1983, Sep. 1999.
4. P. Cotae, "An algorithm for obtaining Welch bound equality sequences for S-CDMA channels," AEÜ. Int. J. Electron. Commun., vol. 55, pp. 95-99, Mar. 2001.
5. S. Ulukus and R. D. Yates, "Iterative construction of optimum signature sequence sets in synchronous CDMA systems," IEEE Trans. Inf. Theory vol. 47, no. 5, pp. 1989-1998, Jul. 2001.
6. C. Rose, "CDMA codeword optimization: Interference avoidance and convergence via class warfare," IEEE Trans. Inf. Theory, vol. 47, no. 6, pp. 2368-2382, Sep. 2001.
7. S. Verdú, "Capacity region of Gaussian CDMA channels: The symbol-synchronous case," in Proc. 24th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 1986, pp. 1025-1034.
8. D. Parsavand and M. K. Varanasi, "RMS bandwidth constrained signature waveforms that maximize the total capacity of PAM-synchronous CDMA channels," IEEE Trans. Commun., vol. 44, no. 1, pp. 65-75, Jan. 1996.
9. G. N. Karystinos and D. A. Pados, "New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets," IEEE Trans. Commun., vol. 51, no. 1, pp. 48-51, Jan. 2003.
10. C. Ding, M. Golin, and T. Kløve, "Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets," Des., Codes Cryptogr., vol. 30, pp. 73-84, Aug. 2003.
11. V. P. Ipatov, "On the Karystinos-Pados bounds and optimal binary DS-CDMA signature ensembles," IEEE Commun. Lett., vol. 8, no. 2, pp. 81-83, Feb. 2004.
12. P. Viswanath and V. Anantharam, "Optimal sequences and sum capacity of synchronous CDMA systems," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1984-1991, Sep. 1999.
13. F. Vanhaverbeke and M. Moeneclaey, "Sum capacity of the OCDMA/OCDMA signature sequence set," IEEE Commun. Lett., vol. 6, no. 8, pp. 340-342, Aug. 2002.
14. G. N. Karystinos and D. A. Pados, "Binary CDMA signature sets with concurrently minimum total-squared-correlation and maximum-squared-correlation," in Proc. 2003 IEEE Int. Conf. Communications, vol. 4, Anchorage, AK, May 2003, pp. 2500-2503.
15. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
16. C. D. Meyer, Matrix Analysis and Applied Linear Algebra. Philadelphia, PA: SIAM, 2000.
17. F. Vanhaverbeke, M. Moeneclaey, and H. Sari, "DS/CDMA with two sets of orthogonal spreading sequences and iterative detection," IEEE Commun. Lett., vol. 4, no. 9, pp. 289-291, Sep. 2000.