Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 7,737 papers for “space-time coding”

Space—Time Coding

Savo Glisic · 2004

This chapter contains sections titled: Diversity gain Space–Time Coding Space–time block codes from orthogonal designs Channel estimation imperfections Quasi-orthogonal space–time block codes Space–time convolutional codes Algebraic space–time codes Differential space–time modulation Multiple transmit antenna differential detection from generalized orthogonal designs Layered space–time coding Concatenated space–time block coding Estimation of MIMO channel Space–time codes for frequency selective channels Optimization of a MIMO System

Cited by 1

Space-time coding

Daniel W. Bliss, Siddhartan Govindasamy · Cambridge University Press eBooks · 2013

As is true for single-input single-output (SISO) communication links, there are many approaches for coding multiple-input multiple-output (MIMO) systems in an attempt to approach the channel capacity. Many of the space-time coding approaches have analogs in the SISO regime. The multiple antennas of MIMO systems enable spatial diversity, increased data rates, and interference suppression. In general, there are trades in these characteristics, depending upon the coding and receiver approach. One of the most important trade-offs in this regard is the trade-off between data rate and diversity whereby the data communication rate is reduced to improve probability of error or outage. That is to say, a fraction of the data rate is sacrificed to improve robustness.

Cited by 1

Space-time coding

Vucetic, Branka. · TU Digital Collections (Thammasat University)

Cited by 0

Space-Time Coding

Goeckel, Dennis · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · 2003

Cited by 0

Broadcast Space-Time Coding

Memarzadeh, Mahsa, Sabharwal, Ashutosh, Aazhang, Behnaam et al. · Rice Digital Scholarship Archive (Rice University) · 2007

In this paper, we study transmission techniques for broadcast channels with a single transmitter and multiple receivers. The transmitter is assumed to be equipped with multiple antennas. Further, each receiver is interested only in part of the transmitted information. Using Gaussian code based information theoretic bounds, we analyze two transmit beamforming techniques. The first technique, zero-forcing beamformer, uses the channel information for all users to send spatially orthogonal signals to different users, <i>i.e.</i>, no user receives interference from the other user signals. The second method uses the single-user optimal beamformer with no effort to reduce interference at the receivers. It is shown that the above transmit beamforming techniques are similar to multiuser receivers used in non-orthogonal CDMA systems. In particular, the zero-forcing beamformer is similar to a decorrelating detector and the single-user beamformer is identical to a matched filter. The comparison with CDMA multiuser receivers is strengthened by results on spectral efficiency of proposed beamformers, which follow the behavior of decorrelating and matched-filter receiver.

Cited by 0

Concatenated space-time coding

Christian Schlegel, et al. · 2008

The serial concatenation of standard convolutional codes with differential space-time modulation is considered for fast flat fading multiple antenna channels. Decoding is performed iteratively by passing symbol-wise a-posteriori probability information between the decoders of the inner space-time code and the outer convolutional code. An inputoutput extrinsic information transfer analysis is used to predict thresholds for outer codes of various memory orders. Simulation results show that this system can achieve bit error rates below 10 −4 at less than 2.5 dB from the Shannon capacity of the multiple antenna channel.

Cited by 0

Space-time coding notation

Hamid Jafarkhani · Cambridge University Press eBooks · 2005

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Cited by 0

Distributed Space-Time Coding

Ming Liu, Matthieu Crussière, Maryline Helard et al. · 2016

All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.

Cited by 0

Layered Space-Time Index Coding

Yu-Chih Huang, Yi Hong, Emanuele Viterbo et al. · IEEE Transactions on Information Theory · 2018

Multicasting K independent messages via multipleinput multiple-output channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the proposed LSTIC is itself a perfect STBC and hence many desired properties are preserved. To illustrate, we construct LSTIC over the following wellknown STBCs: Golden code; 3×3, 4×4, and 6×6 perfect STBCs; and Alamouti code. Simulation results show that the obtained side information gain can be well predicted by our analysis.

Cited by 6