1-4hit |
Yuki YOSHIDA Kazunori HAYASHI Hideaki SAKAI Wladimir BOCQUET
Recently, the marginalized particle filter (MPF) has been applied to blind symbol detection problems over selective fading channels. The MPF can ease the computational burden of the standard particle filter (PF) while offering better estimates compared with the standard PF. In this paper, we investigate the application of the blind MPF detector to more realistic situations where the systems suffer from analog imperfections which are non-linear signal distortion due to the inaccurate analog circuits in wireless devices. By reformulating the system model using the widely linear representation and employing the auxiliary variable resampling (AVR) technique for estimation of the imperfections, the blind MPF detector is successfully modified to cope with the analog imperfections. The effectiveness of the proposed MPF detector is demonstrated via computer simulations.
Issei KANNO Hiroshi SUZUKI Kazuhiko FUKAWA
This paper proposes a novel MIMO system that introduces a heterogeneous stream (HTS) scheme and a blind signal detection method for mobile radio communications. The HTS scheme utilizes different modulation or coding methods for different MIMO streams, and the blind detection method requires no training sequences for signal separation, detection, and channel estimation. The HTS scheme can remove the ambiguity in identifying separated streams without unique words that are necessary in conventional MIMO blind detection. More specifically, two examples of HTS are considered: modulation type HTS (MHTS) and timing-offset type HTS (THTS). MHTS, which utilizes different modulation constellations with the same bandwidth for different streams, has been previously investigated. This paper proposes THTS which utilizes different transmission timing with the same modulation. THTS can make the blind detection more robust and effective with fractional sampling. The blind joint processing of detection and channel estimation performs adaptive blind MIMO-MLSE and is derived from an adaptive blind MLSE equalizer that employs the recursive channel estimation with the Moore-Penrose generalized inverse. Computer simulations show that the proposed system can achieve superior BER performance with Eb/N0 degradation of 1 dB in THTS and 2.5 dB in MHTS compared with the ideal maximum likelihood detection.
Seree WANICHPAKDEEDECHA Kazuhiko FUKAWA Hiroshi SUZUKI Satoshi SUYAMA
This paper proposes a maximum likelihood sequence estimation (MLSE) for the differential space-time block code (DSTBC) in cooperation with blind linear prediction (BLP) of fast frequency-flat fading channels. This method that linearly predicts the fading complex envelope derives its linear prediction coefficients by the method of Lagrange multipliers, and does not require data of decision-feedback or information on the channel parameters such as the maximum Doppler frequency in contrast to conventional ones. Computer simulations under fast fading conditions demonstrate that the proposed method with an appropriate degree of polynomial approximation is superior in BER performance to the conventional method that estimates the coefficients by the RLS algorithm using a training sequence.
Seree WANICHPAKDEEDECHA Kazuhiko FUKAWA Hiroshi SUZUKI Satoshi SUYAMA
This paper proposes low-complexity blind detection for orthogonal frequency division multiplexing (OFDM) systems with the differential space-time block code (DSTBC) under time-varying frequency-selective Rayleigh fading. The detector employs the maximum likelihood sequence estimation (MLSE) in cooperation with the blind linear prediction (BLP), of which prediction coefficients are determined by the method of Lagrange multipliers. Interpolation of channel frequency responses is also applied to the detector in order to reduce the complexity. A complexity analysis and computer simulations demonstrate that the proposed detector can reduce the complexity to about a half, and that the complexity reduction causes only a loss of 1 dB in average Eb/N0 at BER of 10-3 when the prediction order and the degree of polynomial approximation are 2 and 1, respectively.