The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Markov chain Monte Carlo algorithms for CDMA and MIMO communication systems
Abstract
In this paper, we develop novel Bayesian detection methods that are applicable to both synchronous code-division multiple-access and multiple-input multiple-output communication systems. Markov chain Monte Carlo (MCMC) simulation techniques are used to obtain Bayesian estimates (soft information) of the transmitted symbols. Unlike previous reports that widely use statistical inference to estimate a posteriori probability (APP) values, we present alternative statistical methods that are developed by viewing the underlying problem as a multidimensional Monte Carlo integration. We show that this approach leads to results that are similar to those that would be obtained through a proper Rao-Blackwellization technique and thus conclude that our proposed methods are superior to those reported in the literature. We also note that when the channel signal-to-noise ratio is high, MCMC simulator experiences some very slow modes of convergence. Thus accurate estimation of APP values requires simulations of very long Markov chains, which may be infeasible in practice. We propose two solutions to this problem using the theory of importance sampling. Extensive computer simulations show that both solutions improve the system performance greatly. We also compare the proposed MCMC detection algorithms with the sphere decoding and minimum mean square error turbo detectors and show that the MCMC detectors have superior performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
Cited by
A Low-Complexity Detector for Large MIMO Systems and Multicarrier CDMA Systems
Vishnu Vardhan, K., Mohammed, S. K., Chockalingam, A., & Sundar Rajan, B. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080406 · Cited by 261
Metadata
- Authors
- Farhang-Boroujeny, B., Zhu, H., & Shi, Z.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2006-05
- Volume
- 54
- Issue
- 5
- Pages
- 1896-1909
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2129583471
- Cited by
- 172
- References
- 2
- FWCI
- 14.51
- 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.