Results 251 to 260 of about 4,679,817 (265)

Low-complexity maximum-likelihood decoder for four-transmit-antenna quasi-orthogonal space-time block code

IEEE Transactions on Communications, 2005
This letter proposes a very low-complexity maximum-likelihood (ML) detection algorithm based on QR decomposition for the quasi-orthogonal space-time block code (QSTBC) with four transmit antennas, called the LC-ML decoder.
Minh-Tuan Le, Van-Su Pham, Linh Mai, Gillsang Yoon   +3 more
semanticscholar   +1 more source

On the intractability of permuting a block code to minimize trellis complexity

IEEE Transactions on Information Theory, 1996
An important problem in the theory and application of block code trellises is to find a coordinate permutation of a given code to minimize the trellis complexity.
ComplexityGavin B. Horn, Frank R. KschischangDepartment   +1 more
semanticscholar   +1 more source

A generalized simplified ML decoder of orthogonal space-time block code for wireless communications over time-selective fading channels

Proceedings IEEE 56th Vehicular Technology Conference, 2002
We propose a novel generalized simplified maximum-likelihood (ML) decoder of orthogonal space-time block code (OSTBC) for wireless communications over time-selective fading channels.
T. Tran, A. Sesay
semanticscholar   +1 more source

Robust Vector Quantization by a Linear Mapping of a Block Code

IEEE Transactions on Information Theory, 1999
In this paper we propose a novel technique for vector quantizer design where the reconstruction vectors are given by a linear mapping of a binary block code (LMBC).
R. Hagen, P. Hedelin
semanticscholar   +1 more source

A full-rate, full-diversity four-antenna quasi-orthogonal space-time block code

IEEE Transactions on Wireless Communications, 2005
We present a complex, full-rate quasi-orthogonal space-time block code for four transmit antennas. Using carefully tailored constellation phase rotations, we show that this code achieves full diversity for specialized PSK-based constellations.
Lori A. Dalton, C. Georghiades
semanticscholar   +1 more source

Quasi-orthogonal space-frequency block code

IEEE International Symposium on Communications and Information Technology, 2004. ISCIT 2004., 2004
Orthogonal frequency division multiplexing (OFDM) with space frequency block code (SFBC) outperforms OFDM with space time block code (STBC) in the fast fading channel environment.
Gangyoul Yu, Joonhyuk Kang
semanticscholar   +1 more source

A (16, 9, 6, 5, 4) error-correcting DC free block code

IEEE Transactions on Information Theory, 1988
A (2n, k, l, c, d) DC free binary block code is a code of length 2n, constant weight n, 2/sup k/ codewords, maximum runlength of a symbol l, maximum accumulated charge c, and minimum distance d.
M. Blaum
semanticscholar   +1 more source

Reduced complexity multiple symbol differential detection of space-time block code

2002 IEEE Wireless Communications and Networking Conference Record. WCNC 2002 (Cat. No.02TH8609), 2002
Multiple symbol differential detection (MSDD) of space-time block code is considered in this paper. It is known that MSDD of space-time block code has very high complexity due to the block nature of the code.
P. Tarasak, V. Bhargava
semanticscholar   +1 more source

Super-orthogonal space-time block code using a unitary expansion

IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004, 2004
The paper introduces a super-orthogonal space-time block coding scheme. The code construction is based on the expansion of an orthogonal block code via a unitary matrix transformation. By expanding the orthogonal block code, we can both increase the code
Heechoon Lee, M. Siti, Weijun Zhu, M. Fitz   +3 more
semanticscholar   +1 more source

On an Orthogonal Space-Time-Polarization Block Code

Journal of Communications, 2009
Over the past several years, diversity methods such as space, time, and polarization diversity have been successfully implemented in wireless communications systems. Orthogonal space-time block codes efficiently combine space and time diversity, and they
B. Wysocki, T. Wysocki, Sarah Spence Adams   +2 more
semanticscholar   +1 more source