In this paper, we present an improved channel estimation algorithm for orthogonal frequency-division multiplexing mobile communication systems using pilot subcarriers. This algorithm is based on a parametric channel model where the channel frequency response is estimated using an-path channel model. In the algorithm, we employ the ESPRIT (estimation of signal parameters by rotational invariance techniques) method to do the initial multipath time delays acquisition and propose an interpath interference cancellation delay locked loop to track the channel multipath time delays. With the multipath time delays information, a minimum mean square error estimator is derived to estimate the channel frequency response. It is demonstrated that the use of the parametric channel model can effectively reduce the signal subspace dimension of the channel correlation matrix for the sparse multipath fading channels and, consequently, improve the channel estimation performance.

Irregular partitioned permutation (IPP) low-density parity-check (LDPC) codes have been recently introduced to facilitate hardware implementation of belief propagation (BP) decoders. In this letter, we present a new method to construct IPP LDPC codes with great flexibility in the selection of code parameters. Meanwhile, small stopping sets are avoided in the code construction, thus good error floor performance can be achieved.

Non-binary type-II hybrid ARQ (HARQ), which combines shortened Reed–Solomon (RS) code with ARQ, is proposed. Its throughput is obtained by extending Lin and Yu’s analysis of binary type-II HARQ. The reliability and average delay are also obtained. The analytical results show that non-binary HARQ outperforms its binary counterpart in throughput, reliability and average delay when proper RS codes are selected. Non-binary HARQs are applied adaptively in a cellular phone system with uniformly distributed mobile terminals (MTs). MTs switch adaptively between two different hybrid schemes according to the average SNR of the received signals. The adaptive parameters include the size of the modulation constellation, the error-correction coding and their joint adaptation. Numerical results show that the adaptive scheme always outperforms its non-adaptive counterparts, and the adaptive modulation scheme is superior to adaptive coding and the joint adaptation scheme when the implementation complexity is a limiting factor. Robustness analysis shows that introducing a mixed modulation scheme in addition to QPSK and 8PSK in the adaptive modulation scheme is unnecessary, and HARQ with adaptive modulation is insensitive to deviations from the optimal threshold, thus facilitating its implementation. Copyright

This paper proposes a SNR estimation scheme based on Gibbs sampler [1]-[6]. This scheme can estimate SNR using a very short received sequence, and does not require any prior information of the transmitted symbol. Compared with the existing estimators, the performance of this method is better when real SNR is larger than 5 dB in both single path channel and multi-path channel.

Low-complexity windowed discrete Fourier transform (DFT)-based minimum mean square error (MMSE) channel estimators are proposed and analyzed for both the interpolation and noninterpolation cases for orthogonal frequency-division multiplexing (OFDM) mobile communications systems in this paper. In the proposed method, the frequency domain data windowing is used to reduce the aliasing errors for the interpolation case and get better noise filtering performance for the noninterpolation case. The time domain MMSE weighting is also used to suppress the channel noise for both cases. Moreover, the optimal generalized Hanning window shape is searched to minimize the channel estimation mean square error (MSE). Analysis and simulation results show that the proposed method performance is close to the optimal MMSE estimator and is much better than the direct DFT-based estimator for both cases. Compared with the optimal MMSE estimator, however, the computation load of the proposed method can be significantly reduced because the IDFT/DFT transforms can be implemented with the fast algorithms IFFT/FFT.