65 research outputs found

    On coding for block fading channels

    Get PDF

    Irregular Turbo Codes in Block-Fading Channels

    Full text link
    We study irregular binary turbo codes over non-ergodic block-fading channels. We first propose an extension of channel multiplexers initially designed for regular turbo codes. We then show that, using these multiplexers, irregular turbo codes that exhibit a small decoding threshold over the ergodic Gaussian-noise channel perform very close to the outage probability on block-fading channels, from both density evolution and finite-length perspectives.Comment: to be presented at the IEEE International Symposium on Information Theory, 201

    Relay Assisted Cooperative OSTBC Communication with SNR Imbalance and Channel Estimation Errors

    Full text link
    In this paper, a two-hop relay assisted cooperative Orthogonal Space-Time Block Codes (OSTBC) transmission scheme is considered for the downlink communication of a cellular system, where the base station (BS) and the relay station (RS) cooperate and transmit data to the user equipment (UE) in a distributed fashion. We analyze the impact of the SNR imbalance between the BS-UE and RS-UE links, as well as the imperfect channel estimation at the UE receiver. The performance is analyzed in the presence of Rayleigh flat fading and our results show that the SNR imbalance does not impact the spatial diversity order. On the other hand, channel estimation errors have a larger impact on the system performance. Simulation results are then provided to confirm the analysis.Comment: 5 pages, 3 figures, IEEE 69th Vehicular Technology Conferenc

    A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

    Full text link
    In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.Comment: 22 pages, 4 figures. This work has been accepted for IEEE Transactions on Information Theory and has been presented in part at the 2007 IEEE International Symposium on Information Theory, Nice, France, June 200

    Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

    Full text link
    We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather straightforward. Unfortunately, optimal constructions for maximum-likelihood decoding do not perform well under iterative decoding. To overcome this limitation, we then introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. This family competes with multiplexed parallel turbo codes suitable for nonergodic channels and recently reported in the literature.Comment: Submitted to the IEEE Transactions on Information Theor

    Energy efficiency of some non-cooperative, cooperative and hybrid communication schemes in multi-relay WSNs

    Get PDF
    In this paper we analyze the energy efficiency of single-hop, multi-hop, cooperative selective decode-and-forward, cooperative incremental decode-and-forward, and even the combination of cooperative and non-cooperative schemes, in wireless sensor networks composed of several nodes. We assume that, as the sensor nodes can experience either non line-of-sight or some line-of-sight conditions, the Nakagami-m fading distribution is used to model the wireless environment. The energy efficiency analysis is constrained by a target outage probability and an end-to-end throughput. Our results show that in most scenarios cooperative incremental schemes are more energy efficient than the other methods
    • …
    corecore