Show simple item record

dc.rights.licenseRestricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.
dc.contributorTajer, Ali
dc.contributorVastola, Kenneth S.
dc.contributorSaulnier, Gary J.
dc.contributor.authorKazemi, Samia Binte
dc.date.accessioned2021-11-03T08:40:13Z
dc.date.available2021-11-03T08:40:13Z
dc.date.created2016-10-07T11:15:06Z
dc.date.issued2016-08
dc.identifier.urihttps://hdl.handle.net/20.500.13015/1772
dc.descriptionAugust 2016
dc.descriptionSchool of Engineering
dc.description.abstractProposed approach is further extended to multiple access channels subjected to lower uncertainty level due to the availability of partial state information. Each transmitter is aware of its own channel state while the receiver is assumed to possess complete knowledge of the network. Existing approach that implements fixed number of information layers and successive decoding of all layers during each transmission cycle, is outperformed by proposed broadcast strategy in terms of achievable rate region and average rate. Finally, this approach is extended to channels with multiple transmitting antennas and multiple receiving antennas. Relation between multiple and single antenna scenarios are derived for certain special cases where the multiple antenna system can be converted into an equivalent single antenna network with modified channel coefficients. Numerical evaluation is provided to demonstrate performance gain over existing approach for similar networks.
dc.description.abstractA broadcast strategy for multiple access communication over slowly fading channels is introduced. It is an extension of the existing broadcast approaches to multiple access communication, in which the channel state information is known to the receiver only. In this strategy, the transmitters split their information streams into multiple independent coded information layers, each adapted to a specific actual channel realization. The major distinction between the proposed strategy and the existing one is that in the existing approach, each transmitter adapts its transmission strategy only to the fading process of its direct channel to the receiver, hence directly adopting a single-user strategy previously designed for the single-user channels. However, the contribution of each user to a network-wide measure (e.g., sum-rate capacity) depends not only on the users' direct channel to the receiver, but also on the qualities of other channels. Driven by this premise, an alternative broadcast strategy is proposed here in which the transmitters adapt their transmissions to the combined state resulting from both users' channels. This leads to generating a larger number of information layers by each transmitter and a different decoding strategy by the receiver. The fundamental trade-off among the rates of different information layers is established. Capacity region characterized by sum rates of two users' equivalent layers is derived for independent and finite state channel realization. This region turns out to be larger than the equivalent capacity region for existing broadcast strategy which in turn provides a larger average rate. This approach is extended to continuous channels with infinite states and corresponding average rate is expressed as a function of joint distribution function of channel states and power density function among the transmission layers.
dc.language.isoENG
dc.publisherRensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartofRensselaer Theses and Dissertations Online Collection
dc.subjectElectrical engineering
dc.titleOn broadcast approach for multiple access channel
dc.typeElectronic thesis
dc.typeThesis
dc.digitool.pid177541
dc.digitool.pid177542
dc.digitool.pid177543
dc.rights.holderThis electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degreeMS
dc.relation.departmentDept. of Electrical, Computer, and Systems Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record