IEEE Transactions on Information Theory
Noncoherent Communication in Multiple-Antenna Systems: Receiver Design and Codebook Construction
IEEE Transactions on Signal Processing
Blind ML Detection of Orthogonal Space-Time Block Codes: Identifiability and Code Construction
IEEE Transactions on Signal Processing - Part I
Blind ML detection of orthogonal space-time block codes: efficient high-performance implementations
IEEE Transactions on Signal Processing
Non-Coherent Codes over the Grassmannian
IEEE Transactions on Wireless Communications
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
IEEE Transactions on Information Theory
Space-time block codes from orthogonal designs
IEEE Transactions on Information Theory
Systematic design of unitary space-time constellations
IEEE Transactions on Information Theory
On design criteria and construction of noncoherent space-time constellations
IEEE Transactions on Information Theory
Leveraging coherent space-time codes for noncoherent communication via training
IEEE Transactions on Information Theory
Noncoherent space-time coding: An algebraic perspective
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Several previous works have confirmed that a joint design that combines channel estimation, channel coding and space-time transmission can improve the system performance over that of a separate design. These conclusions are however in general based on unstructured solutions obtained using computer search. The coding gain of these joint designs is therefore limited by both the computer-searchable "short" code length and the compromise between "suboptimal" performance and "high" complexity of their optimal decoding. At this background, we propose a systematic space-time code construction for joint channel estimation and error correction for a two-transmit-antenna and half-rate system. Also proposed is its maximum-likelihood decoder that follows a priority-first search principle. Our systematic code construction, together with a fairly low-complexity optimal decoder, then allows one to work with longer codes with no sacrifice in performance. For codes of short block length, our simulations illustrate that the codes we propose have comparable performance to the best computer-searched codes. For codes of long block lengths that are almost beyond the searchable range of existing computer systems, our codes are still better than some reference designs based on separate channel estimation and error correction components.