Optimal detector randomization for multiuser communications systems

buir.contributor.authorArıkan, Orhan
buir.contributor.authorGezici, Sinan
buir.contributor.orcidArıkan, Orhan|0000-0002-3698-8888
dc.citation.epage2889en_US
dc.citation.issueNumber7en_US
dc.citation.spage2876en_US
dc.citation.volumeNumber61en_US
dc.contributor.authorTutay, M. E.en_US
dc.contributor.authorGezici, Sinanen_US
dc.contributor.authorArıkan, Orhanen_US
dc.date.accessioned2016-02-08T09:38:10Z
dc.date.available2016-02-08T09:38:10Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractOptimal detector randomization is studied for the downlink of a multiuser communications system, in which users can perform time-sharing among multiple detectors. A formulation is provided to obtain optimal signal amplitudes, detectors, and detector randomization factors. It is shown that the solution of this joint optimization problem can be calculated in two steps, resulting in significant reduction in computational complexity. It is proved that the optimal solution is achieved via randomization among at most min{K, Nd} detector sets, where K is the number of users and Nd is the number of detectors at each receiver. Lower and upper bounds are derived on the performance of optimal detector randomization, and it is proved that the optimal detector randomization approach can reduce the worst-case average probability of error of the optimal approach that employs a single detector for each user by up to K times. Various sufficient conditions are obtained for the improvability and nonimprovability via detector randomization. In the special case of equal crosscorrelations and noise powers, a simple solution is developed for the optimal detector randomization problem, and necessary and sufficient conditions are presented for the uniqueness of that solution. Numerical examples are provided to illustrate the improvements achieved via detector randomization.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:38:10Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1109/TCOMM.2013.053013.130099en_US
dc.identifier.issn0090-6778
dc.identifier.urihttp://hdl.handle.net/11693/20929
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/TCOMM.2013.053013.130099en_US
dc.source.titleIEEE Transactions on Communicationsen_US
dc.subjectDetectionen_US
dc.subjectMinimaxen_US
dc.subjectMultiuseren_US
dc.subjectProbability of erroren_US
dc.subjectRandomizationen_US
dc.subjectTime-sharingen_US
dc.subjectMinimaxen_US
dc.subjectMulti-useren_US
dc.subjectProbability of errorsen_US
dc.subjectRandomizationen_US
dc.subjectTime-sharingen_US
dc.subjectError detectionen_US
dc.subjectOptimizationen_US
dc.subjectRandom processesen_US
dc.subjectDetectorsen_US
dc.titleOptimal detector randomization for multiuser communications systemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Optimal detector randomization for multiuser communications systems.pdf
Size:
568.56 KB
Format:
Adobe Portable Document Format
Description:
Full printable version