The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Spatial Modulation
Abstract
Spatial modulation (SM) is a recently developed transmission technique that uses multiple antennas. The basic idea is to map a block of information bits to two information carrying units: 1) a symbol that was chosen from a constellation diagram and 2) a unique transmit antenna number that was chosen from a set of transmit antennas. The use of the transmit antenna number as an information-bearing unit increases the overall spectral efficiency by the base-two logarithm of the number of transmit antennas. At the receiver, a maximum receive ratio combining algorithm is used to retrieve the transmitted block of information bits. Here, we apply SM to orthogonal frequency division multiplexing (OFDM) transmission. We develop an analytical approach for symbol error ratio (SER) analysis of the SM algorithm in independent identically distributed (i.i.d.) Rayleigh channels. The analytical and simulation results closely match. The performance and the receiver complexity of the SM–OFDM technique are compared to those of the vertical Bell Labs layered space–time (V-BLAST–OFDM) and Alamouti–OFDM algorithms. V-BLAST uses minimum mean square error (MMSE) detection with ordered successive interference cancellation. The combined effect of spatial correlation, mutual antenna coupling, and Rician fading on both coded and uncoded systems are presented. It is shown that, for the same spectral efficiency, SM results in a reduction of around 90% in receiver complexity as compared to V-BLAST and nearly the same receiver complexity as Alamouti. In addition, we show that SM achieves better performance in all studied channel conditions, as compared with other techniques. It is also shown to efficiently work for any configuration of transmit and receive antennas, even for the case of fewer receive antennas than transmit antennas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A simple transmit diversity technique for wireless communications
Alamouti, S. M. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.730453 · Cited by 12,784
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Foschini, G. J., & Gans, M. J. (1998) · Wireless Personal Communications · doi:10.1023/a:1008889222784 · Cited by 10,091
Tarokh, V., Seshadri, N., & Calderbank, A. R. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.661517 · Cited by 7,039
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
Antenna theory; analysis and design
Bansal, R. (1984) · Proceedings of the IEEE · doi:10.1109/proc.1984.12959 · Cited by 3,708
Wolniansky, P. W., Foschini, G. J., Golden, G. D., & Valenzuela, R. A. (2002) · 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167) · doi:10.1109/issse.1998.738086 · Cited by 3,527
Introduction to Space-Time Wireless Communications
Paulraj, A. J., Nabar, R. U., & Gore, D. (2003) · Cited by 3,469
Christopoulos, C., & Wright, A. (1999) · Electrical Power System Protection · doi:10.1007/978-1-4757-5065-2_13 · Cited by 2,748
Capacity limits of MIMO channels
Goldsmith, A., Jafar, S. A., Jindal, N., & Vishwanath, S. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.810294 · Cited by 2,379
Spatio-temporal coding for wireless communication
Raleigh, G. G., & Cioffi, J. M. (1998) · IEEE Transactions on Communications · doi:10.1109/26.662641 · Cited by 1,460
Ziegel, E. R. (2002) · Technometrics · doi:10.1198/tech.2002.s94 · Cited by 715
A statistical discrete-time model for the WSSUS multipath channel
Hoeher, P. (1992) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.182598 · Cited by 591
Spatial Modulation - A New Low Complexity Spectral Efficiency Enhancing Technique
Mesleh, R., Haas, H., Ahn, C. W., et al. (2006) · International Conference on Communications and Networking in China (ChinaCom) · doi:10.1109/chinacom.2006.344658 · Cited by 548
Self-citationMIMO-OFDM for wireless communications: signal detection with enhanced channel estimation
Li, Y. G., Winters, J. H., & Sollenberger, N. R. (2002) · IEEE Transactions on Communications · doi:10.1109/tcomm.2002.802566 · Cited by 539
Asymptotically optimal water-filling in vector multiple-access channels
Viswanath, P., Tse, D. N. C., & Anantharam, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.904525 · Cited by 199
Fast Polar Decomposition of an Arbitrary Matrix
Higham, N. J., & Schreiber, R. (1990) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0911038 · Cited by 87
Cited by
Wireless Communications Through Reconfigurable Intelligent Surfaces
Basar, E., Di Renzo, M., De Rosny, J., Debbah, M., Alouini, M.-S., & Zhang, R. (2019) · IEEE Access · doi:10.1109/access.2019.2935192 · Cited by 3,394
Spatial Modulation for Generalized MIMO: Challenges, Opportunities, and Implementation
Di Renzo, M., Haas, H., Ghrayeb, A., Sugiura, S., & Hanzo, L. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2013.2287851 · Cited by 1,446
Self-citationOrthogonal Frequency Division Multiplexing With Index Modulation
Basar, E., Aygolu, U., Panayirci, E., & Poor, H. V. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2279771 · Cited by 1,141
LED Based Indoor Visible Light Communications: State of the Art
Karunatilaka, D., Zafar, F., Kalavally, V., & Parthiban, R. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2417576 · Cited by 952
Index Modulation Techniques for Next-Generation Wireless Networks
Basar, E., Wen, M., Mesleh, R., Di Renzo, M., Xiao, Y., & Haas, H. (2017) · IEEE Access · doi:10.1109/access.2017.2737528 · Cited by 883
Self-citation
Metadata
- Authors
- Mesleh, R. Y., Haas, H., Sinanovic, S., Ahn, C. W., & Yun, S.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2008-07
- Volume
- 57
- Issue
- 4
- Pages
- 2228-2241
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W4256217385
- Cited by
- 2,357
- References
- 17
- FWCI
- 28.69
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.