Abstract:In this paper, we study the two-user Gaussian fading Multiple Access Channel (MAC) with cooperative encoders. Two different scenarios are studied: the Gaussian fading MAC with a common message, and the Gaussian fading MAC with conferencing encoders. The throughput capacity region of these channels with partial Channel State Information (CSI) at the transmitters (CSIT) and perfect CSI at the receiver (CSIR) is established. For the Gaussian fading systems with only CSIR (transmitters have no access to CSIT), som… Show more
“…Thus S + γe β S and S + γe −β S have same distance profiles, for any β ∈ [0, π]. This together with (7) proves the second part of the lemma. From Lemma 2, it is clear that when both users use M -PSK signal sets, if (γ ′ , θ ′ ) is a singular fade state, then there exists singular fade states at (γ ′ , θ ′ + p 2π M ), where 1 ≤ p ≤ M − 1 because distance distribution in S eff is periodic with period 2π M .…”
For transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the inputs, we propose a scheme which uses only quantized knowledge of fade state at users with the feedback overhead being nominal. One of the users rotates its constellation without varying the transmit power to adapt to the existing channel conditions, in order to meet certain pre-determined minimum Euclidean distance requirement in the equivalent constellation at the destination. The optimal modulation scheme has been described for the case when both the users use symmetric M -PSK constellations at the input, where M = 2 λ , λ being a positive integer. The strategy has been illustrated by considering examples where both the users use QPSK signal set at the input. It is shown that the proposed scheme has considerable better error performance compared to the conventional nonadaptive scheme, at the cost of a feedback overhead of just log 2 M 2 8 − M 4 + 2 + 1 bits, for the M -PSK case.
“…Thus S + γe β S and S + γe −β S have same distance profiles, for any β ∈ [0, π]. This together with (7) proves the second part of the lemma. From Lemma 2, it is clear that when both users use M -PSK signal sets, if (γ ′ , θ ′ ) is a singular fade state, then there exists singular fade states at (γ ′ , θ ′ + p 2π M ), where 1 ≤ p ≤ M − 1 because distance distribution in S eff is periodic with period 2π M .…”
For transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the inputs, we propose a scheme which uses only quantized knowledge of fade state at users with the feedback overhead being nominal. One of the users rotates its constellation without varying the transmit power to adapt to the existing channel conditions, in order to meet certain pre-determined minimum Euclidean distance requirement in the equivalent constellation at the destination. The optimal modulation scheme has been described for the case when both the users use symmetric M -PSK constellations at the input, where M = 2 λ , λ being a positive integer. The strategy has been illustrated by considering examples where both the users use QPSK signal set at the input. It is shown that the proposed scheme has considerable better error performance compared to the conventional nonadaptive scheme, at the cost of a feedback overhead of just log 2 M 2 8 − M 4 + 2 + 1 bits, for the M -PSK case.
“…which after dropping the redundant terms, we obtain the desired constraint in (8). Finally, based on (64) and (66) we have a 30 = a 32 , and subsequently,…”
A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into multiple independent information streams, each adapted to a specific actual channel realization. The major distinction between the proposed strategy and the existing ones is that in the existing approaches, 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 user's direct channel to the receiver, but also on the qualities of other channels.Driven by this premise, this paper proposes an alternative broadcast strategy in which the transmitters adapt their transmissions to the combined states resulting from all users' channels. This leads to generating a larger number of information streams by each transmitter and adopting a different decoding strategy by the receiver. An achievable rate region and an outer bound that capture the trade-off among the rates of different information layers are established, and it is shown that the achievable rate region subsumes the existing known capacity regions obtained based on adapting the broadcast approach to the single-user channels.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.