Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPermutation Trellis Coded Multi-level FSK Signaling to Mitigate Primary User Interference in Cognitive Radio Networks
203
0
0.0
(
0
)
Added by
Raghed El-Bardan
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We employ Permutation Trellis Code (PTC) based multi-level Frequency Shift Keying signaling to mitigate the impact of Primary Users (PUs) on the performance of Secondary Users (SUs) in Cognitive Radio Networks (CRNs). The PUs are assumed to be dynamic in that they appear intermittently and stay active for an unknown duration. Our approach is based on the use of PTC combined with multi-level FSK modulation so that an SU can improve its data rate by increasing its transmission bandwidth while operating at low power and not creating destructive interference for PUs. We evaluate system performance by obtaining an approximation for the actual Bit Error Rate (BER) using properties of the Viterbi decoder and carry out a thorough performance analysis in terms of BER and throughput. The results show that the proposed coded system achieves i) robustness by ensuring that SUs have stable throughput in the presence of heavy PU interference and ii) improved resiliency of SU links to interference in the presence of multiple dynamic PUs.
rate research
Read More
In this paper, code pairs based on trellis coded modulation are proposed over PSK signal sets for a two-user Gaussian multiple access channel. In order to provide unique decodability property to the receiver and to maximally enlarge the constellation constrained (CC) capacity region, a relative angle of rotation is introduced between the signal sets. Subsequently, the structure of the textit{sum alphabet} of two PSK signal sets is exploited to prove that Ungerboeck labelling on the trellis of each user maximizes the guaranteed minimum squared Euclidean distance, $d^{2}_{g, min}$ in the textit{sum trellis}. Hence, such a labelling scheme can be used systematically to construct trellis code pairs for a two-user GMAC to approach emph{any rate pair} within the capacity region.
We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the networks pre-log, which is defined as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the networks pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the bounds give a complete characterization of the networks and side-information settings that result in a full pre-log, i.e., in a pre-log that is equal to the number of transmitters (and receivers) as well as a complete characterization of networks whose pre-log is equal to the full pre-log minus one. They also fully characterize networks where the full pre-log can only be achieved if each transmitter knows the messages of all users, i.e., when the side-information is full.
We propose an enhanced version of trellis coded multiple access (TCMA), an overloaded multiple access scheme that outperforms the original TCMA in terms of achieved spectral efficiency. Enhanced TCMA (ETCMA) performs simultaneous transmission of multiple data streams intended for users experiencing similar signal-to-noise ratios and can be employed both in the uplink and in the downlink of wireless systems, thus overcoming one of the main limitations of TCMA. Thanks to a new receiver algorithm, ETCMA is capable of delivering a significantly higher spectral efficiency. We show that ETCMA approaches the capacity of the Additive White Gaussian Noise channel for a wide range of signal-to-noise ratios.
In this paper, we investigate the transmission delay of cache-aided broadcast networks with user cooperation. Novel coded caching schemes are proposed for both centralized and decentralized caching settings, by efficiently exploiting time and cache resources and creating parallel data delivery at the server and users. We derive a lower bound on the transmission delay and show that the proposed centralized coded caching scheme is emph{order-optimal} in the sense that it achieves a constant multiplicative gap within the lower bound. Our decentralized coded caching scheme is also order-optimal when each users cache size is larger than the threshold $N(1-sqrt[{K-1}]{ {1}/{(K+1)}})$ (approaching 0 as $Kto infty$), where $K$ is the total number of users and $N$ is the size of file library. Moreover, for both the centralized and decentralized caching settings, our schemes obtain an additional emph{cooperation gain} offered by user cooperation and an additional emph{parallel gain} offered by the parallel transmission among the server and users. It is shown that in order to reduce the transmission delay, the number of users parallelly sending signals should be appropriately chosen according to users cache size, and alway letting more users parallelly send information could cause high transmission delay.
In this paper we investigate cooperative secure communications in a four-node cognitive radio network where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission. The secondary user is allowed to transmit his own signals under the condition that the primary users secrecy rate and transmission scheme are intact. Under this setting we derive the secondary users achievable rates and the related constraints to guarantee the primary users weak secrecy rate, when Gelfand-Pinsker coding is used at the secondary transmitter. In addition, we propose a multi-phase transmission scheme to include 1) the phases of the clean relaying with cooperative jamming and 2) the latency to successfully decode the primary message at the secondary transmitter. A capacity upper bound for the secondary user is also derived. Numerical results show that: 1) the proposed scheme can outperform the traditional ones by properly selecting the secondary users parameters of different transmission schemes according to the relative positions of the nodes; 2) the derived capacity upper bound is close to the secondary users achievable rate within 0.3 bits/channel use, especially when the secondary transmitter/receiver is far/close enough to the primary receiver/transmitter, respectively. Thereby, a smart secondary transmitter is able to adapt its relaying and cooperative jamming to guarantee primary secrecy rates and to transmit its own data at the same time from relevant geometric positions.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
