Maximization of average number of correctly received symbols over multiple channels in the presence of idle periods

Simple item page
buir.contributor.authorArıkan, Orhan
buir.contributor.authorGezici, Sinan
buir.contributor.orcidArıkan, Orhan|0000-0002-3698-8888
dc.citation.epage118en_US
dc.citation.spage95en_US
dc.citation.volumeNumber54en_US
dc.contributor.authorKeskin, M. F.en_US
dc.contributor.authorKurt, M. N.en_US
dc.contributor.authorTutay, M. E.en_US
dc.contributor.authorGezici, Sinanen_US
dc.contributor.authorArıkan, Orhanen_US
dc.date.accessioned2018-04-12T10:55:30Z
dc.date.available2018-04-12T10:55:30Z
dc.date.issued2016en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractIn this study, optimal channel switching (time sharing) strategies are investigated under average power and cost constraints for maximizing the average number of correctly received symbols between a transmitter and a receiver that are connected via multiple flat-fading channels with additive Gaussian noise. The optimal strategy is shown to correspond to channel switching either among at most three different channels with full channel utilization (i.e., no idle periods), or between at most two different channels with partial channel utilization. Also, it is stated that the optimal solution must operate at the maximum average power and the maximum average cost, which facilitates low-complexity approaches for obtaining the optimal strategy. For two-channel strategies, an upper bound is derived, in terms of the parameters of the employed channels, on the ratio between the optimal power levels. In addition, theoretical results are derived for characterizing the optimal solution for channel switching between two channels, and for comparing performance of single channel strategies. Sufficient conditions that depend solely on the systems parameters are obtained for specifying when partial channel utilization cannot be optimal. Furthermore, the proposed optimal channel switching problem is investigated for logarithmic cost functions, and various theoretical results are obtained related to the optimal strategy. Numerical examples are presented to illustrate the validity of the theoretical results.en_US
dc.identifier.doi10.1016/j.dsp.2016.03.009en_US
dc.identifier.issn1051-2004
dc.identifier.urihttp://hdl.handle.net/11693/36851
dc.language.isoEnglishen_US
dc.publisherElsevier Inc.en_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.dsp.2016.03.009en_US
dc.source.titleDigital Signal Processing: A Review Journalen_US
dc.subjectChannel switchingen_US
dc.subjectFadingen_US
dc.subjectGaussian channelen_US
dc.subjectLogarithmic costen_US
dc.subjectPartial transmissionen_US
dc.subjectProbability of correct decisionen_US
dc.titleMaximization of average number of correctly received symbols over multiple channels in the presence of idle periodsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Maximization of average number of correctly received symbols over multiple channels in the presence of idle periods.pdf
Size:
1.06 MB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Electrical and Electronics Engineering