850 research outputs found
R-dimensional ESPRIT-type algorithms for strictly second-order non-circular sources and their performance analysis
High-resolution parameter estimation algorithms designed to exploit the prior
knowledge about incident signals from strictly second-order (SO) non-circular
(NC) sources allow for a lower estimation error and can resolve twice as many
sources. In this paper, we derive the R-D NC Standard ESPRIT and the R-D NC
Unitary ESPRIT algorithms that provide a significantly better performance
compared to their original versions for arbitrary source signals. They are
applicable to shift-invariant R-D antenna arrays and do not require a
centrosymmetric array structure. Moreover, we present a first-order asymptotic
performance analysis of the proposed algorithms, which is based on the error in
the signal subspace estimate arising from the noise perturbation. The derived
expressions for the resulting parameter estimation error are explicit in the
noise realizations and asymptotic in the effective signal-to-noise ratio (SNR),
i.e., the results become exact for either high SNRs or a large sample size. We
also provide mean squared error (MSE) expressions, where only the assumptions
of a zero mean and finite SO moments of the noise are required, but no
assumptions about its statistics are necessary. As a main result, we
analytically prove that the asymptotic performance of both R-D NC ESPRIT-type
algorithms is identical in the high effective SNR regime. Finally, a case study
shows that no improvement from strictly non-circular sources can be achieved in
the special case of a single source.Comment: accepted at IEEE Transactions on Signal Processing, 15 pages, 6
figure
Matrix and Tensor-based ESPRIT Algorithm for Joint Angle and Delay Estimation in 2D Active Broadband Massive MIMO Systems and Analysis of Direction of Arrival Estimation Algorithms for Basal Ice Sheet Tomography
In this thesis, we apply and analyze three direction of arrival algorithms (DoA) to tackle two distinct problems: one belongs to wireless communication, the other to radar signal processing. Though the essence of these two problems is DoA estimation, their formulation, underlying assumptions, application scenario, etc. are totally different. Hence, we write them separately, with ESPRIT algorithm the focus of Part I and MUSIC and MLE detailed in Part II. For wireless communication scenario, mobile data traffic is expected to have an exponential growth in the future. In order to meet the challenge as well as the form factor limitation on the base station, 2D "massive MIMO" has been proposed as one of the enabling technologies to significantly increase the spectral efficiency of a wireless system. In "massive MIMO" systems, a base station will rely on the uplink sounding signals from mobile stations to figure out the spatial information to perform MIMO beamforming. Accordingly, multi-dimensional parameter estimation of a ray-based multi-path wireless channel becomes crucial for such systems to realize the predicted capacity gains. In the first Part, we study joint angle and delay estimation for 2D "massive MIMO" systems in mobile wireless communications. To be specific, we first introduce a low complexity time delay and 2D DoA estimation algorithm based on unitary transformation. Some closed-form results and capacity analysis are involved. Furthermore, the matrix and tensor-based 3D ESPRIT-like algorithms are applied to jointly estimate angles and delay. Significant improvements of the performance can be observed in our communication scheme. Finally, we found that azimuth estimation is more vulnerable compared to elevation estimation. Results suggest that the dimension of the antenna array at the base station plays an important role in determining the estimation performance. These insights will be useful for designing practical "massive MIMO" systems in future mobile wireless communications. For the problem of radar remote sensing of ice sheet topography, one of the key requirements for deriving more realistic ice sheet models is to obtain a good set of basal measurements that enables accurate estimation of bed roughness and conditions. For this purpose, 3D tomography of the ice bed has been successfully implemented with the help of DoA algorithms such as MUSIC and MLE techniques. These methods have enabled fine resolution in the cross-track dimension using synthetic aperture radar (SAR) images obtained from single pass multichannel data. In Part II, we analyze and compare the results obtained from the spectral MUSIC algorithm and an alternating projection (AP) based MLE technique. While the MUSIC algorithm is more attractive computationally compared to MLE, the performance of the latter is known to be superior in most situations. The SAR focused datasets provide a good case study to explore the performance of these two techniques to the application of ice sheet bed elevation estimation. For the antenna array geometry and sample support used in our tomographic application, MUSIC performs better originally using a cross-over analysis where the estimated topography from crossing flightlines are compared for consistency. However, after several improvements applied to MLE, i.e., replacing ideal steering vector generation with measured steering vectors, automatic determination of the number of scatter sources, smoothing the 3D tomography in order to get a more accurate height estimation and introducing a quality metric for the estimated signals, etc., MLE outperforms MUSIC. It confirms that MLE is indeed the optimal estimator for our particular ice bed tomographic application. We observe that, the spatial bottom smoothing, aiming to remove the artifacts made by MLE algorithm, is the most essential step in the post-processing procedure. The 3D tomography we obtained lays a good foundation for further analysis and modeling of ice sheets
Multi-Step Knowledge-Aided Iterative ESPRIT for Direction Finding
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
Deterministic Cramer-Rao bound for strictly non-circular sources and analytical analysis of the achievable gains
Recently, several high-resolution parameter estimation algorithms have been
developed to exploit the structure of strictly second-order (SO) non-circular
(NC) signals. They achieve a higher estimation accuracy and can resolve up to
twice as many signal sources compared to the traditional methods for arbitrary
signals. In this paper, as a benchmark for these NC methods, we derive the
closed-form deterministic R-D NC Cramer-Rao bound (NC CRB) for the
multi-dimensional parameter estimation of strictly non-circular (rectilinear)
signal sources. Assuming a separable centro-symmetric R-D array, we show that
in some special cases, the deterministic R-D NC CRB reduces to the existing
deterministic R-D CRB for arbitrary signals. This suggests that no gain from
strictly non-circular sources (NC gain) can be achieved in these cases. For
more general scenarios, finding an analytical expression of the NC gain for an
arbitrary number of sources is very challenging. Thus, in this paper, we
simplify the derived NC CRB and the existing CRB for the special case of two
closely-spaced strictly non-circular sources captured by a uniform linear array
(ULA). Subsequently, we use these simplified CRB expressions to analytically
compute the maximum achievable asymptotic NC gain for the considered two source
case. The resulting expression only depends on the various physical parameters
and we find the conditions that provide the largest NC gain for two sources.
Our analysis is supported by extensive simulation results.Comment: submitted to IEEE Transactions on Signal Processing, 13 pages, 4
figure
Advanced Algebraic Concepts for Efficient Multi-Channel Signal Processing
ï»żUnsere moderne Gesellschaft ist Zeuge eines fundamentalen Wandels in der Art und Weise
wie wir mit Technologie interagieren. GerĂ€te werden zunehmend intelligenter - sie verfĂŒgen
ĂŒber mehr und mehr Rechenleistung und hĂ€ufiger ĂŒber eigene Kommunikationsschnittstellen.
Das beginnt bei einfachen HaushaltsgerĂ€ten und reicht ĂŒber Transportmittel bis zu groĂen
ĂŒberregionalen Systemen wie etwa dem Stromnetz. Die Erfassung, die Verarbeitung und der
Austausch digitaler Informationen gewinnt daher immer mehr an Bedeutung. Die Tatsache,
dass ein wachsender Anteil der GerÀte heutzutage mobil und deshalb batteriebetrieben ist,
begrĂŒndet den Anspruch, digitale Signalverarbeitungsalgorithmen besonders effizient zu gestalten.
Dies kommt auch dem Wunsch nach einer Echtzeitverarbeitung der groĂen anfallenden
Datenmengen zugute.
Die vorliegende Arbeit demonstriert Methoden zum Finden effizienter algebraischer Lösungen
fĂŒr eine Vielzahl von Anwendungen mehrkanaliger digitaler Signalverarbeitung. Solche AnsĂ€tze
liefern nicht immer unbedingt die bestmögliche Lösung, kommen dieser jedoch hÀufig recht
nahe und sind gleichzeitig bedeutend einfacher zu beschreiben und umzusetzen. Die einfache
Beschreibungsform ermöglicht eine tiefgehende Analyse ihrer LeistungsfĂ€higkeit, was fĂŒr den
Entwurf eines robusten und zuverlÀssigen Systems unabdingbar ist. Die Tatsache, dass sie nur
gebrĂ€uchliche algebraische Hilfsmittel benötigen, erlaubt ihre direkte und zĂŒgige Umsetzung
und den Test unter realen Bedingungen.
Diese Grundidee wird anhand von drei verschiedenen Anwendungsgebieten demonstriert.
ZunÀchst wird ein semi-algebraisches Framework zur Berechnung der kanonisch polyadischen
(CP) Zerlegung mehrdimensionaler Signale vorgestellt. Dabei handelt es sich um ein sehr
grundlegendes Werkzeug der multilinearen Algebra mit einem breiten Anwendungsspektrum
von Mobilkommunikation ĂŒber Chemie bis zur Bildverarbeitung. Verglichen mit existierenden
iterativen Lösungsverfahren bietet das neue Framework die Möglichkeit, den Rechenaufwand
und damit die GĂŒte der erzielten Lösung zu steuern. Es ist auĂerdem weniger anfĂ€llig gegen eine
schlechte Konditionierung der Ausgangsdaten. Das zweite Gebiet, das in der Arbeit besprochen
wird, ist die unterraumbasierte hochauflösende ParameterschĂ€tzung fĂŒr mehrdimensionale Signale,
mit Anwendungsgebieten im RADAR, der Modellierung von Wellenausbreitung, oder
bildgebenden Verfahren in der Medizin. Es wird gezeigt, dass sich derartige mehrdimensionale
Signale mit Tensoren darstellen lassen. Dies erlaubt eine natĂŒrlichere Beschreibung und eine
bessere Ausnutzung ihrer Struktur als das mit Matrizen möglich ist. Basierend auf dieser Idee
entwickeln wir eine tensor-basierte SchÀtzung des Signalraums, welche genutzt werden kann
um beliebige existierende Matrix-basierte Verfahren zu verbessern. Dies wird im Anschluss
exemplarisch am Beispiel der ESPRIT-artigen Verfahren gezeigt, fĂŒr die verbesserte Versionen
vorgeschlagen werden, die die mehrdimensionale Struktur der Daten (Tensor-ESPRIT),
nichzirkulÀre Quellsymbole (NC ESPRIT), sowie beides gleichzeitig (NC Tensor-ESPRIT) ausnutzen.
Um die endgĂŒltige SchĂ€tzgenauigkeit objektiv einschĂ€tzen zu können wird dann ein
Framework fĂŒr die analytische Beschreibung der LeistungsfĂ€higkeit beliebiger ESPRIT-artiger
Algorithmen diskutiert. Verglichen mit existierenden analytischen AusdrĂŒcken ist unser Ansatz
allgemeiner, da keine Annahmen ĂŒber die statistische Verteilung von Nutzsignal und
Rauschen benötigt werden und die Anzahl der zur VerfĂŒgung stehenden SchnappschĂŒsse beliebig
klein sein kann. Dies fĂŒhrt auf vereinfachte AusdrĂŒcke fĂŒr den mittleren quadratischen
SchĂ€tzfehler, die Schlussfolgerungen ĂŒber die Effizienz der Verfahren unter verschiedenen Bedingungen
zulassen. Das dritte Anwendungsgebiet ist der bidirektionale Datenaustausch mit
Hilfe von Relay-Stationen. Insbesondere liegt hier der Fokus auf Zwei-Wege-Relaying mit Hilfe
von Amplify-and-Forward-Relays mit mehreren Antennen, da dieser Ansatz ein besonders gutes
Kosten-Nutzen-VerhÀltnis verspricht. Es wird gezeigt, dass sich die nötige Kanalkenntnis
mit einem einfachen algebraischen Tensor-basierten SchĂ€tzverfahren gewinnen lĂ€sst. AuĂerdem
werden Verfahren zum Finden einer gĂŒnstigen Relay-VerstĂ€rkungs-Strategie diskutiert. Bestehende
AnsÀtze basieren entweder auf komplexen numerischen Optimierungsverfahren oder auf
Ad-Hoc-AnsÀtzen die keine zufriedenstellende Bitfehlerrate oder Summenrate liefern. Deshalb
schlagen wir algebraische AnsÀtze zum Finden der RelayverstÀrkungsmatrix vor, die von relevanten
Systemmetriken inspiriert sind und doch einfach zu berechnen sind. Wir zeigen das
algebraische ANOMAX-Verfahren zum Erreichen einer niedrigen Bitfehlerrate und seine Modifikation
RR-ANOMAX zum Erreichen einer hohen Summenrate. FĂŒr den Spezialfall, in dem
die EndgerÀte nur eine Antenne verwenden, leiten wir eine semi-algebraische Lösung zum
Finden der Summenraten-optimalen Strategie (RAGES) her. Anhand von numerischen Simulationen
wird die LeistungsfĂ€higkeit dieser Verfahren bezĂŒglich Bitfehlerrate und erreichbarer
Datenrate bewertet und ihre EffektivitÀt gezeigt.Modern society is undergoing a fundamental change in the way we interact with technology.
More and more devices are becoming "smart" by gaining advanced computation capabilities
and communication interfaces, from household appliances over transportation systems to large-scale
networks like the power grid. Recording, processing, and exchanging digital information
is thus becoming increasingly important. As a growing share of devices is nowadays mobile
and hence battery-powered, a particular interest in efficient digital signal processing techniques
emerges.
This thesis contributes to this goal by demonstrating methods for finding efficient algebraic
solutions to various applications of multi-channel digital signal processing. These may not
always result in the best possible system performance. However, they often come close while
being significantly simpler to describe and to implement. The simpler description facilitates a
thorough analysis of their performance which is crucial to design robust and reliable systems.
The fact that they rely on standard algebraic methods only allows their rapid implementation
and test under real-world conditions.
We demonstrate this concept in three different application areas. First, we present a semi-algebraic
framework to compute the Canonical Polyadic (CP) decompositions of multidimensional
signals, a very fundamental tool in multilinear algebra with applications ranging from
chemistry over communications to image compression. Compared to state-of-the art iterative
solutions, our framework offers a flexible control of the complexity-accuracy trade-off and
is less sensitive to badly conditioned data. The second application area is multidimensional
subspace-based high-resolution parameter estimation with applications in RADAR, wave propagation
modeling, or biomedical imaging. We demonstrate that multidimensional signals can
be represented by tensors, providing a convenient description and allowing to exploit the
multidimensional structure in a better way than using matrices only. Based on this idea,
we introduce the tensor-based subspace estimate which can be applied to enhance existing
matrix-based parameter estimation schemes significantly. We demonstrate the enhancements
by choosing the family of ESPRIT-type algorithms as an example and introducing enhanced
versions that exploit the multidimensional structure (Tensor-ESPRIT), non-circular source
amplitudes (NC ESPRIT), and both jointly (NC Tensor-ESPRIT). To objectively judge the
resulting estimation accuracy, we derive a framework for the analytical performance assessment
of arbitrary ESPRIT-type algorithms by virtue of an asymptotical first order perturbation
expansion. Our results are more general than existing analytical results since we do not need
any assumptions about the distribution of the desired signal and the noise and we do not
require the number of samples to be large. At the end, we obtain simplified expressions for the
mean square estimation error that provide insights into efficiency of the methods under various
conditions. The third application area is bidirectional relay-assisted communications. Due to
its particularly low complexity and its efficient use of the radio resources we choose two-way
relaying with a MIMO amplify and forward relay. We demonstrate that the required channel
knowledge can be obtained by a simple algebraic tensor-based channel estimation scheme. We
also discuss the design of the relay amplification matrix in such a setting. Existing approaches
are either based on complicated numerical optimization procedures or on ad-hoc solutions
that to not perform well in terms of the bit error rate or the sum-rate. Therefore, we propose
algebraic solutions that are inspired by these performance metrics and therefore perform well
while being easy to compute. For the MIMO case, we introduce the algebraic norm maximizing
(ANOMAX) scheme, which achieves a very low bit error rate, and its extension Rank-Restored
ANOMAX (RR-ANOMAX) that achieves a sum-rate close to an upper bound. Moreover, for
the special case of single antenna terminals we derive the semi-algebraic RAGES scheme which
finds the sum-rate optimal relay amplification matrix based on generalized eigenvectors. Numerical
simulations evaluate the resulting system performance in terms of bit error rate and
system sum rate which demonstrates the effectiveness of the proposed algebraic solutions
- âŠ