13,024 research outputs found

    On the Derivation of Optimal Partial Successive Interference Cancellation

    Get PDF
    The necessity of accurate channel estimation for Successive and Parallel Interference Cancellation is well known. Iterative channel estimation and channel decoding (for instance by means of the Expectation-Maximization algorithm) is particularly important for these multiuser detection schemes in the presence of time varying channels, where a high density of pilots is necessary to track the channel. This paper designs a method to analytically derive a weighting factor α\alpha, necessary to improve the efficiency of interference cancellation in the presence of poor channel estimates. Moreover, this weighting factor effectively mitigates the presence of incorrect decisions at the output of the channel decoder. The analysis provides insight into the properties of such interference cancellation scheme and the proposed approach significantly increases the effectiveness of Successive Interference Cancellation under the presence of channel estimation errors, which leads to gains of up to 3 dB.Comment: IEEE GLOBECOM 201

    Frequency-Domain Turbo Equalisation in Coded SC-FDMA Systems: EXIT Chart Analysis and Performance

    No full text
    In this paper, we investigate the achievable performance of channel coded single-carrier frequency division multiple-access (SC-FDMA) systems employing various detection schemes, when communicating over frequency-selective fading channels. Specifically, three types of minimum mean-square error (MMSE) based frequency-domain (FD) turbo equalisers are considered. The first one is the turbo FD linear equaliser (LE). The second one is a parallel interference cancellation (PIC)-assisted turbo FD decision-feedback equaliser (DFE). The final one is the proposed hybrid interference cancellation (HIC)-aided turboFD-DFE, which combines successive interference cancellation (SIC) with iterative PIC and decoding. The benefit of interference cancellation (IC) is analysed with the EXtrinsic Information Transfer (EXIT) charts. The performance of the coded SC-FDMA systems employing the above-mentioned detection schemes is investigated with the aid of simulations. Our studies show that the IC techniques achieve an attractive performance at a moderate complexity

    Interference Cancellation trough Interference Alignment for Downlink of Cognitive Cellular Networks

    Full text link
    In this letter, we propose the interference cancellation through interference alignment at the downlink of cognitive cellular networks. Interference alignment helps the spatial resources to be shared among primary and secondary cells and thus, it can provide higher degrees of freedom through interference cancellation. We derive and depict the achievable degrees of freedom. We also analyse and calculate the achievable sum rates applying water-filling optimal power allocation

    Joint-Detection and Interference Cancellation Based Burst-by-Burst Adaptive CDMA Schemes

    No full text
    Spread adaptive quadrature amplitude modulated (AQAM) code-division multiple access (CDMA) is proposed as a powerful means of exploiting the time-variant channel capacity fluctuations of wireless channels. It is studied in comparison to variable spreading factor (VSF)-based techniques. These adaptive-rate transmission methods are compared in the context of joint detection and interference cancellation assisted adaptive CDMA (ACDMA) systems. More explicitly, we exploit the time-variant channel quality of mobile channels by switching either the modulation mode (AQAM) or the spreading factor (VSF) on a burst-by-burst basis. The most appropriate modulation mode or spreading factor is chosen based on the instantaneous channel quality estimated. The chosen modem mode or spreading factor is communicated to the remote communicator either through explicit signalling or extracted at the receiver using blind detection techniques. The multiuser joint detector (JD) and the successive interference cancellation (SIC) receiver are compared in the context of these adaptive schemes, with the conclusion that the JD outperformed the SIC receiver in the ACDMA schemes at the cost of increased complexity. Finally, the performance of the uncoded AQAM JD-CDMA scheme is also compared to that of adaptive trellis coded modulation (TCM) assisted AQAM JD-CDMA, which allows us to incorporate adaptive channel coding without any bandwidth expansion.We also show that in the particular scenario studied, adaptiveTCM outperformed adaptive turbo TCM since the system was designed for maintaining a low turbo-interleaver delay. Index Terms—Burst-by-burst adaptive code-division multiple access (CDMA), joint detection CDMA, parallel interference cancellation (PIC), successive interference cancellation (SIC), successive and parallel interference cancellation

    Interference Aspects of Adaptive Modems over Slow Rayleigh Fading Channels

    No full text
    Adaptive modulation can achieve channel capacity gains by adapting the number of bits per transmission symbol on a burst-by-burst basis, in harmony with channel quality fluctuations. This is demonstrated in the paper for target bit error rates of 1 and 0.01%, respectively, in comparison to conventional fixed modems. However, the achievable gains depend strongly on the prevalent interference levels and hence interference cancellation is invoked on the basis of adjusting the demodulation decision boundaries after estimating the interfering channel’s magnitude and phase. Using the modem-mode switching levels of Table X and with the aid of interference cancellation, target BERs of 1 and 0.01% can be maintained over slow-fading channels for a wide range of channel Signal-to-noise ratios (SNR) and Signal-to-interference ratios (SIR), as seen in Figs. 20 and 21, respectively. Index Terms—Burst-by-burst adaptive modulation (modems), cochannel interference, interference cancellation

    Braess's Paradox in Wireless Networks: The Danger of Improved Technology

    Full text link
    When comparing new wireless technologies, it is common to consider the effect that they have on the capacity of the network (defined as the maximum number of simultaneously satisfiable links). For example, it has been shown that giving receivers the ability to do interference cancellation, or allowing transmitters to use power control, never decreases the capacity and can in certain cases increase it by Ω(log(ΔPmax))\Omega(\log (\Delta \cdot P_{\max})), where Δ\Delta is the ratio of the longest link length to the smallest transmitter-receiver distance and PmaxP_{\max} is the maximum transmission power. But there is no reason to expect the optimal capacity to be realized in practice, particularly since maximizing the capacity is known to be NP-hard. In reality, we would expect links to behave as self-interested agents, and thus when introducing a new technology it makes more sense to compare the values reached at game-theoretic equilibria than the optimum values. In this paper we initiate this line of work by comparing various notions of equilibria (particularly Nash equilibria and no-regret behavior) when using a supposedly "better" technology. We show a version of Braess's Paradox for all of them: in certain networks, upgrading technology can actually make the equilibria \emph{worse}, despite an increase in the capacity. We construct instances where this decrease is a constant factor for power control, interference cancellation, and improvements in the SINR threshold (β\beta), and is Ω(logΔ)\Omega(\log \Delta) when power control is combined with interference cancellation. However, we show that these examples are basically tight: the decrease is at most O(1) for power control, interference cancellation, and improved β\beta, and is at most O(logΔ)O(\log \Delta) when power control is combined with interference cancellation

    Secrecy outage analysis for Alamouti space-time block coded non-orthogonal multiple access

    Get PDF
    This letter proposed a novel transmission technique for physical layer security by applying the Alamouti Space-Time Block Coded Non-orthogonal Multiple Access (STBC-NOMA) scheme. The secure outage performance under both perfect successive interference cancellation (pSIC) and imperfect successive interference cancellation (ipSIC) are investigated. In particular, novel exact and asymptotic expressions of secrecy outage probability are derived. Numerical and theoretical results are presented to corroborate the derived expressions and to demonstrate the superiority of STBC-NOMA and its ability to enhance the secrecy outage performance compared to conventional NOMA

    On Interference Cancellation and Iterative Techniques

    Get PDF
    Recent research activities in the area of mobile radio communications have moved to third generation (3G) cellular systems to achieve higher quality with variable transmission rate of multimedia information. In this paper, an overview is presented of various interference cancellation and iterative detection techniques that are believed to be suitable for 3G wireless communications systems. Key concepts are space-time processing and space-division multiple access (or SDMA) techniques. SDMA techniques are possible with software antennas. Furthermore, to reduce receiver implementation complexity, iterative detection techniques are considered. A particularly attractive method uses tentative hard decisions, made on the received positions with the highest reliability, according to some criterion, and can potentially yield an important reduction in the computational requirements of an iterative receiver, with minimum penalty in error performance. A study of the tradeoffs between complexity and performance loss of iterative multiuser detection techniques is a good research topic
    corecore