Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Sensor location calibration for bearing estimation (1996)
    Springer
    Circuits, systems and signal processing 15 (1996), S. 763-770 
    Details
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract New calibration methods are presented for bearing estimation with sensor location uncertainties, which are based on eigenvalue decomposition of the sample covariance matrix and three or more nondisjoint sources in known bearings. The methods can be applied to arbitrary arrays, including linear arrays, require fewer computations, and are suitable for low signal-to-noise ratio (SNR) cases. Computer simulations are given to illustrate the performance of the proposed methods.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01190128
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Application of signal subspace approach to high-resolution narrowband array processing (1990)
    Springer
    Circuits, systems and signal processing 9 (1990), S. 421-433 
    Details
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract The paper first briefly reviews some subspace techniques for high-resolution array processing. It is shown that existing high-resolution techniques like the MUSIC algorithm are based on visual inspection of the spatial spectrum. It is not a scientifically valid means of assessing resolution of a spectrum estimator. The paper then proposes a technique based on a combination of optimal processing and signal subspace extraction for high-resolution array processing. Numerical results show that the proposed technique not only achieves superresolution of the spectrum, but also provides power estimates of the arrivals.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01189335
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Simple unified algorithm for estimating and tracking location of desired talker by microphone arrays (1996)
    Springer
    Circuits, systems and signal processing 15 (1996), S. 749-762 
    Details
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract In this paper, we discuss a unified approach and its simple algorithm for estimating and tracking the location of the desired talker in the far field and the near field by microphone arrays. The approach is unified for the far field and the near field and can enhance the effective power of the talker's signal. The simple algorithm further avoids singular-value decomposition (SVD) computations and is suitable for real-time processing. Computer simulations and experiments using actual array data support the techniques.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01190127
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Robust adaptive beamforming for broadband arrays (1997)
    Springer
    Circuits, systems and signal processing 16 (1997), S. 207-216 
    Details
    ISSN: 1531-5878
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract It is very important in many applications to preserve a desired signal without distortion. This paper presents a robust adaptive beamforming method to extract a desired signal from the signals received by broadband arrays. The proposed method relaxes the requirement of approximate knowledge of the desired direction and the sensor gains and delays (phases). Also the method enhances the desired signal based on a focusing transform for that signal, requires less computation than the taped-delay-line beamforming method, and provides good results even in a multipath environment. Computer simulations are given to support the proposed method.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01183275
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Quadratic optimization problems in robust beamforming (1990)
    Springer
    Journal of optimization theory and applications 66 (1990), S. 431-442 
    Details
    ISSN: 1573-2878
    Keywords: Quadratic optimization ; approximation techniques ; robust beamforming ; robust antenna arrays
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a class of constrained optimization problems whereby a quadratic cost function is to be minimized with respect to a weight vector subject to an inequality quadratic constraint on the weight vector. This class of constrained optimization problems arises as a result of a motivation for designing robust antenna array processors in the field of adaptive array processing. The constrained optimization problem is first solved by using the primal-dual method. Numerical techniques are presented to reduce the computational complexity of determining the optimal Lagrange multiplier and hence the optimal weight vector. Subsequently, a set of linear constraints or at most linear plus norm constraints are developed for approximating the performance achievable with the quadratic constraint. The use of linear constraints is very attractive, since they reduce the computational burden required to determine the optimal weight vector.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00940930
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...