메뉴 건너뛰기




Volumn 34, Issue 9, 1986, Pages 890-897

Optimum Multiuser Asymptotic Efficiency

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0000980707     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1986.1096645     Document Type: Article
Times cited : (255)

References (23)
  • 1
    • 0022581781 scopus 로고
    • Minimum probability of error for asynchronous Gaussian multiple-access channels
    • Jan.
    • S. Verdu, “Minimum probability of error for asynchronous Gaussian multiple-access channels,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 85-96, Jan. 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 85-96
    • Verdu, S.1
  • 3
    • 0021466789 scopus 로고
    • Throughput analysis for code division multiple accessing of the spread spectrum channel
    • July
    • J. Y. N. Hui, “Throughput analysis for code division multiple accessing of the spread spectrum channel,” IEEE J. Select. Areas Commun., vol. SAC-2, pp. 482-486, July 1984.
    • (1984) IEEE J. Select. Areas Commun. , vol.SAC-2 , pp. 482-486
    • Hui, J.Y.N.1
  • 4
    • 0019531733 scopus 로고
    • Performance considerations of code division multiple-access systems
    • Feb.
    • C. L. Weber, G. K. Huth, and B. H. Batson, “Performance considerations of code division multiple-access systems,” IEEE Trans. Veh. Technol., vol. VT-30, pp. 3-9, Feb. 1981.
    • (1981) IEEE Trans. Veh. Technol. , vol.VT-30 , pp. 3-9
    • Weber, C.L.1    Huth, G.K.2    Batson, B.H.3
  • 5
    • 0021422463 scopus 로고
    • Error probability bounds and approximations for DS spread-spectrum communication systems with multiple tone or multiple access interference
    • May
    • R. H. Dou and L. B. Milstein, “Error probability bounds and approximations for DS spread-spectrum communication systems with multiple tone or multiple access interference,” IEEE Trans. Commun., vol. COM-32, pp. 493-502, May 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , pp. 493-502
    • Dou, R.H.1    Milstein, L.B.2
  • 6
    • 84939747684 scopus 로고
    • Optimum multi-user detection is NP-hard
    • June
    • S. Verdu, “Optimum multi-user detection is NP-hard,” in Abstr. IEEE Int. Symp. Inform. Theory, June 1985, p. 75.
    • (1985) Abstr. IEEE Int. Symp. Inform. Theory , pp. 75
    • Verdu, S.1
  • 8
    • 0016059840 scopus 로고
    • Adaptive maximum likelihood receiver for carrier-modulated data transmission systems
    • May
    • G. Ungerboeck, “Adaptive maximum likelihood receiver for carrier-modulated data transmission systems,” IEEE Trans. Commun., vol. COM-22, pp. 624-636, May 1974.
    • (1974) IEEE Trans. Commun. , vol.COM-22 , pp. 624-636
    • Ungerboeck, G.1
  • 9
    • 0015346024 scopus 로고
    • Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference
    • May
    • G. D. Forney, “Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 363-378, May 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 363-378
    • Forney, G.D.1
  • 10
    • 0016082410 scopus 로고
    • Optimum transmitting filter in digital PAM systems with a Viterbi detector
    • July
    • S. A. Fredricsson, “Optimum transmitting filter in digital PAM systems with a Viterbi detector,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 479-489, July 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 479-489
    • Fredricsson, S.A.1
  • 11
    • 0016549847 scopus 로고
    • The minimum distance for MLSE digital data systems of limited complexity
    • Sept.
    • R. R. Anderson and G. J. Foschini, “The minimum distance for MLSE digital data systems of limited complexity,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 544-551, Sept. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 544-551
    • Anderson, R.R.1    Foschini, G.J.2
  • 12
    • 0015683092 scopus 로고
    • A geometric theory of intersymbol interference. Part II: Performance of the maximum likelihood detector
    • Nov.
    • D. G. Messerschmitt, “A geometric theory of intersymbol interference. Part II: Performance of the maximum likelihood detector,” Bell Syst. Tech. J., vol. 52, pp. 1521-1539, Nov. 1973.
    • (1973) Bell Syst. Tech. J. , vol.52 , pp. 1521-1539
    • Messerschmitt, D.G.1
  • 13
    • 0019346683 scopus 로고
    • On the minimum Euclidean distance for a class of signal space codes
    • Jan.
    • T. Aulin and C.-E. Sundberg, “On the minimum Euclidean distance for a class of signal space codes,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 43-45, Jan. 1982.
    • (1982) IEEE Trans. Inform. Theory , vol.IT-28 , pp. 43-45
    • Aulin, T.1    Sundberg, C.-E.2
  • 14
    • 84939707046 scopus 로고
    • Minimum distance of heavily filtered continuous phase modulations
    • June
    • N. Seshadri and J. B. Anderson, “Minimum distance of heavily filtered continuous phase modulations,” in Abstr. IEEE Int. Symp. Inform. Theory, June 1985, p. 101.
    • (1985) Abstr. IEEE Int. Symp. Inform. Theory , pp. 101
    • Seshadri, N.1    Anderson, J.B.2
  • 16
    • 84976789814 scopus 로고
    • Efficient algorithms for shortest paths in sparse networks
    • Jan.
    • D. B. Johnson, “Efficient algorithms for shortest paths in sparse networks,” J. ACM, vol. 24, pp. 1-13, Jan. 1977.
    • (1977) J. ACM , vol.24 , pp. 1-13
    • Johnson, D.B.1
  • 17
    • 84939708729 scopus 로고
    • (CBMS-NSF Reg. Conf. Series in Appl. Math., no. 7). Philadelphia, PA: SIAM
    • R. E. Tarjan, Data Structures and Network Algorithms (CBMS-NSF Reg. Conf. Series in Appl. Math., no. 7). Philadelphia, PA: SIAM, 1983.
    • (1983) Data Structures and Network Algorithms
    • Tarjan, R.E.1
  • 18
    • 43249110140 scopus 로고
    • Cyclic dynamic programming: A procedure for problems with fixed delay
    • D. G. Luenberger, “Cyclic dynamic programming: A procedure for problems with fixed delay,” Oper. Res., vol. 19, pp. 1101-1110, 1971.
    • (1971) Oper. Res. , vol.19 , pp. 1101-1110
    • Luenberger, D.G.1
  • 19
    • 0019063738 scopus 로고
    • Optimal phases of maximal sequences for asynchronous spread-spectrum multiplexing
    • Sept. 11
    • F. D. Garber and M. B. Pursley, “Optimal phases of maximal sequences for asynchronous spread-spectrum multiplexing,” Electron. Lett., vol. 16, pp. 756-757, Sept. 11, 1980.
    • (1980) Electron. Lett. , vol.16 , pp. 756-757
    • Garber, F.D.1    Pursley, M.B.2
  • 20
    • 0020128671 scopus 로고
    • Error probability for direct-sequence spread-spectrum multiple-access communications—Part I: Upper and lower bounds
    • May
    • M. B. Pursley, D. V. Sarwate, and W. E. Stark, “Error probability for direct-sequence spread-spectrum multiple-access communications—Part I: Upper and lower bounds,” IEEE Trans. Commun., vol. COM-30, pp. 975-984, May 1982.
    • (1982) IEEE Trans. Commun. , vol.COM-30 , pp. 975-984
    • Pursley, M.B.1    Sarwate, D.V.2    Stark, W.E.3
  • 21
    • 0020127066 scopus 로고
    • Error probability for direct-sequence spread-spectrum multiple-access communications—Part II: Approximations
    • May
    • E. A. Geraniotis and M. B. Pursley, “Error probability for direct-sequence spread-spectrum multiple-access communications—Part II: Approximations,” IEEE Trans. Commun., vol. COM-30, pp. 985-995, May 1982.
    • (1982) IEEE Trans. Commun. , vol.COM-30 , pp. 985-995
    • Geraniotis, E.A.1    Pursley, M.B.2
  • 22
    • 0016549557 scopus 로고
    • A case where interference does not reduce capacity
    • Sept.
    • A. B. Carleial, “A case where interference does not reduce capacity,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 569-570, Sept. 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 569-570
    • Carleial, A.B.1
  • 23
    • 0003495131 scopus 로고
    • Optimum multi-user signal detection
    • Ph.D. dissertation, Dep. Elec. Comput. Eng., Univ. Illinois, Urbana-Champaign, Rep. T-151 Coordinated Sci. Lab., Aug.
    • S. Verdu, “Optimum multi-user signal detection,” Ph.D. dissertation, Dep. Elec. Comput. Eng., Univ. Illinois, Urbana-Champaign, Rep. T-151 Coordinated Sci. Lab., Aug. 1984.
    • (1984)
    • Verdu, S.1


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