913 research outputs found

    Implementation of accurate broadband steering vectors for broadband angle of arrival estimation

    Get PDF
    Motivated by accurate broadband steering vector requirements for applications such as broadband angle of arrival estimation, we review fractional delay filter designs. A common feature across these are their rapidly decreasing performance as the Nyquist rate is approached. We propose a filter bank based approach, which operates standard fractional delay filters on a series of frequency-shifted subband signals, such that they appear in the filters’ lowpass region. We demonstrate the appeal of this approach in simulations

    Broadband angle of arrival estimation methods in a polynomial matrix decomposition framework

    Get PDF
    A large family of broadband angle of arrival estimation algorithms are based on the coherent signal subspace (CSS) method, whereby focussing matrices appropriately align covariance matrices across narrowband frequency bins. In this paper, we analyse an auto-focussing approach in the framework of polynomial covariance matrix decompositions, leading to comparisons to two recently proposed polynomial multiple signal classification (MUSIC) algorithms. The analysis is complemented with numerical simulations

    Intercomparison of numerical models of flaring coronal loops

    Get PDF
    The proposed Benchmark Problem consists of an infinitesimal magnetic flux tube containing a low-beta plasma. The field strength is assumed to be so large that the plasma can move only along the flux tube, whose shape remains invariant with time (i.e., the fluid motion is essentially one-dimensional). The flux tube cross section is taken to be constant over its entire length. In planar view the flux tube has a semi-circular shape, symmetric about its midpoint s = s sub max and intersecting the chromosphere-corona interface (CCI) perpendicularly at each foot point. The arc length from the loop apex to the CCI is 10,000 km. The flux tube extends an additional 2000 km below the CCI to include the chromosphere, which initially has a uniform temperature of 8000 K. The temperature at the top of the loop was fixed initially at 2 X 1 million K. The plasma is assumed to be a perfect gas (gamma = 5/3), consisting of pure hydrogen which is considered to be fully ionized at all temperatures. For simplicity, moreover, the electron and ion temperatures are taken to be everywhere equal at all times (corresponding to an artificially enhanced electron-ion collisional coupling). While there was more-or-less unanimous agreement as to certain global properties of the system behavior (peak temperature reached, thermal-wave time scales, etc.), no two groups could claim satisfactory accord when a more detailed comparison of solutions was attempted

    Ordering and arrangement of deformed red blood cells in flow through microcapillaries

    Get PDF
    The shapes and alignment of elastic vesicles similar to red blood cells (RBCs) in cylindrical capillary flow are investigated by mesoscopic hydrodynamic simulations. We study the collective flow behavior of many RBCs, where the capillary diameter is comparable to the diameter of the RBCs. Two essential control parameters are the RBC volume fraction (the tube hematocrit, H-T), and the suspension flow velocity. Depending on H-T, flow velocity and capillary radius, the RBC suspension exhibits a disordered phase and two distinct ordered phases, consisting of a single file of parachute-shaped cells and a zigzag arrangement of slipper-shaped cells, respectively. We argue that thermal fluctuations, included in the simulation method, coupled to hydrodynamic flows are important contributors to the RBC morphology. We examine the changes to the phase structures when the capillary diameter and the material properties (bending rigidity kappa and stretching modulus mu) of the model RBCs are varied, constructing phase diagrams for each case. We focus on capillary diameters, which range from about 1.0 to about 1.4 times the RBC long diameter. For the smallest capillary diameter, the single-file arrangement dominates; for the largest diameter, the ordered zigzag arrangement begins to loose its stability and alternates with an asymmetric structure with two lanes of differently oriented cells. In simulations with long capillaries, the coexistence of different phases can be observed

    Relevance of polynomial matrix decompositions to broadband blind signal separation

    Get PDF
    The polynomial matrix EVD (PEVD) is an extension of the conventional eigenvalue decomposition (EVD) to polynomial matrices. The purpose of this article is to provide a review of the theoretical foundations of the PEVD and to highlight practical applications in the area of broadband blind source separation (BSS). Based on basic definitions of polynomial matrix terminology such as parahermitian and paraunitary matrices, strong decorrelation and spectral majorization, the PEVD and its theoretical foundations will be briefly outlined. The paper then focuses on the applicability of the PEVD and broadband subspace techniques — enabled by the diagonalization and spectral majorization capabilities of PEVD algorithms—to define broadband BSS solutions that generalise well-known narrowband techniques based on the EVD. This is achieved through the analysis of new results from three exemplar broadband BSS applications — underwater acoustics, radar clutter suppression, and domain-weighted broadband beamforming — and their comparison with classical broadband methods

    Design of FIR paraunitary filter banks for subband coding using a polynomial eigenvalue decomposition

    Get PDF
    The problem of paraunitary filter bank design for subband coding has received considerable attention in recent years, not least because of the energy preserving property of this class of filter banks. In this paper, we consider the design of signal-adapted, finite impulse response (FIR), paraunitary filter banks using polynomial matrix EVD (PEVD) techniques. Modifications are proposed to an iterative, time-domain PEVD method, known as the sequential best rotation (SBR2) algorithm, which enables its effective application to the problem of FIR orthonormal filter bank design for efficient subband coding. By choosing an optimisation scheme that maximises the coding gain at each stage of the algorithm, it is shown that the resulting filter bank behaves more and more like the infiniteorder principle component filter bank (PCFB). The proposed method is compared to state-of-the-art techniques, namely the iterative greedy algorithm (IGA), the approximate EVD (AEVD), standard SBR2 and a fast algorithm for FIR compaction filter design, called the window method (WM). We demonstrate that for the calculation of the subband coder, the WM approach offers a low-cost alternative at lower coding gains, while at moderate to high complexity, the proposed approach outperforms the benchmarkers. In terms of run-time complexity, AEVD performs well at low orders, while the proposed algorithm offers a better coding gain than the benchmarkers at moderate to high filter order for a number of simulation scenarios

    Order-controlled multiple shift SBR2 algorithm for para-hermitian polynomial matrices

    Get PDF
    In this work we present a new method of controlling the order growth of polynomial matrices in the multiple shift second order sequential best rotation (MS-SBR2) algorithm which has been recently proposed by the authors for calculating the polynomial matrix eigenvalue decomposition (PEVD) for para-Hermitian matrices. In effect, the proposed method introduces a new elementary delay strategy which keeps all the row (column) shifts in the same direction throughout each iteration, which therefore gives us the flexibility to control the polynomial order growth by selecting shifts that ensure non-zero coefficients are kept closer to the zero-lag plane. Simulation results confirm that further order reductions of polynomial matrices can be achieved by using this direction-fixed delay strategy for the MS-SBR2 algorithm

    Frequency invariant beamforming for two-dimensional and three-dimensional arrays

    Get PDF
    A novel method for the design of two-dimensional (2-D) and three-dimensional (3-D)arrays with frequency invariant beam patterns is proposed. By suitable substitu- tions, the beam pattern of a 2-D or 3-D arrays can be regarded as the 3-D or 4-D Fourier transform of its spatial and temporal parameters. Since frequency invariance can be easily imposed in the Fourier domain, a simple design method is derived. Design examples for the 2-D case are provided
    corecore