The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] superresolution techniques(2hit)

1-2hit
  • High-Resolution Analysis of Indoor Multipath Propagation Structure

    Yasutaka OGAWA  Norihiro HAMAGUCHI  Kohzoh OHSHIMA  Kiyohiko ITOH  

     
    PAPER

      Vol:
    E78-B No:11
      Page(s):
    1450-1457

    Analyzing multipath propagation structure is important to develop anti-fading techniques for high-speed digital radio systems. Several techniques have been employed to measure delay profiles and/or arrival angles. This paper presents a simultaneous estimation method of delay times and arrival angles of indoor multipath waves. We obtain frequency-domain data at different receiving antenna positions using a network analyzer. We estimate the propagation parameters by means of a two-dimensional MUSIC algorithm. In order to obtain reliable results, a two-dimensional discrete inverse Fourier transform and a gating technique are employed before the MUSIC algorithm. Simulation and experimental results show that the proposed method can estimate the propagation parameters properly.

  • Eliminating the Quantization Problem in Signal Subspace Techniques

    Ioannis DACOS  Athanassios MANIKAS  

     
    PAPER

      Vol:
    E78-B No:11
      Page(s):
    1458-1466

    When signal subspace techniques, such as MuSIC, are used to locate a number of incident signals, an exhaustive search of the array manifold has to be carried out. This search involves the evaluation of a single cost function at a number of points which form a grid, resulting in quantization-error effects. In this paper a new algorithm is put forward to overcome the quantization problem. The algorithm uses a number of cost functions, and stages, equal to the number of incident signals. At each stage a new cost function is evaluated in a small number of "special" directions, known as characteristic points. For an N-element array the characteristic points, which can be pre-calculated from the array manifold curvatures, partition the array manifold into N-1 regions. By using a simple gradient algorithm, only a small area of one of these regions is searched at each stage, demonstrating the potential benefits of the proposed approach.