Improved Energy Detector for Wideband Spectrum Sensing in Cognitive Radio Networks

In this paper, an improved energy detector for a wideband spectrum sensing is proposed. For a better detection of the spectrum holes the overall band is divided into equal non-overlapping sub-bands. The main objective is to determine the detection thresholds for each of these subbands jointly. By defining the problem as an optimization problem, we aim to find the maximum aggregated opportunistic throughput of cognitive radio networks. Introducing practical constraints to this optimization problem will change the problem into a convex and solvable one. The results of this paper show that the proposed improved energy detector will increase the aggregated throughput considerably

Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel

In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). Compared to some new researches, which are based on application of asymptotic analysis tools out of optimization process, the proposed method is much simpler, faster, accurate and practical. Because of not using any relaxation or any approximate solution like previous works, the found answer with this method is optimal. We can construct optimal variable node degree distribution for any given binary erasure rate, {\epsilon}, and any check node degree distribution. The presented method is implemented and works well in practice. The time complexity of this method is of polynomial order. As a result, we obtain some degree distribution which their rates are close to the capacity.Comment: 5 pages, to be presented at the 2011 IEEE Information Theory Workshop (ITW 2011), Paraty, Brazil, October, 201

Improved Energy Detector for Wideband Spectrum Sensing in Cognitive Radio Networks

In this paper, an improved energy detector for a wideband spectrum sensing is proposed. For a better detection of the spectrum holes the overall band is divided into equal non-overlapping sub-bands. The main objective is to determine the detection thresholds for each of these subbands jointly. By defining the problem as an optimization problem, we aim to find the maximum aggregated opportunistic throughput of cognitive radio networks. Introducing practical constraints to this optimization problem will change the problem into a convex and solvable one. The results of this paper show that the proposed improved energy detector will increase the aggregated throughput considerably

Approximation of log-likelihood ratio for wireless channels based on Taylor series

A new approach for the approximation of the channel log-likelihood ratio (LLR) for wireless channels based on Taylor series is proposed. The approximation is applied to the uncorrelated flat Rayleigh fading channel with unknown channel side information at the receiver. It is shown that the proposed approximation greatly simplifies the calculation of channel LLRs, and yet provides results almost identical to those based on the exact calculation of channel LLRs. The results are obtained in the context of iterative decoding of low-density parity-check (LDPC) codes and include threshold calculations and error rate performance of finite-length codes. Compared to the existing approximations, the proposed method is either significantly less complex, or considerably more accurate

Design of irregular quasi-cyclic protograph codes with low error floors

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The design process starts from a protograph which embodies a desirable degree distribution. This protograph is then lifted cyclically to a certain block length of interest. The lift is designed carefully to satisfy a certain approximate cycle extrinsic message degree (ACE) spectrum. The target ACE spectrum is one with extremal properties, implying a good error floor performance for the designed code. The proposed construction results in quasi-cyclic codes which are attractive in practice due to simple encoder and decoder implementation. Simulation results are provided to demonstrate the effectiveness of the proposed construction in comparison with similar existing constructions

Lowering the error floor of LDPC codes using cyclic liftings

Cyclic liftings are proposed to lower the error floor of low-density parity-check (LDPC) codes. The liftings are designed to eliminate dominant trapping sets of the base code by removing the short cycles which are part of the trapping sets. We derive a necessary and sufficient condition for the cyclic permutations assigned to the edges of a cycle ξ of length ℓ(ξ) in the base graph such that the inverse image of ξ in the lifted graph consists of only cycles of length strictly larger than ℓ(ξ). The proposed method is universal in the sense that it can be applied to any LDPC code over any channel and for any iterative decoding algorithm. It also preserves important properties of the base code such as degree distributions, and in some cases, the code rate. The constructed codes are quasi-cyclic and thus attractive from a practical point of view. The proposed method is applied to both structured and random codes over the binary symmetric channel (BSC). The error floor improves consistently by increasing the lifting degree, and the results show significant improvements in the error floor compared to the base code, a random code of the same degree distribution and block length, and a random lifting of the same degree. Similar improvements are also observed when the codes designed for the BSC are applied to the additive white Gaussian noise (AWGN) channel

Brief carbon dioxide exposure blocks heat hardening but not cold acclimation in Drosophila melanogaster

Carbon dioxide is a commonly used anaesthetic in Drosophila research. While any detrimental effects of CO2 exposure on behaviour or traits are largely unknown, a recent study observed significant effects of CO2 exposure on rapid cold hardening and chill-coma recovery in Drosophila melanogaster. In this study we investigated the effect of a brief CO, exposure on heat hardening and cold acclimation in D. melanogaster, measuring heat knockdown and chill-coma recovery times of flies exposed to CO2 for 1 min after hardening or acclimation. CO2 anaesthesia had a significant negative effect on heat hardening, with heat knockdown rates in hardened flies completely reduced to those of controls after CO2 exposure. Chill-coma recovery rates also significantly increased in acclimated flies that were exposed to CO2 although not to the same extent seen in the heat populations. CO2 exposure had no impact on heat knockdown rates of control flies, while there was a significant negative effect of the anaesthetic on chill-coma recovery rates of control flies. In light of these results, we suggest that CO2 should not be used after hardening in heat resistance assays due to the complete reversal of the heat hardening process upon exposure to CO2. (c) 2007 Elsevier Ltd. All rights reserved

Successive Wyner-Ziv coding for the binary CEO problem under logarithmic loss

Abstract The $L$ -link binary Chief Executive Officer (CEO) problem under logarithmic loss is investigated in this paper. A quantization splitting technique is applied to convert the problem under consideration to a $(2L-1)$ -step successive Wyner-Ziv (WZ) problem, for which a practical coding scheme is proposed. In the proposed scheme, Low—Density Generator—Matrix (LDGM) codes are used for binary quantization while Low—Density Parity—Check (LDPC) codes are used for syndrome generation; the decoder performs successive decoding based on the received syndromes and produces a soft reconstruction of the remote source. The simulation results indicate that the rate—distortion performance of the proposed scheme can approach the theoretical inner bound based on binary—symmetric test—channel models