메뉴 건너뛰기




Volumn 49, Issue 4, 2003, Pages 873-885

Ensuring convergence of the MMSE iteration for interference avoidance to the global optimum

Author keywords

Code division multiple access (CDMA); Interference avoidance; Iterative construction of signature sequences; Minimum mean square error (MMSE) receiver; Welch bound equality (WBE) sequences

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; CONVERGENCE OF NUMERICAL METHODS; CORRELATION METHODS; ERROR ANALYSIS; FUNCTIONS; ITERATIVE METHODS; RANDOM PROCESSES; SET THEORY;

EID: 0037397835     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.809595     Document Type: Article
Times cited : (63)

References (18)
  • 2
    • 0035395906 scopus 로고    scopus 로고
    • Iterative construction of optimum signature sequence sets in synchronous CDMA systems
    • July
    • S. Ulukus and R. Yates, "Iterative construction of optimum signature sequence sets in synchronous CDMA systems," IEEE Tram. Inform. Theory, vol. 47, pp. 1989-1998, July 2001.
    • (2001) IEEE Tram. Inform. Theory , vol.47 , pp. 1989-1998
    • Ulukus, S.1    Yates, R.2
  • 3
    • 0002031137 scopus 로고
    • Capacity region of Gaussian CDMA channels: The symbol-synchronous case
    • Monticello, IL
    • S. Verdú, "Capacity region of Gaussian CDMA channels: The symbol-synchronous case," in Proc. 24th Allerton Conf. Communications, Control and Computing, Monticello, IL, 1986, pp. 1025-1034.
    • (1986) Proc. 24th Allerton Conf. Communications, Control and Computing , pp. 1025-1034
    • Verdú, S.1
  • 4
    • 0028461974 scopus 로고
    • Optimum sequence multisets for synchronous code-division multiple-access channels
    • July
    • M. Rupf and J. Massey, "Optimum sequence multisets for synchronous code-division multiple-access channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1261-1266, July 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1261-1266
    • Rupf, M.1    Massey, J.2
  • 5
    • 0033185351 scopus 로고    scopus 로고
    • Optimal sequences and sum capacity of synchronous CDMA systems
    • Sept.
    • P. Viswanath and V. Anantharam, "Optimal sequences and sum capacity of synchronous CDMA systems," IEEE Trans. Inform. Theory, vol. 45, pp. 1984-1991, Sept. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 1984-1991
    • Viswanath, P.1    Anantharam, V.2
  • 7
    • 0033712073 scopus 로고    scopus 로고
    • Interference avoidance for wireless systems
    • Tokyo, Japan
    • C. Rose, S. Ulukus, and R. Yates, "Interference avoidance for wireless systems," in Proc. Vehicular Technology Conf., vol. 2, Tokyo, Japan, 2000, pp. 901-906.
    • (2000) Proc. Vehicular Technology Conf. , vol.2 , pp. 901-906
    • Rose, C.1    Ulukus, S.2    Yates, R.3
  • 8
    • 0035442563 scopus 로고    scopus 로고
    • CDMA codeword optimization: Interference avoidance and convergence via class warfare
    • Sept.
    • C. Rose, "CDMA codeword optimization: Interference avoidance and convergence via class warfare," IEEE Trans. Inform. Theory, vol. 47, pp. 2368-2382, Sept. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2368-2382
    • Rose, C.1
  • 10
    • 0003579258 scopus 로고    scopus 로고
    • Cambridge, U.K.: Cambridge Univ. Press
    • S. Verdú, Multiuser Detection. Cambridge, U.K.: Cambridge Univ. Press, 1998.
    • (1998) Multiuser Detection
    • Verdú, S.1
  • 12
    • 0036611603 scopus 로고    scopus 로고
    • Optimal sequences for CDMA with colored noise: A Schur-saddle function property
    • June
    • P. Viswanath and V. Anantharam, "Optimal sequences for CDMA with colored noise: A Schur-saddle function property," IEEE Trans. Inform. Theory, vol. 48, pp. 1295-1318, June 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 1295-1318
    • Viswanath, P.1    Anantharam, V.2
  • 13
    • 0003548072 scopus 로고    scopus 로고
    • Ph.D. dissertation, Univ. Calif., Berkeley, Elec. Eng. Comput. Ssi. Dept., Berkeley, CA
    • P. Viswanath, "Capacity of vector multiple access channels," Ph.D. dissertation, Univ. Calif., Berkeley, Elec. Eng. Comput. Ssi. Dept., Berkeley, CA, 2000.
    • (2000) Capacity of Vector Multiple Access Channels
    • Viswanath, P.1
  • 14
    • 0002027326 scopus 로고
    • Welch's bound and sequence sets for code-division multiple-access systems
    • R. Capocelli, A. D. Santis, and U. Vaccaro, Eds. New York: Springer-Verlag
    • J. 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 Science, R. Capocelli, A. D. Santis, and U. Vaccaro, Eds. New York: Springer-Verlag, 1991.
    • (1991) Sequences II: Methods in Communication, Security and Computer Science
    • Massey, J.1    Mittelholzer, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.