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
Tight error bound for coded unitary space-time modulation
2006
IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006.
This paper studies the bit error probability (BEP) of coded unitary space-time modulation with iterative decoding where neither the transmitter nor the receiver knows the channel fading coefficients. ...
The tight error bound on the asymptotic performance is first analytically derived for given unitary constellation and mapping rule. ...
CONCLUSIONS The tight bound on the asymptotic performance of unitary coded space-time modulation over a noncoherent channel using convolutional code has been derived. ...
doi:10.1109/wcnc.2006.1696584
dblp:conf/wcnc/TranNL06
fatcat:gslzldwtkvbmxixahpjqb6su6q
Tight BER Bounds for Iteratively Decoded Bit-Interleaved Space-Time Coded Modulation
2004
IEEE Communications Letters
Iteratively decoded bit-interleaved space-time coded modulation (BI-STCM) greatly lowers bit error rate (BER) over fast Rayleigh fading multiple-input multiple-output (MIMO) channels. ...
We develop a general, tight and efficient theoretical error-free feedback bound (EF bound) to analyze the asymptotic BER. ...
In [5] , bit-interleaved space-time coded modulation (BI-STCM) was proposed as an effective approach to capture both space and time diversity, but no tight bound on bit error rate (BER) was given. ...
doi:10.1109/lcomm.2004.823400
fatcat:ydi4444tbrd7xo4ewaqin4eaha
Unitary nonuniform space-time constellations for the broadcast channel
2003
IEEE Communications Letters
We propose a new class of unitary space-time matrix constellations that have nonuniform error performance. ...
Index Terms-Broadcast channels, space-time coding. ...
bound such as (6) was used in, for instance, [6] for the design of (uniform) differential space-time codes. ...
doi:10.1109/lcomm.2002.807432
fatcat:3gtqvzw34bat5ko4zwwvqiouyi
Coded Unitary Space–Time Modulation With Iterative Decoding: Error Performance and Mapping Design
2007
IEEE Transactions on Communications
This paper studies the bit error probability of coded unitary space-time modulation with iterative decoding where neither the transmitter nor the receiver knows the channel fading coefficients. ...
The tight error bound with respect to the asymptotic performance is first analytically derived for any given unitary constellation and mapping rule. ...
ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their helpful comments and suggestions that improved the presentation of the paper. ...
doi:10.1109/tcomm.2007.894092
fatcat:4bdpkr7oafbofocjlxipbq6sna
Differential unitary space-time signal design using matrix rotation structure
2005
IEEE Signal Processing Letters
We consider the design of matrix rotation based space-time signals based on the design criterion of minimizing the union bound on block error probability. ...
With our proposed design for two transmit antennas and one or two receive antennas, we achieve the coding gain of about 1 dB over that of the previous design. ...
The proposed design of unitary space-time signals is based on minimizing pairwise block error probability (PBEP). ...
doi:10.1109/lsp.2004.838196
fatcat:yoqsajpu4bdzlessh6oxv7haim
Asymptotic error probability analysis of quadratic receivers in Rayleigh-fading channels with applications to a unified analysis of coherent and noncoherent space-time receivers
2001
IEEE Transactions on Information Theory
Asymptotically tight expressions for the pairwise error probabilities are obtained for coherent, noncoherent, and differentially coherent space-time receivers. ...
In addition to providing an easy recipe for computing the asymptotic pairwise error rates, we make some conclusions regarding criteria for the design of signal constellations and codes such as a) the same ...
for space-time modulation. ...
doi:10.1109/18.945253
fatcat:gupzfocymvgopbiemrj2vpqrdi
Linear dispersion codes for MIMO systems based on frame theory
2002
IEEE Transactions on Signal Processing
Various techniques are presented for finding codes with good error probability performance. ...
His research has spanned several disciplines, emphasizing estimation theory, sensor signal processing, parallel computer architectures/algorithms, and space-time wireless communications. ...
Boelcskei for his useful comments. ...
doi:10.1109/tsp.2002.803325
fatcat:gfjbgwbxbfczznles7jdi4o6hu
Trellis-Coded Unitary Space-Time Modulation
2004
IEEE Transactions on Wireless Communications
In this paper, we describe the use and design of trellis-coded space-time modulation schemes that use unitary space-time constellations. ...
Recently, a new signaling scheme called unitary space-time modulation that is suitable for the latter case has been proposed. ...
Code Design To perform the code design, it would be useful to evaluate pairwise error probabilities (or, tight upper bounds on the pairwise error probabilities), and then find the optimal design criteria ...
doi:10.1109/twc.2004.837644
fatcat:c24lmyt5gfbhrj6fcy3y4xpdue
Systematic design of unitary space-time constellations
2000
IEEE Transactions on Information Theory
We propose a systematic method for creating constellations of unitary space-time signals for multiple-antenna communication links. ...
Unitary space-time signals, which are orthonormal in time across the antennas, have been shown to be well-tailored to a Rayleigh fading channel where neither the transmitter nor the receiver knows the ...
CHANNEL MODEL; UNITARY SPACE-TIME MODULATION
A. ...
doi:10.1109/18.868472
fatcat:mm2b4syv5rgzfbigfzmg3csuka
Noncoherent space-frequency coded MIMO-OFDM
2005
IEEE Journal on Selected Areas in Communications
probability (PEP), Rayleigh fading, space-frequency coding. ...
In this paper, we address code design for noncoherent frequency-selective MIMO-OFDM fading links, where neither the transmitter nor the receiver knows the channel. ...
Schuster for many inspiring discussions and helpful comments on this paper. ...
doi:10.1109/jsac.2005.853800
fatcat:gkqp4zrymnctfoiuu4f7l4qqm4
Performance of BICM-ID with Signal Space Diversity
2006
2006 IEEE International Conference on Communications
The tight error bound is first analytically derived. Based on the design criterion obtained from the error bound, the optimality of the rotation matrix is then established. ...
This paper presents a performance analysis of bitinterleaved coded-modulation with iterative decoding (BICM-ID) and complex N -dimensional signal space diversity in fading channels to investigate its performance ...
Note also that the error bounds are tight for all the systems. ...
doi:10.1109/icc.2006.254966
dblp:conf/icc/TranNL06
fatcat:226ykscj5jfvppeqe4ynhww7km
Page 1661 of Mathematical Reviews Vol. , Issue 2004b
[page]
2004
Mathematical Reviews
For coherent detection, we show that all optimal full-rank space-time group codes are unitary (each code matrix has equal-energy, or- thogonal rows). ...
Thus, previous results in the literature pro- vide upper and lower bounds for this minimum rate (further, these bounds are tight for the important class of perfect graphs). ...
Signal design and convolutional coding for noncoherent space-time communication on the block-Rayleigh-fading channel
2002
IEEE Transactions on Information Theory
In particular, by employing the asymptotic union bound (AUB) on the probability of error, we give a new formulation of the problem of signal design for the noncoherent fading channel. ...
An upper bound on the bit error probability of the maximum-likelihood decoder is presented together with an asymptotic analysis of that bound. ...
as in the case of orthogonal modulation so that (30) where for binary-to--ary codes and for the -ary codes. ...
doi:10.1109/18.995648
fatcat:4x5te5d3ejgt3crzlfdvxkjary
Multi-Dimensional Subcarrier Mapping for Bit-Interleaved Coded OFDM with Iterative Decoding
2007
2007 IEEE Wireless Communications and Networking Conference
A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence, they can be independently ...
Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multidimensional mapping for bit-interleaved coded modulation with iterative decoding (BICM-ID) in frequency-flat ...
ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their helpful comments that improved the presentation of this paper. ...
doi:10.1109/wcnc.2007.255
dblp:conf/wcnc/TranNL07
fatcat:5fd4zdjqanewjdqefwqrwcb56i
Multidimensional Subcarrier Mapping for Bit-Interleaved Coded OFDM With Iterative Decoding
2007
IEEE Transactions on Signal Processing
A tight bound on the asymptotic error performance is developed, which shows that subcarrier mapping and grouping have independent impacts on the overall error performance, and hence, they can be independently ...
Specifically, it is demonstrated that the optimal subcarrier mapping is similar to the optimal multidimensional mapping for bit-interleaved coded modulation with iterative decoding (BICM-ID) in frequency-flat ...
ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their helpful comments that improved the presentation of this paper. ...
doi:10.1109/tsp.2007.901176
fatcat:ozz5gkjy6vejtopeodv5ycvqee
« Previous
Showing results 1 — 15 out of 3,305 results