Polynomial complexity optimal detection of certain multiple-access systems

@article{Schlegel2000PolynomialCO,
  title={Polynomial complexity optimal detection of certain multiple-access systems},
  author={Christian Schlegel and Alex J. Grant},
  journal={IEEE Trans. Information Theory},
  year={2000},
  volume={46},
  pages={2246-2248}
}
It is demonstrated that optimal multiple user detection in a linear multiple access system with identical cross-correlations requires only O (K logK) operations instead of the worst case O ( 2 ) . A simple optimal detection algorithm is given, which when generalized has complexity that is exponential not in the number of users, but in the number of unique cross-correlation values. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Moher , \ An iterative multiuser decoder for nearcapacity communications , " IEEETrans

  • M.
  • Commun .
  • 1998

New converses in the theory of identification via channels

  • M. Ettinger
  • IEEE Trans . Inform . Theory
  • 1989

Similar Papers

Loading similar papers…