Related papers: Performance Bounds of Joint Detection with Kalman …
In this paper, a new cooperation structure for spectrum sensing in cognitive radio networks is proposed which outperforms the existing commonly-used ones in terms of energy efficiency. The efficiency is achieved in the proposed design by…
This paper investigates the distributed Kalman filtering (DKF) from distributed optimization viewpoint. Motivated by the fact that Kalman filtering is a maximum a posteriori estimation (MAP) problem, which is a quadratic optimization…
In this paper, a new detection algorithm is proposed for turbo coded Code Division Multiple Access (CDMA) signals in detect and forward cooperative channels. Use of user cooperation makes much improvement in the performance of CDMA systems.…
Complete awareness of the wireless environment, crucial for future intelligent networks, requires sensing all transmitted signals, not just the strongest. A fundamental barrier is estimating the target signal when it is buried under strong…
We consider time varying MIMO fading channels with known spatial and temporal correlation and solve the problem of joint carrier frequency offset (CFO) and channel estimation with prior distributions. The maximum a posteriori probability…
In optical wireless scattering communication, received signal in each symbol interval is captured by a photomultiplier tube (PMT) and then sampled through very short but finite interval sampling. The resulting samples form a signal vector…
Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to…
We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white…
Efficient symbol detection algorithms carry critical importance for achieving the spatial multiplexing gains promised by multi-input multi-output (MIMO) systems. In this paper, we consider a maximum a posteriori probability (MAP) based…
The problem of phase-noise compensation for correlated phase noise in coded multichannel optical transmission is investigated. To that end, a simple multichannel phase-noise model is considered and the maximum a posteriori detector for this…
We provide a closed form upper bound formulation for the average pairwise-error probability (PEP) of selective decode and forward (SDF) cooperation protocol for a keyhole (pinhole) channel condition. We have employed orthogonal space-time…
In this paper, we establish the connections of the fundamental limitations in feedback communication, estimation, and feedback control over Gaussian channels, from a unifying perspective for information, estimation, and control. The optimal…
Kudekar et al. proved that the belief-propagation (BP) performance for low-density parity check (LDPC) codes can be boosted up to the maximum-a-posteriori (MAP) performance by spatial coupling. In this paper, spatial coupling is applied to…
Inter-symbol interference (ISI) channels with data dependent Gauss Markov noise have been used to model read channels in magnetic recording and other data storage systems. The Viterbi algorithm can be adapted for performing maximum…
In this paper, we investigate the problem of recovering source information from an incomplete set of network coded data. We first study the theoretical performance of such systems under maximum a posteriori (MAP) decoding and derive the…
Raptor codes have been widely used in many multimedia broadcast/multicast applications. However, our understanding of Raptor codes is still incomplete due to the insufficient amount of theoretical work on the performance analysis of Raptor…
In this paper we present a theoretical performance analysis of the maximum ratio combining (MRC) rule for channel-aware decision fusion over multiple-input multiple-output (MIMO) channels for (conditionally) dependent and independent local…
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…
Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…
Spectrum sensing, which aims at detecting spectrum holes, is the precondition for the implementation of cognitive radio (CR). Collaborative spectrum sensing among the cognitive radio nodes is expected to improve the ability of checking…