A decomposition for the tilted channel of the fast fading channels

Download
2022-9
Yıldız, Mücahit Furkan
A decomposition property for the tilted channel of the fast fading channels with the channel state information at the receiver is proposed. A necessary and sufficient condition for the decomposition and the resulting expressions for the sphere packing exponent and the random coding exponent are determined. These expressions are used to calculate the error exponents for the discrete memoryless channels with certain symmetries. The existence of a similar decomposition property for Gaussian channels under Gaussian input distributions is analyzed.

Suggestions

A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
Nakiboğlu, Barış (2020-01-01)
A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Omega (n(-0.5(1-E'sp)((R)))) for all codes on certain families of channels (including the Gaussian channels and the nonstationary Renyi symmetric channels) and for the constant composition codes on stationary memoryless channels. The resulting nonasymptotic bounds have definite approximation error terms. As a preliminar...
An Accurate and Efficient Two-Stage Channel Estimation Method Utilizing Training Sequences with Closed Form Expressions
Candan, Çağatay (2011-12-01)
A novel two-stage frequency domain channel estimation method especially suitable for the estimation of long channels such as ultra wide band channels is proposed. The proposed method can efficiently use the sequences with closed form analytical expressions such as the Legendre sequences. (The suggested method does not require a computationally intense search for good training sequences which is infeasible for long training sequences.) The method is shown to present a minor improvement in the total estimatio...
An Upper Bound on the Capacity Loss Due to Imprecise Channel State Information for General Memoryless Fading Channels
Candan, Çağatay (Institute of Electrical and Electronics Engineers (IEEE), 2013-07-01)
A remarkably simple upper bound on the capacity loss due to imprecise channel state information (CSI) is presented for single-input single-output (SISO) general memoryless fading channels, (Capacity Loss) <= log(1 + var(h - (h) over cap )SNR) where var(h - (h) over cap) represents the variance of channel estimation error, i.e. CSI inaccuracy. The bound extends earlier work on Rayleigh channels to general memoryless channels and confirms that the effect of CSI inaccuracies on the communication capacity is se...
Simplified MAP estimator for OFDM systems under fading
Cueruek, Selva Muratoglu; Tanık, Yalçın (2007-04-25)
This paper presents a simplified Maximum A Posteriori (MAP) estimator, which yields channel taps in OFDM systems under fading conditions using a parametric correlation model, assuming that the channel is frequency selective, slowly time varying and Gaussian. Expressions for the variance of estimation error are derived to evaluate the performance of the MAP estimator. The relation between the correlation of subchannels taps and error variance and the effect of Signal to Noise Ratio (SNR) are investigated. Th...
A simplified MAP channel estimator for OFDM systems under Rayleigh fading
ÇÜRÜK, SELVA; Tanık, Yalçın (2010-06-01)
This paper presents a simplified Maximum A Posteriori (SMAP) channel estimator to be used in orthogonal frequency division multiplexing (OFDM) systems under the Rayleigh fading assumption for the subchannels, using a parametric correlation model and assuming that the channel is frequency selective and slowly time varying. Expressions for the mean-square error (MSE) of estimations are derived to evaluate the performance of the estimator. The relation between the correlation of subchannels taps and error vari...
Citation Formats
M. F. Yıldız, “A decomposition for the tilted channel of the fast fading channels,” M.S. - Master of Science, Middle East Technical University, 2022.