8,307 research outputs found

    Channel Estimation for Massive MIMO-OFDM Systems by Tracking the Joint Angle-Delay Subspace

    Get PDF
    In this paper, we propose joint angle-delay subspace based channel estimation in single cell for broadband massive multiple-input and multiple-output (MIMO) systems employing orthogonal frequency division multiplexing (OFDM) modulation. Based on a parametric channel model, we present a new concept of the joint angle-delay subspace which can be tracked by the low-complexity low-rank adaptive filtering (LORAF) algorithm. Then, we investigate an interference-free transmission condition that the joint angle-delay subspaces of the users reusing the same pilots are non-overlapping. Since the channel statistics are usually unknown, we develop a robust minimum mean square error (MMSE) estimator under the worst precondition of pilot decontamination, considering that the joint angle-delay subspaces of the interfering users fully overlap. Furthermore, motivated by the interference-free transmission criteria, we present a novel low-complexity greedy pilot scheduling algorithm to avoid the problem of initial value sensitivity. Simulation results show that the joint angle-delay subspace can be estimated effectively, and the proposed pilot reuse scheme combined with robust MMSE channel estimation offers significant performance gains

    Multipath Parameter Estimation from OFDM Signals in Mobile Channels

    Full text link
    We study multipath parameter estimation from orthogonal frequency division multiplex signals transmitted over doubly dispersive mobile radio channels. We are interested in cases where the transmission is long enough to suffer time selectivity, but short enough such that the time variation can be accurately modeled as depending only on per-tap linear phase variations due to Doppler effects. We therefore concentrate on the estimation of the complex gain, delay and Doppler offset of each tap of the multipath channel impulse response. We show that the frequency domain channel coefficients for an entire packet can be expressed as the superimposition of two-dimensional complex sinusoids. The maximum likelihood estimate requires solution of a multidimensional non-linear least squares problem, which is computationally infeasible in practice. We therefore propose a low complexity suboptimal solution based on iterative successive and parallel cancellation. First, initial delay/Doppler estimates are obtained via successive cancellation. These estimates are then refined using an iterative parallel cancellation procedure. We demonstrate via Monte Carlo simulations that the root mean squared error statistics of our estimator are very close to the Cramer-Rao lower bound of a single two-dimensional sinusoid in Gaussian noise.Comment: Submitted to IEEE Transactions on Wireless Communications (26 pages, 9 figures and 3 tables

    Visualization on colour based flow vector of thermal image for movement detection during interactive session

    Get PDF
    Recently thermal imaging is exploited in applications such as motion and face detection. It has drawn attention many researchers to build such technology to improve lifestyle. This work proposed a technique to detect and identify a motion in sequence images for the application in security monitoring system or outdoor surveillance. Conventional system might cause false information with the present of shadow. Thus, methods employed in this work are Canny edge detector method, Lucas Kanade and Horn Shunck algorithms, to overcome the major problem when using thresholding method, which is only intensity or pixel magnitude is considered instead of relationships between the pixels. The results obtained could be observed in flow vector parameter and the segmentation colour based image for the time frame from 1 to 10 seconds. The visualization of both the parameters clarified the movement and changes of pixel intensity between two frames by the supportive colour segmentation, either in smooth or rough motion. Thus, this technique may contribute to others application such as biometrics, military system, and surveillance machine

    A Novel Data-Aided Channel Estimation with Reduced Complexity for TDS-OFDM Systems

    Get PDF
    In contrast to the classical cyclic prefix (CP)-OFDM, the time domain synchronous (TDS)-OFDM employs a known pseudo noise (PN) sequence as guard interval (GI). Conventional channel estimation methods for TDS-OFDM are based on the exploitation of the PN sequence and consequently suffer from intersymbol interference (ISI). This paper proposes a novel dataaided channel estimation method which combines the channel estimates obtained from the PN sequence and, most importantly, additional channel estimates extracted from OFDM data symbols. Data-aided channel estimation is carried out using the rebuilt OFDM data symbols as virtual training sequences. In contrast to the classical turbo channel estimation, interleaving and decoding functions are not included in the feedback loop when rebuilding OFDM data symbols thereby reducing the complexity. Several improved techniques are proposed to refine the data-aided channel estimates, namely one-dimensional (1-D)/two-dimensional (2-D) moving average and Wiener filtering. Finally, the MMSE criteria is used to obtain the best combination results and an iterative process is proposed to progressively refine the estimation. Both MSE and BER simulations using specifications of the DTMB system are carried out to prove the effectiveness of the proposed algorithm even in very harsh channel conditions such as in the single frequency network (SFN) case

    Joint data detection and channel estimation for OFDM systems

    Get PDF
    We develop new blind and semi-blind data detectors and channel estimators for orthogonal frequency-division multiplexing (OFDM) systems. Our data detectors require minimizing a complex, integer quadratic form in the data vector. The semi-blind detector uses both channel correlation and noise variance. The quadratic for the blind detector suffers from rank deficiency; for this, we give a low-complexity solution. Avoiding a computationally prohibitive exhaustive search, we solve our data detectors using sphere decoding (SD) and V-BLAST and provide simple adaptations of the SD algorithm. We consider how the blind detector performs under mismatch, generalize the basic data detectors to nonunitary constellations, and extend them to systems with pilots and virtual carriers. Simulations show that our data detectors perform well

    A selective control information detection scheme for OFDM receivers

    Get PDF
    In wireless communications, both control information and payload (user-data) are concurrently transmitted and required to be successfully recovered. This paper focuses on block-level detection, which is applicable for detecting transmitted control information, particularly when this information is selected or chosen from a finite set of information that are known at both transmitting and receiving devices. Using an orthogonal frequency division multiplexing architecture, this paper investigates and evaluates the performance of a time-domain decision criterion in comparison with a form of Maximum Likelihood (ML) estimation method. Unlike the ML method, the proposed time-domain detection technique requires no channel estimation as it uses the correlation (in the time-domain) that exists between the received and the transmitted selective information as a means of detection. In comparison with the ML method, results show that the proposed method offers improved detection performance, particularly when the control information consists of at least 16. However, the implementation of the proposed method requires a slightly increased number of mathematical computations

    Blind Receiver Design for OFDM Systems Over Doubly Selective Channels

    Get PDF
    We develop blind data detectors for orthogonal frequency-division multiplexing (OFDM) systems over doubly selective channels by exploiting both frequency-domain and time-domain correlations of the received signal. We thus derive two blind data detectors: a time-domain data detector and a frequency-domain data detector. We also contribute a reduced complexity, suboptimal version of a time-domain data detector that performs robustly when the normalized Doppler rate is less than 3%. Our frequency-domain data detector and suboptimal time-domain data detector both result in integer least-squares (LS) problems. We propose the use of the V-BLAST detector and the sphere decoder. The time-domain data detector is not limited to the Doppler rates less than 3%, but cannot be posed as an integer LS problem. Our solution is to develop an iterative algorithm that starts from the suboptimal time-domain data detector output. We also propose channel estimation and prediction algorithms using a polynomial expansion model, and these estimators work with data detectors (decision-directed mode) to reduce the complexity. The estimators for the channel statistics and the noise variance are derived using the likelihood function for the data. Our blind data detectors are fairly robust against the parameter mismatch
    • …
    corecore