DocumentCode :
2051476
Title :
A tight bound for probability of error for quantum counting based multiuser detection
Author :
Imre, Sandor ; Balazs, Ferenc
Author_Institution :
Mobile Commun. Lab., Budapest Univ. of Technol. & Econ., Hungary
fYear :
2002
fDate :
2002
Firstpage :
43
Abstract :
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.
Keywords :
error statistics; multiuser detection; quantum communication; Grover database search; error probability; multiuser detection; quantum counting algorithm; tight bound; upper bound; Databases; Detectors; Error probability; Frequency; Interference; Laboratories; Mobile communication; Multiaccess communication; Multiuser detection; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023315
Filename :
1023315
Link To Document :
بازگشت