By Topic

A tight bound for probability of error for quantum counting based multiuser detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Imre, S. ; Mobile Commun. Lab., Budapest Univ. of Technol. & Econ., Hungary ; Balazs, F.

This paper describes a novel quantum computation based multiuser detection (QMUD) scheme in static and also in dynamical changing environments. The well known Grover database search based quantum counting algorithm is implemented in our proposed detector. Furthermore the exact error probability calculation referring to the static one and an upper bound for the dynamic model was shown.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: