A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
On Universally Decodable Matrices for Space-Time Coding
[article]
2006
arXiv
pre-print
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. ...
for this class of UDMs. ...
Acknowledgments We would like to thank Nigel Boston for general discussions on the topic, Ralf Koetter for pointing out to us the papers [16, 15] and for discussions on Newton interpolation, and Kamil ...
arXiv:cs/0601075v2
fatcat:3kzoi7hhlncjlec3wx45grqzju
On universally decodable matrices for space–time coding
2006
Designs, Codes and Cryptography
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. ...
for this class of UDMs. ...
We would like to thank Nigel Boston for general discussions on the topic, Ralf Koetter for pointing out to us the papers [8] , [10] , and Kamil Zigangirov for providing us with a copy of [8] . ...
doi:10.1007/s10623-006-9019-4
fatcat:x4zxwa5l65b6hjrfppjjmnzsbu
Editorial
2002
EURASIP Journal on Advances in Signal Processing
The first issue has 11 papers that spread over space-time code designs, decoding methods for spacetime coded transmissions, and MIMO systems. The first three papers are on space-time code designs. ...
When we deal with space-time matrices, the code size may be huge and therefore fast decoding algorithms are critically important. ...
The first issue has 11 papers that spread over space-time code designs, decoding methods for spacetime coded transmissions, and MIMO systems. The first three papers are on space-time code designs. ...
doi:10.1155/s1110865702001968
fatcat:gegnmwaefbhhdf23fh2gfjgy24
Quasi Orthogonal Space Time Block Codes Using Various Sub-Block Matrices
2012
International Journal of Computer and Communication Engineering
Space-time block codes (STBCs) from Orthogonal designs have attracted attention due to their fast maximum likelihood decoding and full diversity, but the maximum symbol transmission rate for complex signals ...
A maximum likelihood (ML) decoding algorithm for the suggested code is also provided. ...
So Jafarkhani proposed a space time code structure based on the full rate [5] . ...
doi:10.7763/ijcce.2012.v1.55
fatcat:h65aouprvnezbac473fy662cwq
Combined turbo coding and unitary space-time modulation
2002
IEEE Transactions on Communications
Space-time coding is well understood for high data rate communications over wireless channels with perfect channel state information. ...
On the other hand, channel coding for multiple transmit antennas when channel state information is unknown has only received limited attention. ...
The modulators map the turbo-coded bits into unitary space-time signals. The signals are matrices. ...
doi:10.1109/tcomm.2002.801484
fatcat:re6doonuyndojfkz4n5jm3h32i
Joint Space-Time Trellis Decoding and Channel Estimation in Correlated Fading Channels
2004
IEEE Signal Processing Letters
This letter addresses the issue of joint space-time trellis decoding and channel estimation in time-varying fading channels that are spatially and temporally correlated. ...
Index Terms-Diversity, Kalman filtering, multiple transmit and receive antenna, per-survivor processing, space-time trellis codes. ...
INTRODUCTION M ETHODS for joint channel estimation and space-time trellis decoding in time-varying fading channels have been studied in [1] - [4] . ...
doi:10.1109/lsp.2004.830122
fatcat:rthkhv4mozdlbbpuuubjq7z3gy
Robust Predictive Quantization: Analysis and Design Via Convex Optimization
2007
IEEE Journal on Selected Topics in Signal Processing
Predictive quantization is a simple and effective method for encoding slowly-varying signals that is widely used in speech and audio coding. ...
It has been known qualitatively that leaving correlation in the encoded samples can lead to improved estimation at the decoder when encoded samples are subject to erasure. ...
Thus, a jump linear system is a standard linear state-space system, where each system matrix can, at any time, take on one of possible values. ...
doi:10.1109/jstsp.2007.910622
fatcat:xyhblmj3lff5zgi35l5s2ms2fm
Differentially en/decoded orthogonal space-time block codes with APSK signals
2002
IEEE Communications Letters
It is also compared with the differential en/decoding scheme for Alamouti's orthogonal space-time code using 16PSK (STC-16PSK) signals and two transmit antennas. ...
In this letter, we propose a differential en/decoding scheme for Alamouti's orthogonal space-time code using amplitude/phase-shift keying (STC-APSK) signals and two transmit antennas. ...
Differential Space-Time Coding and STC-PSK For a general space-time code of different unitary matrices with . ...
doi:10.1109/4234.996040
fatcat:mt4vheyp4vb3fp7sbljejfflqu
Low Complexity Adaptive Design for Full-Diversity Full-Rate Space-Time Codes
2006
IEEE Transactions on Signal Processing
Full-diversity full-rate (FDFR) space-time codes for open-loop multiple antenna systems achieve both high data rate and good performance but come with very high decoding complexity. ...
Index Terms-Closed-loop, full-diversity full-rate, multipleinput multiple-output (MIMO), singular value decomposition, space-time coding. ...
Wang for his source code of reduced complexity sphere decoding algorithm [33] . ...
doi:10.1109/tsp.2006.877674
fatcat:enzmiaufofce7dsvtwm7omcb4m
On the separability of demodulation and decoding for communications over multiple-antenna block-fading channels
2003
IEEE Transactions on Information Theory
We assume the channel is known to the receiver only, and find necessary and sufficient conditions on the dispersion matrices for the separation of demodulation and decoding at the receiver without loss ...
We study the separability of demodulation and decoding for communications over multiple-antenna block-fading channels when bitlinear linear dispersion (BL-LD) codes are used. ...
(i.e., MIMO chan- [3] , space-time trellis codes [4] , space-time block codes (STBCs) from orthogonal designs [5] , [6] , and linear dispersion codes (LD codes) [7] . ...
doi:10.1109/tit.2003.817478
fatcat:cq3g3spf3fbklhtaxnzyjeb2b4
On decoding algorithm and performance of space-time block codes
2005
IEEE Transactions on Wireless Communications
In this letter, we present a unified mathematical expression for the decoding algorithm of space-time block codes (STBC). ...
Based on the unified expression, we make a comparison of the STBC transmit diversity and the maximal-ratio combining MRC receive diversity, and analyze the symbol error probability for the STBC transmissions ...
ACKNOWLEDGMENT The authors wish to thank the anonymous reviewers for the comments and suggestions, which are helpful to improve this paper. ...
doi:10.1109/twc.2005.847098
fatcat:oi2xgcldkvfqveb7s5bxx4vsia
Unitary precoding for integer-forcing MIMO linear receivers
2014
2014 IEEE Information Theory Workshop (ITW 2014)
Calderbank, “Space-time codes for [26] M.A. ...
Wong, “Linear Toeplitz space time Precoding With X- and Y-Codes,” IEEE Trans. on Inform. ...
doi:10.1109/itw.2014.6970836
dblp:conf/itw/SakzadV14
fatcat:ir6rgxpgfnfgbaazn2m4gr24sq
Efficiently decoded full-rate space-time block codes
2010
IEEE Transactions on Communications
By using a genetic algorithm, rate-1 space-time block codes that accommodate very simple receiver processing at the cost of reduced diversity are designed in this paper for more than two transmit antennas ...
Space-time block codes with orthogonal structures typically provide full-diversity reception and simple receiver processing. ...
space-time codewords, but independent from one block to the next. ...
doi:10.1109/tcomm.2010.02.090003
fatcat:4no6ok6oxvcebcznxo6uews6gq
Implementing gradient descent decoding
2009
The Michigan mathematical journal
Our goal is to give provably accurate efficient optimal decoding algorithms for a variety of coding rates for block codes on channels with BSC input and output. ...
It has the code C as row space. ...
The dual code C ⊥ is the row space of (any) parity check matrix H for C. This notation is based on the bilinear form x • y := xy T on F n 2 . ...
doi:10.1307/mmj/1242071693
fatcat:7tpcslcmrbfxbpxfuhebhrim4i
A fast-decodable code structure for linear dispersion codes
2009
IEEE Transactions on Wireless Communications
Index Terms-Linear dispersion code, complexity of sphere decoding, MIMO system, fast-decodable code. ...
This paper proposes the design of a new family of fast-decodable, full-rank, flexible-rate linear dispersion codes (LDCs) for MIMO systems with arbitrary numbers of transmit and receive antennas. ...
INTRODUCTION T HE complexity of the decoding/detection process for space-time (ST) codes is a major constraint for the implementation of high speed Multiple-Input-Multiple-Output (MIMO) systems over wireless ...
doi:10.1109/twc.2009.080841
fatcat:a4qw4tk3hbajbiw2fjje4orcta
« Previous
Showing results 1 — 15 out of 19,686 results