Eliminating the Quantization Problem in Signal Subspace Techniques

Ioannis DACOS; Athanassios MANIKAS

Eliminating the Quantization Problem in Signal Subspace Techniques

Ioannis DACOS, Athanassios MANIKAS

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E78-B No.11 pp.1458-1466

Publication Date: 1995/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Adaptive Signal Processing Technology in Antennas)

Category

Cite this

Copy

Ioannis DACOS, Athanassios MANIKAS, "Eliminating the Quantization Problem in Signal Subspace Techniques" in IEICE TRANSACTIONS on Communications, vol. E78-B, no. 11, pp. 1458-1466, November 1995, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e78-b_11_1458/_p

Copy

@ARTICLE{e78-b_11_1458,
author={Ioannis DACOS, Athanassios MANIKAS, },
journal={IEICE TRANSACTIONS on Communications},
title={Eliminating the Quantization Problem in Signal Subspace Techniques},
year={1995},
volume={E78-B},
number={11},
pages={1458-1466},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Eliminating the Quantization Problem in Signal Subspace Techniques
T2 - IEICE TRANSACTIONS on Communications
SP - 1458
EP - 1466
AU - Ioannis DACOS
AU - Athanassios MANIKAS
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E78-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1995
AB - 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.
ER -