Coordinated multiuser communications

Coordinated Multiuser Communications

Volumn , Issue , 2006, Pages 1-270

  Schlegel, Christian ^a   Grant, Alex ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84895408259     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/1-4020-4075-X     Document Type: Book

References (173)

1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger. Closest point search in lattices. IEEE Trans. Inform. Theory, 48:2201-2214, 2002.
2. R. Ahlswede. Multi-way communication channels. In 2nd Int. Symp. Inform. Theory, pages 23-52, Tsahkadsor, Armenian S.S.R, 1971. Hungarian Academy of Sciences.
3. P. Alexander, M. Reed, J. Asenstorfer, and C. Schlegel. Iterative multiuser interference reduction: turbo CDMA. IEEE Trans. Commun., 47 (7):1008-14, July 1999.
4. P. D. Alexander. Coded Multiuser CDMA. PhD thesis, University of South Australia, 1996.
5. P. D. Alexander, A. J. Grant, and M. C. Reed. Iterative detection on code-division multiple-access with error control coding. Europ. Trans. Telecommun., 9(5):419-426, 1998.
6. P. D. Alexander and L. K. Rasmussen. Processing filter derivation for asynchronous time-varying CDMA. In International Symposium on Information Theory and Its Applications, volume 1, pages 151-154, Sydney, Australia, 1994.
7. P. D. Alexander, L. K. Rasmussen, and C. B. Schlegel. A linear receiver for coded multiuser CDMA. IEEE Trans. Commun., 45(5):605-610, 1997.
8. O. Axelsson. Iterative Solution Methods. Cambridge University Press, 1994.
9. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv. Optimal decoding of linear codes for minimising symbol error rate. IEEE Trans. Inform. Theory, 20:284-287, 1974.
10. Z. D. Bai and Y. Q. Yin. Limit of the smallest eigenvalue of large dimensional sample covariance matrix. Ann. Probab., 21:1275-1294, 1993.
11. S. Baro, J. Hagenauer, and M. Witzke. Iterative detection of MIMO transmission using a list-sequential (LISS) detector. In IEEE Conf. Commun., pages 2653-2657, 2003.
12. C. Berrou and A. Glavieux. Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. Commun., 44(10):1261-1271, 1996.
13. D. Bertsekas and R. Gallager. Data Networks. Prentice Hall, New Jersey, 1992.
14. P. A. B. M. C. V. D. Braak and H. C. A. V. Tilborg. A family of good uniquely decodeable code pairs for the two-access binary adder channel. IEEE Trans. Inform. Theory, IT-31(1):3-9, 1985.
15. M. V. Burnashev, C. Schlegel, W. A. Krzymien, and Z. Shi. Characteristics analysis of successive interference cancellation methods. Problemy Peredachi Informatsii, May 2004. Submitted.
16. G. Caire, R. R. Muller, and T. Tanaka. Iterative multiuser joint decoding: optimal power allocation and low-complexity implementation. IEEE Trans. Inform. Theory, 50(9):1950-1973, Sept. 2004.
17. S.-C. Chang. Further results on coding for T-user multiple access channels. IEEE Trans. Inform. Theory, IT-30(2):411-415, 1984.
18. S.-C. Chang and E.Weldon. Coding for T-user multiple access channels. IEEE Trans. Inform. Theory, IT-25(6):684-691, 1979.
19. S. C. Chang and J. K. Wolf. On the T-user M-frequency noiseless multiple access channel with and without intensity information. IEEE Trans. Inform. Theory, IT-27(1):41-48, 1981.
20. P. R. Chevillat. N-user trellis coding for a class of multiple-access channels. IEEE Trans. Inform. Theory, IT-27(1):114-120, 1981.
21. G. E. Corazza and A. Vanelli-Coralli. cdma2000. In Wiley Encyclopedia of Telecommunications, volume 1, pages 358-369. John Wiley & Sons, Hoboken, NJ, 2003.
22. T. M. Cover. Some advances in broadcast channels. In Advances in Communication Systems, volume 4, pages 229-260. Academic Press, New York, 1975.
23. T. M. Cover and S. K. Leung. An achievable rate region for the multiple access channel with feedback. IEEE Trans. Inform. Theory, IT-27(3): 292-298, 1981.
24. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley, New York, 1991.
25. H. Cramér. Mathematical Methods of Statistics. Princeton University Press, Princeton NJ, 1946.
26. M. O. Damen, H. El Gamal, and G. Caire. On maximum likelihood detection and the search for the closest lattice point. IEEE Trans. Inform. Theory, 49(10):2389-2402, Oct. 2003.
27. M. A. Deaett and J. K. Wolf. Some very simple codes for the nonsynchronized two-user multiple access adder channel with binary inputs. IEEE Trans. Inform. Theory, IT-24(5):635-636, 1978.
28. D. Divsalar, S. Dolinar, and F. Pollara. Iterative turbo decoder analysis based on density evolution. Technical Report 42-144, TMO Progress Report, Feb. 15 2001.
29. D. Divsalar and M. K. Simon. CDMA with interference cancellation for multiprobe missions. Technical Report 42-120, JPL-TDA, Feb. 1995. Progress Report.
30. A. Duel-Hallen. Decorrelating decision-feedback multiuser detector for synchronous code-division multiple-access channel. IEEE Trans. Commun., 41(2):285-290, 1993.
31. A. Duel-Hallen. A family of multiuser decision-feedback detectors for asynchronous code-division multiple-access channels. IEEE Trans. Commun., 43(2):421-434, 1995.
32. H. G. Eggleston. Convexity. Cambridge University Press, London, 1958.
33. H. El-Gamal and E. Geraniotis. Iterative multiuser detection for coded CDMA signals in AWGN and fading channels. IEEE J. Select. Areas Commun., 18(1):30-41, 2000.
34. H. Elders-Boll, A. Busboom, and H. D. Schotten. Spreading sequences for zero-forcing DS-CDMA multiuser detectors. In 8th IEEE Int. Symp. PIMRC '97, pages 53-57, Helsinki, Finland, Sept. 1997.
35. H. Elders-Boll, H.-D. Schotten, and A. Busboom. Efficient implementation of linear multiuser detectors for asynchronous CDMA systems by linear interference cancellation. Europ. Trans. Telecommun., 9(5):427-438, Sept-Oct 1998. Special Issue on Code Division Multiple Access Techniques for Wireless Communication Systems.
36. D. Eppstein. Finding the k shortest paths. Technical report, Dep. of Info. and Comp. Sci., University of California, 1994.
37. ETSI. Etsi/tc gsm recommendation 05.05: Transmission and reception, 1988.
38. ETSI/SMG/SMG2. The ETSI UMTS terrestrial radio access (UTRA) ITU-R RTT candidate submission, 1998.
39. B. Farhang-Boroujeny. MMSE linear processing for MIMO channel. Private communication, 2005.
40. P. G. Farrell. Survey of channel coding for multi-user systems. In J. Skwirynski, editor, New Concepts in Multi-User Communication, NATO Advanced Study Institute Series, pages 133-159. Sijthoff and Noordhoff, Alphen aan den Rijn, The Netherlands, 1981.
41. T. J. Ferguson. Generalised T-user codes for multiple-access channels. IEEE Trans. Inform. Theory, IT-28(5):775-779, 1982.
42. U. Fincke and M. Pohst. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation, 44(170):463-471, 1985.
43. R. A. Fisher. On the mathematical foundations of theoretical statistics. Phil. Trans. Royal Soc., London, A, 222:309, 1921.
44. R. A. Fisher. Theory of statistical estimation. Proc. Cambridge Phil. Soc., 22:700, 1925.
45. G. D. Forney, Jr. The Viterbi algorithm. Proc. IEEE, 61:268-278, 1973.
46. G. Foschini. Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas. Bell Labs Tech. J., 1(2):41-159, Aug. 1996.
47. G. J. Foschnini, G. D. Golden, R. A. Valenzuela, and P. W. Wolniansky. Simplified processing for high spectral efficiency wireless communication employing multi-element arrays. IEEE J. Select. Areas Commun., 17 (11):1841-1852, Nov. 1999.
48. N. T. Gaarder and J. K. Wolf. The capacity of a multiple access discrete memoryless channel can increase with feedback. IEEE Trans. Inform. Theory, IT-21:100-102, 1975.
49. R. G. Gallager. Information Theory and Reliable Communication. John Wiley and Sons, New York, 1968.
50. R. G. Gallager. A perspective on multiaccess channels. IEEE Trans. Inform. Theory, IT-31(2):124-142, 1985.
51. A. E. Gamal and T. M. Cover. Multiple user information theory. Proc. IEEE, 68(12):1466-1483, 1980.
52. T. R. Giallorenzi and S. G. Wilson. Multiuser ML sequence estimator for convolutionally coded asynchronous DS-CDMA systems. IEEE Trans. Commun., 44(8):997-1008, 1996.
53. T. R. Giallorenzi and S. G. Wilson. Suboptimum multiuser receivers for convolutionally coded asynchronous DS-CDMA systems. IEEE Trans. Commun., 44(9):1183-1196, 1996.
54. R. Gold. Optimum binary sequences for spread spectrum multiplexing. IEEE Trans. Inform. Theory, 13:619-621, 1967.
55. G. Golub and C. V. Loan. Matrix Computations. The John Hopkins University Press, 2 edition, 1989.
56. A. Grant and P. Alexander. Random sequence multisets for synchronous code-division multiple-access channels. IEEE Trans. Inform. Theory, 44 (7):2832-2836, 1998.
57. A. Grant, B. Rimoldi, R. Urbanke, and P. Whiting. Rate-splitting multiple access for discrete memoryless channels. IEEE Trans. Inform. Theory, 47(3):873-90, 2001.
58. A. Grant and C. Schlegel. Iterative implementations for linear multiuser detectors. IEEE Trans. Commun., 49(10):1824-1834, Oct. 2001.
59. J. Hagenauer. A soft-in/soft-out list sequential (LISS) decoder for turbo schemes. In IEEE Int. Symp. Inform. Theory, page 382, 2003.
60. R. A. Horn and C. R. Johnson. Matrix Analysis. Oxford University Press, Cambridge, 1990.
61. B. Hughes and A. B. Cooper. Nearly optimal multiuser codes for the binary adder channel. IEEE Trans. Inform. Theory, 42(2):387-398, 1996.
62. J. Hui. Throughput analysis for code division multiple accessing of the spread spectrum channel. IEEE J. Select. Areas Commun., SAC-2(4): 482-486, 1984.
63. J. Y. N. Hui and P. A. Humblet. The capacity region of the totally asynchronous multiple access channel. IEEE Trans. Inform. Theory, IT-31(2):207-216, 1985.
64. D. Jonsson. Some limit theorems for the eigenvalues of a sample covariance matrix. J. Mult. Anal., 12:1-38, 1982.
65. P. Jung and J. Blanz. Joint detection with coherent receiver antenna diversity in CDMA mobile radio systems. IEEE Trans. Veh. Technol., 44(1):76-88, 1995.
66. M. J. Juntti, B. Aazhang, and J. O. Lilleberg. Iterative implementations of linear multiuser detection for asynchronous CDMA systems. IEEE Trans. Commun., 46(4):503-508, April 1998.
67. T. Kasami and S. Lin. Coding for a multiple-access channel. IEEE Trans. Inform. Theory, IT-22(2):129-137, 1976.
68. T. Kasami and S. Lin. Bounds on the achievable rates of block coding for a memoryless multiple-access channel. IEEE Trans. Inform. Theory, IT-24(2):187-197, 1978.
69. T. Kasami and S. Lin. Decoding of linear δ-decodeable codes for a multiple-access channel. IEEE Trans. Inform. Theory, IT-24(5):633-636, 1978.
70. T. Kasami, S. Lin, V. Wei, and S. Yamamura. Graph theoretic approaches to the code construction for the two-user multiple-access binary adder channel. IEEE Trans. Inform. Theory, IT-29(1):114-130, 1983.
71. S. M. Kay. Fundamentals of Statistical Signal Processing Volume I: Estimation Theory. Prentice Hall, Mew Jersey, 1993.
72. S. M. Kay. Fundamentals of Statistical Signal Processing Volume II: Detection Theory. Prentice Hall, Mew Jersey, 1998.
73. G. K. Khachatrian. On the construction of codes for noiseless synchronized 2-user channel. Prob. Contr. Inform. Theory, 11:319-324, 1987.
74. G. Kramer. Feedback strategies for a classof two-user multiple-access channels. IEEE Trans. Inform. Theory, 45(6):2054-2059, Sept. 1999.
75. C. Kuhn and J. Hagenauer. Iterative list-sequential (LISS) detector for fading multiple-access channels. In IEEE Global Commun. Conf., pages 330-335, 2004.
76. H. Liao. Multiple access channels. PhD thesis, Dept. of Electrical Eng., University of Hawaii, 1972.
77. S. Lin and D. J. Costello, Jr. Error Control Coding: Fundamentals and Applications. Prentice-Hall, New Jersey, 1983.
78. S. Lin and D. J. Costello, Jr. Error Control Coding. Prentice-Hall, Englewood Cliffs, 2 edition, 2004.
79. R. Lupas and S. Verdú. Linear multiuser detectors for synchronous code-division multiple-access channels. IEEE Trans. Inform. Theory, 35(1):123-136, 1989.
80. R. Lupas and S. Verdú. Near-far resistance of multiuser detectors in asynchronous channels. IEEE Trans. Commun., 38(4):496-508, 1990.
81. D. J. C. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory, IT-45(2):399-431, 1999.
82. U. Madhow and M. L. Honig. MMSE interference suppression for direct- sequence spread-spectrum CDMA. IEEE Trans. Commun., 42(12): 3178-3188, 1994.
83. J. L. Massey. Information theory aspects of spread-spectrum communications. In The Fifth International Symposium on Personal, Indoor and Mobile Radio Communications, pages 16-20, The Hague, The Netherlands, 1994.
84. J. L. Massey and P. Mathys. The collision channel without feedback. IEEE Trans. Inform. Theory, IT-31(2):192-204, 1985.
85. 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 Science. Springer-Verlag, New York, 1993.
86. P. Mathys. A class of codes for a T-active users out of N multiple access communication system. IEEE Trans. Inform. Theory, 36(6):1206-1219, 1990.
87. E. C. v. d. Meulen. A survey of multi-way channels in information theory. IEEE Trans. Inform. Theory, IT-23(1):1-37, 1977.
88. M. Moher. An iterative multiuser decoder for near-capacity communications. IEEE Trans. Commun., 46(7):870-880, 1998.
89. M. Moher. Multiuser decoding for multibeam systems. IEEE Trans. Veh. Technol., 49(4):1226-1234, July 2000.
90. M. Moher, L. Erup, and R. G. Lyons. Interference statistics for multibeam satellites. In Second European Workshop on Mobile and Personal Satellite Comunications, pages 366-384, Oct. 1996.
91. H. Nyquist. Certain topics in telegraph transmission theory. AIEE Trans., 47:617-644, 1928.
92. E. Ordentlich. On the factor-of-two bound for Gaussian multiple-access channels with feedback. IEEE Trans. Inform. Theory, 42(6):2231-2235, 1996.
93. L. H. Ozarow. The capacity of the white Gaussian multiple access channel with feedback. IEEE Trans. Inform. Theory, IT-30:623-629, 1984.
94. P. Patel and J. Holtzman. Analysis of a simple successive interference cancellation scheme in a DS/CDMA system. IEEE J. Select. Areas Commun., 12(5):796-807, June 1994.
95. R. Peterson and D. Costello. Error probability and free distance bounds for two-user tree codes on multiple access channels. IEEE Trans. Inform. Theory, IT-26(6):658-670, 1980.
96. R. L. Peterson and D. J. Costello. Binary convolutional codes for a multiple-access system. IEEE Trans. Inform. Theory, IT-25(1):101-105, 1979.
97. R. L. Peterson, R. E. Ziemer, and D. E. Borth. Introduction to Spread Spectrum Communications. Prentice-Hall, 1995.
98. E. Plotnik. Code construction for asynchronous random multiple-access to the adder channel. IEEE Trans. Inform. Theory, 39(1):195-197, 1993.
99. M. Pohst. On the computation of lattice vectors of minimal length, succesive minima and reduced basis with applications. ACM SIGSAM, 15:37-44, 1981.
100. G. S. Poltyrev. Coding for channel with asynchronous multiple access. Probl. Peredachi Informatsii, 19(3):12-21, 1983.
101. H. Poor and S. Verdu. Probability of error in MMSE multiuser detection. IEEE Trans. Inform. Theory, pages 858-871, May 1997.
102. H. V. Poor. An introduction to signal detection and estimation. Springer-Verlag, New York, 2 edition, 1994.
103. K. A. Post. Convexity of the nonachievable rate region for the collision channel without feedback. IEEE Trans. Inform. Theory, IT-31(2):205-206, 1985.
104. J. G. Proakis. Digital Communications. McGraw-Hill, 4 edition, 2001.
105. C. R. Rao. Information and the accuracy attainable in the estimation of statistical parameters. Bull. Calcutta Math. Soc., 37:81-91, 1945.
106. P. B. Rapajic and D. Popescu. Information capacity of a random signature multiple-input multiple-output channel. IEEE Trans. Commun., 48(8):1245-1248, Aug. 2000.
107. P. B. Rapajic and B. S. Vucetic. Adaptive receiver structures for asynchronous CDMA systems. IEEE J. Select. Areas Commun., 12(4):685-697, 1994.
108. M. Reed, C. Schlegel, P. Alexander, and J. Asenstorfer. Iterative multiuser detection for CDMA with FEC: near-single-user performance. IEEE Trans. Commun., 46(12):1693-9, Dec. 1998.
109. A. B. Reid, A. J. Grant, and P. D. Alexander. List detection for multiaccess channels. In IEEE Global Commun. Conf., pages 1083-1087, 2002.
110. A. B. Reid, A. J. Grant, and A. P. Kind. Low-complexity list-detection for high-rate multiple-antenna channels. In IEEE Int. Symp. Inform. Theory, page 273, Yokohama, Japan, 2003.
111. M. Rupf. Coding for CDMA Channels and Capacity. PhD thesis, Eidgen össiche Technische Hochschule, 1994.
112. M. Rupf and J. L. Massey. Optimum sequence multisets for synchronous code-division multiple-access channels. IEEE Trans. Inform. Theory, 40 (4):1261-1266, 1994.
113. C. Sankaran and A. Ephremides. Solving a class of optimum multiuser detection problems with polynomial complexity. IEEE Trans. Inform. Theory, 44:1958-1961, 1998.
114. L. L. Scharf. Statistical Signal Processing. Addison-Wesley, Reading, Massachusetts, 1991.
115. C. Schlegel, P. Alexander, and S. Roy. Coded asynchronous CDMA and its efficient detection. IEEE Trans. Inform. Theory, 44(7):2837-2847, 1998.
116. C. Schlegel, P. D. Alexander, S. Roy, and Z. Xiang. Multi-user projection receivers. IEEE J. Select. Areas Commun., 14(8):1610-1618, 1996.
117. C. Schlegel and A. Grant. Polynomial complexity optimal detection of certain multiple access systems. IEEE Trans. Inform. Theory, 46(6): 2246-8, Sept. 2000.
118. C. Schlegel and L. Wei. A simple way to compute the minimum distance in multiuser CDMA. IEEE Trans. Commun., 45(5):532-535, May 1997.
119. C. Schlegel and Z. Xiang. Multiuser projection receivers. In IEEE Int. Symp. Inform. Theory, page 318, Whistler, Canada, 1995.
120. C. B. Schlegel and L. Perez. Trellis and Turbo Coding. IEEE Press, Piscataway, NJ, 2004.
121. K. S. Schneider. Optimum detection of code division multiplexed signals. IEEE Transactions on Aerospace and Electronic Systems, AES-15(1): 181-185, Jan. 1979.
122. C. P. Schnorr and M. Euchner. Lattice basis reduction: improved practical algorithms and solving subset sum probelms. Mathematical Programming, 66:181-191, 1994.
123. C. E. Shannon. A mathematical theory of communication. Bell Syst. Tech. J., 27:379-423, 623-656, 1948.
124. C. E. Shannon. The zero error capacity of a noisy channel. IRE Trans. Inform. Theory, IT-2:8-19, 1956.
125. Z. Shi and C. Schlegel. Asymptotic iterative multi-user detection of coded random CDMA. Submitted to IEEE Trans. Signal Processing., 005.
126. Z. Shi and C. Schlegel. Joint iterative decoding of serially concatenated error control coded CDMA. IEEE J. Select. Areas Commun., pages 1646-1653, 2001.
127. J. W. Silverstein. Eigenvalues and eigenvectors of large dimensional sample covariance matrices. Contemporary Mathematics, 50:153-159, 1986.
128. J. W. Silverstein and Z. D. Bai. On the emperical distribution of eigenvalues of a class of large dimensional random matrices. J. Multivariate Anal., 54(2):175-192, Aug. 1995.
129. D. Slepian and J. K. Wolf. A coding theorem for multiple access channels with correlated sources. Bell Syst. Tech. J., 52(7), 1973.
130. R. Sorace. Trellis coding for the multiple access channel. IEEE Trans. Inform. Theory, IT-29(4):606-611, 1983.
131. G. Strang. Linear Algebra and its Applications. Harcourt Brace Jovanovich, 1988.
132. I. E. Telatar. Capacity of multi-antenna Gaussian channels. Europ. Trans. Telecommun., 10(6):585-595, Nov.-Dec. 1999. Origninally pub lished as Tech. Memo., Bell Laboratories, Lucent Technologies, October 1995.
133. S. ten Brink. Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Trans. Commun., 49(10):1727-1737, Oct. 2001.
134. TIA. Tia/is-2000 interim standard, Introduction to cdma2000 spread spectrum systems, July 2004.
135. TIA/EIA. IS-95: Mobile station-base station compatibility standard for dual-mode wideband spread spectrum cellular system, July 1993.
136. H. V. Tilborg. An upper bound for codes in a two-access binary erasure channel. IEEE Trans. Inform. Theory, IT-24(1):112-117, 1978.
137. L. G. F. Trichard, J. S. Evans, and I. B. Collings. Large system analysis of linear parallel interference cancellation. IEEE Trans. Commun., 50 (11):1778-1786, Nov. 2002.
138. D. Tse and S. Hanly. Linear multiuser receivers: Effective interference, effective bandwidth and user capacity. IEEE Trans. Inform. Theory, 45 (2):641-657, 1999.
139. S. Ulukus and R. Yates. Optimum mutliuser detection is tractable for synchronous CDMA using m-sequences. IEEE Commun. Lett., 2:89-91, 1998.
140. G. Ungerboeck. Adaptive maximum-likelihood receiver for carrier- modulated data-transmission systems. IEEE Trans. Commun., 22(5): 624-636, 1974.
141. R. Urbanke and Q. Li. The zero-error capacity region of the 2-user synchronous BAC is strictly smaller than its Shannon capacity region. In IEEE Information Theory Workshop, page 61, Killarney, Ireland, 1998.
142. W. van Etten. Maximum likelihood receiver for multiple channel transmission system. IEEE Trans. Commun., 24(2):276-283, 1976.
143. H. L. van Trees. Detection, Estimation, and Modulation Theory, Part I. John Wiley & Sons, 1968.
144. P. Vanroose. Code construction for the noiseless binary switching multiple-access channel. IEEE Trans. Inform. Theory, 34(5):1100-1106, 1988.
145. M. Varanasi and B. Aazhang. Multistage detection in asynchronous code-division multiple-access communication. IEEE Trans. Commun., 38(4):509-519, April. 1990.
146. M. Varanasi and B. Aazhang. Near optimum detection in synchronous code-division multiple-access systems. IEEE Trans. Commun., 39(5): 725-736, May. 1991.
147. S. Verdú. Minimum probability of error for asynchronous Gaussian multiple-access channels. IEEE Trans. Inform. Theory, 32(1):85-96, 1986.
148. S. Verdú. The capacity region of the symbol-asynchronous Gaussian multiple-access channel. IEEE Trans. Inform. Theory, 35(4):733-751, 1989.
149. S. Verdú. Computational complexity of optimum multiuser detection. Algorithmica, pages 303-312, 1989.
150. S. Verdú and S. Shamai. Spectral efficiency of CDMA with random spreading. IEEE Trans. Inform. Theory, 45(2):622-640, 1999.
151. H. Vikalo, B. Hassibi, and T. Kailath. Iterative decoding for mimo channels via modified sphere decoder. IEEE Trans. Wireless Commun., 3(6):2299-2311, Nov. 2004.
152. A. J. Viterbi. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inform. Theory, IT-13: 260-269, 1967.
153. A. J. Viterbi. Very low rate convolutional codes for maximum theoretical performance of spread-spectrum multiple-access channels. IEEE J. Select. Areas Commun., 8:641-649, 1990.
154. A. J. Viterbi. CDMA: Principles of Spread Spectrum Communication. Addison-Wesley, 1995.
155. A. J. Viterbi and J. K. Omura. Principles of Digital Communication and Coding. McGraw-Hill, 1979.
156. K. W. Wachter. The strong limits of random matrix spectra for sample matrices of independent elements. Ann. Probab., 6:1-18, 1978.
157. X. Wang and V. Poor. Iterative (turbo) soft interference cancellation and decoding for coded CDMA. IEEE Trans. Commun., 47(7):1046-61, July 1999.
158. L. Wei and C. Schlegel. Synchronous DS-SSMA with improved decorrelating decision-feedback multiuser detection. IEEE Trans. Veh. Technol., 43(3):767-772, 1994. Special Issue on Future PCS Technologies.
159. L. R.Welch. Lower bounds on the maximum cross correlation of signals. IEEE Trans. Inform. Theory, IT-20(3):397-399, 1974.
160. E. J. Weldon. Coding for a multiple access channel. Information and Control, 36:256-274, 1978.
161. K. Wesolowski. Mobile Communication Systems. John Wiley & Sons, Chichester, England, 2002.
162. L. Wilhelmsson and K. S. Zigangirov. On the transmission over the T-user q-ary multiple access permutation channel. In IEEE Int. Symp. Inform. Theory, page 56, Trondheim, Norway, 1994.
163. F. M. J. Willems. The feedback capacity of a class of discrete memoryless multiple access channels. IEEE Trans. Inform. Theory, IT-28(1):93-95, 1982.
164. F. M. J. Willems and E. C. V. D. Meulen. Partial feedback for the discrete memoryless multiple access channel. IEEE Trans. Inform. Theory, 29 (2):287-290, 1983.
165. J. K. Wolf. Multi-user communications networks. In J. Skwirynski, editor, Communication Systems and Random Process Theory, NATO Advanced Study Institute Series, pages 37-53. Sijthoff and Noordhoff, Alphen aan den Rijn, The Netherlands, 1978.
166. J. M. Wozencraft and I. M. Jacobs. Principles of Communications Engineering. J. Wiley and Sons, New York, 1965.
167. J. M. Wozencraft and I. M. Jacobs. Principles of Communications Engineering. Waveland Press, 1993.
168. D. Wubben, B. Bohnke, J. Rinas, V. Kuhn, and K. D. Kammeyer. Efficient algorithm for decoding layered space-time codes. IEE Electron. Lett., 37:1384-1350, Oct. 2001.
169. A. D. Wyner. Recent results in Shannon theory. IEEE Trans. Inform. Theory, IT-20(1):2-10, 1974.
170. A. D. Wyner. Shannon-theoretic approach to Gaussian cellular multipleaccess channel. IEEE Trans. Inform. Theory, 40(6):1713-27, 1994.
171. Z. Xie, R. T. Short, and C. K. Rushforth. A family of suboptimum detectors for coherent multiuser communications. IEEE J. Select. Areas Commun., 8(4):683-690, 1990.
172. Y. Q. Yin and Z. D. Bai. Spectra for large-dimensional random matrices. Contemporary Mathematics, 50:161-167, 1986.
173. Y. Yoon, R. Kohno, and H. Imai. A spread-spectrum multiaccess system with cochannel interference cancellation for multipath fading channels. IEEE J. Select. Areas Commun., 11:1067-1075, Sept. 1993.