-
1
-
-
0030234863
-
Layered space-time architecture for wireless communication in fading environments when using multiple antennas
-
Autumn
-
G.J.Foschini, "Layered space-time architecture for wireless communication in fading environments when using multiple antennas," Bell Labs. Tech. J., vol. 2, Autumn 1996.
-
(1996)
Bell Labs. Tech. J.
, vol.2
-
-
Foschini, G.J.1
-
2
-
-
0033706196
-
Lattice code decoder for space-time codes
-
May
-
M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Communications letters, vol. 4, no. 5, pp. 161-163, May 2000.
-
(2000)
IEEE Communications Letters
, vol.4
, Issue.5
, pp. 161-163
-
-
Damen, M.O.1
Chkeif, A.2
Belfiore, J.-C.3
-
3
-
-
84966239268
-
Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
-
U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathmatical Computations, vol. 44, pp. 463-471, 1985.
-
(1985)
Mathmatical Computations
, vol.44
, pp. 463-471
-
-
Fincke, U.1
Pohst, M.2
-
4
-
-
0036670969
-
Closest point search in lattices
-
August
-
E. Argell, E. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transactions on Information Theory, vol. 48, no. 8, pp. 2201-2214, August 2002.
-
(2002)
IEEE Transactions on Information Theory
, vol.48
, Issue.8
, pp. 2201-2214
-
-
Argell, E.1
Eriksson, E.2
Vardy, A.3
Zeger, K.4
-
5
-
-
0242386133
-
Complexity of ML lattice decoders for the decoding of linear full rate space-time codes
-
accepted for publication. [Online]
-
G. Rekaya and J.-C. Belfiore, "Complexity of ML lattice decoders for the decoding of linear full rate space-time codes," IEEE Transactions on Wireless Communications, accepted for publication. [Online]. Available: http://www.comelec.enst.fr/~belfiore/publications.html
-
IEEE Transactions on Wireless Communications
-
-
Rekaya, G.1
Belfiore, J.-C.2
-
6
-
-
4344705262
-
A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels
-
K. wai Wong, C. ying Tsui, R. S. kwan Cheng, and W. ho Mow, "A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels," in PIMRC'02, 2002.
-
(2002)
PIMRC'02
-
-
Wong, K.W.1
Tsui, C.Y.2
Cheng, R.S.K.3
Mow, W.H.4
-
7
-
-
2942538559
-
Reduced complexity schnorreuchner decoding algorithms for MIMO systems
-
accepted for publication
-
Z. Guo and P. Nilsson, "Reduced complexity schnorreuchner decoding algorithms for MIMO systems," accepted for publication in IEEE Communications Letters.
-
IEEE Communications Letters
-
-
Guo, Z.1
Nilsson, P.2
-
8
-
-
0021372019
-
Sequential coding algorithms: A survey and cost analysis
-
Feb.
-
J. B. Anderson and S. Mohan, "Sequential coding algorithms: A survey and cost analysis," IEEE Transactions on Communications, vol. COM-32, pp. 169-176, Feb. 1984.
-
(1984)
IEEE Transactions on Communications
, vol.COM-32
, pp. 169-176
-
-
Anderson, J.B.1
Mohan, S.2
-
9
-
-
0029251579
-
Sorting-based VLSI architecuture for the M-algorithm and T-algorithm trellis decoders
-
3
-
P. A. bengough and S. J. Simmons, "Sorting-based VLSI architecuture for the M-algorithm and T-algorithm trellis decoders," IEEE Transactions on Communications, vol. 43, no. 2/3/4, pp. 514-522, 1995.
-
(1995)
IEEE Transactions on Communications
, vol.43
, Issue.2-4
, pp. 514-522
-
-
Bengough, P.A.1
Simmons, S.J.2
-
10
-
-
0038059297
-
Achieving near-capacity on a multiple-antenna channel
-
March
-
B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," IEEE Transactions on Communications, vol. 51, pp. 389-399, March 2003.
-
(2003)
IEEE Transactions on Communications
, vol.51
, pp. 389-399
-
-
Hochwald, B.M.1
Ten Brink, S.2
|