10,101 research outputs found

    Array signal processing for maximum likelihood direction-of-arrival estimation

    Get PDF
    Emitter Direction-of-Arrival (DOA) estimation is a fundamental problem in a variety of applications including radar, sonar, and wireless communications. The research has received considerable attention in literature and numerous methods have been proposed. Maximum Likelihood (ML) is a nearly optimal technique producing superior estimates compared to other methods especially in unfavourable conditions, and thus is of significant practical interest. This paper discusses in details the techniques for ML DOA estimation in either white Gaussian noise or unknown noise environment. Their performances are analysed and compared, and evaluated against the theoretical lower bounds

    Multi-Step Knowledge-Aided Iterative ESPRIT for Direction Finding

    Full text link
    In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with comparisons between computational complexities of the proposed and existing algorithms. Simulations focusing on closely-spaced sources, where they are uncorrelated and correlated, illustrate the improvements achieved.Comment: 7 figures. arXiv admin note: text overlap with arXiv:1703.1052

    Random Access in Massive MIMO by Exploiting Timing Offsets and Excess Antennas

    Get PDF
    Massive MIMO systems, where base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of user equipments (UEs) increases, the initial access and handover in contemporary networks will be flooded by user collisions. In this paper, a random access protocol is proposed that resolves collisions and performs timing estimation by simply utilizing the large number of antennas envisioned in Massive MIMO networks. UEs entering the network perform spreading in both time and frequency domains, and their timing offsets are estimated at the base station in closed-form using a subspace decomposition approach. This information is used to compute channel estimates that are subsequently employed by the base station to communicate with the detected UEs. The favorable propagation conditions of Massive MIMO suppress interference among UEs whereas the inherent timing misalignments improve the detection capabilities of the protocol. Numerical results are used to validate the performance of the proposed procedure in cellular networks under uncorrelated and correlated fading channels. With 2.5Ă—1032.5\times10^3 UEs that may simultaneously become active with probability 1\% and a total of 1616 frequency-time codes (in a given random access block), it turns out that, with 100100 antennas, the proposed procedure successfully detects a given UE with probability 75\% while providing reliable timing estimates.Comment: 30 pages, 6 figures, 1 table, submitted to Transactions on Communication
    • …
    corecore