New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets

IEEE Transactions on Communications

Volumn 51, Issue 1, 2003, Pages 48-51

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

^a the State University of New York   (United States)

Author keywords

Binary sequences; Code division multiple access (CDMA); Codes; Signal design

Indexed keywords

ALGORITHMS; BINARY SEQUENCES; CORRELATION METHODS; DIRECT SEQUENCE SYSTEMS; MATRIX ALGEBRA; SIGNAL ENCODING; THEOREM PROVING;

BINARY SIGNATURE SETS; DIRECT SEQUENCE-CODE DIVISION MULTIPLE ACCESS; SIGNAL DESIGN; TOTAL SQUARED CORRELATION;

CODE DIVISION MULTIPLE ACCESS;

EID: 0037227590     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2002.807628     Document Type: Letter

References (15)

1. M. Rupf and J. L. Massey, "Optimum sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1261-1266, July 1994.
2. J. L. Massey and T. Mittelholzer, "Welch's bound and sequence sets for code-division multiple-access systems," in Sequences II, Methods in Communication, Security, and Computer Sciences, R. Capocelli, A. De Santis, and U. Vaccaro, Eds. New York: Springer-Verlag, 1993.
3. R. L. Welch, "Lower bounds on the maximum cross correlation of signals," IEEE Trans. Inform. Theory, vol. IT-20, pp. 397-399, May 1974.
4. 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. Inform. Theory, vol. 45, pp. 1968-1983, Sept. 1999.
5. 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.
6. S. Ulukus and R.D. Yates, "Iterative construction of optimum signature sequence sets in synchronous CDMA systems," IEEE Trans. Inform. Theory, vol. 47, pp. 1989-1998, July 2001.
7. C. Rose, "CDMA codeword optimization: interference avoidance and convergence via class warfare," IEEE Trans. Inform. Theory, vol. 47, pp. 2368-2382, Sept. 2001.
8. D. Sarwate, "Meeting the Welch bound with equality," in Sequences and Their Applications: Proceedings of SETA '98, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer-Verlag, 1999.
9. H. D. Schotten, "Sequence families with optimum aperiodic mean-square correlation parameters," in Sequences and Their Applications: Proceedings of SETA '98, C. Ding, T. Helleseth, and H. Niederreiter, Eds. London, U.K.: Springer-Verlag, 1999.
10. R. Gold, "Optimal binary sequences for spread spectrum multiplexing," IEEE Trans. Inform. Theory, vol. IT-13, pp. 619-621, Oct. 1967.
11. N. Zierler, "Linear recurring sequences," J. Soc. Ind. Appl. Math., vol. 7, pp. 31-48, Mar. 1959.
12. H. Rademacher, "Einige sätze über reihen von allgemeinen orthogonalfunktionen," Math. Annalen, vol. 87, pp. 112-138, 1922.
13. J. L. Walsh, "A closed set of normal orthogonal functions," Amer. J. Math., vol. 45, pp. 5-24, Jan. 1923.
14. E. H. Dinan and B. Jabbari, "Spreading codes for direct sequence CDMA and wideband CDMA cellular networks," IEEE Commun. Mag., vol. 36, pp. 48-54, Sept. 1998.
15. A. S. Hedayat, N. J. A. Sloane, and J. Stufken, Orthogonal Arrays: Theory and Applications. New York: Springer-Verlag, 1999.