English
Related papers

Related papers: Nearest Neighbor Decoding and Pilot-Aided Channel …

200 papers

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbour decoding and pilot-aided channel estimation. In particular, we…

Information Theory · Computer Science 2016-11-15 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

We study a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC), where the transmitters and the receiver are aware of the statistics of the fading, but not of its realisation. We analyse the rate region…

Information Theory · Computer Science 2012-01-17 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

This paper investigates the maximum coding rate at which data can be transmitted over a noncoherent, multiple-input, multiple-output (MIMO) Rayleigh block-fading channel using an error-correcting code of a given blocklength with a…

Information Theory · Computer Science 2025-11-19 Chao Qi , Tobias Koch

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…

Information Theory · Computer Science 2017-11-29 K. Vasudevan

This work studies the capacity of multipath fading channels. A noncoherent channel model is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their…

Information Theory · Computer Science 2009-01-06 Tobias Koch , Amos Lapidoth

This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent…

Information Theory · Computer Science 2008-05-01 Tobias Koch , Amos Lapidoth

We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receive antennas in the noncoherent setting (no a priori channel…

Information Theory · Computer Science 2013-02-12 Günther Koliander , Erwin Riegler , Giuseppe Durisi , Veniamin I. Morgenshtern , Franz Hlawatsch

This paper considers the problem of reliable communication over discrete-time channels whose impulse responses have length $L$ and exactly $S\leq L$ non-zero coefficients, and whose support and coefficients remain fixed over blocks of $N>L$…

Information Theory · Computer Science 2011-06-29 Arun Pachai Kannu , Philip Schniter

In this paper, we tackle for the first time the problem of maximum likelihood (ML) estimation of the signal-to-noise ratio (SNR) parameter over time-varying single-input multiple-output (SIMO) channels. Both the data-aided (DA) and the…

Applications · Statistics 2014-11-19 Faouzi Bellili , Rabii Meftehi , Sofiene Affes , Alex Stephenne

The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…

Information Theory · Computer Science 2012-12-06 Tobias Koch , Gerhard Kramer

Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Ralf R. Mueller , Mikko Vehkaperae , Toshiyuki Tanaka

We establish an upper bound on the noncoherent capacity pre-log of temporally correlated block-fading single-input multiple-output (SIMO) channels. The upper bound matches the lower bound recently reported in Riegler et al. (2011), and,…

Information Theory · Computer Science 2011-09-14 Wei Yang , Giuseppe Durisi , Veniamin I. Morgenshtern , Erwin Riegler

The memoryless noncoherent single-input single-output (SISO) Rayleigh-fading channel is considered. Closed-form expressions for the mutual information between the output and the input of this channel when the input magnitude distribution is…

Information Theory · Computer Science 2007-07-16 Sebastien de la Kethulle de Ryhove , Ninoslav Marina , Geir E. Oien

This paper investigates the maximal achievable rate for a given blocklength and error probability over quasi-static multiple-input multiple-output (MIMO) fading channels, with and without channel state information (CSI) at the transmitter…

Information Theory · Computer Science 2014-04-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

Information transmission over a multiple-input-multiple-output (MIMO) fading channel with imperfect channel state information (CSI) is investigated, under a new receiver architecture which combines the recently proposed generalized nearest…

Information Theory · Computer Science 2021-09-02 Shuqin Pang , Wenyi Zhang

This paper studies the capacity scaling of non-coherent Single-Input Multiple-Output (SIMO) independent and identically distributed (i.i.d.) Rayleigh block fading channels versus bandwidth ($B$), number of receive antennas ($N$) and…

Information Theory · Computer Science 2024-10-21 Felipe Gomez-Cuba

The capacity of non-coherent stationary Gaussian fading channels with memory under a peak-power constraint is studied in the asymptotic weak-signal regime. It is assumed that the fading law is known to both transmitter and receiver but that…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Ligong Wang

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-15 Pablo Piantanida , Sajad Sadough , Pierre Duhamel

The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical coded modulation…

Information Theory · Computer Science 2016-11-17 Pablo Piantanida , Sajad Sadough , Pierre Duhamel
‹ Prev 1 2 3 10 Next ›