Cayley differential unitary space-time codes

One method for communicating with multiple antennas is to encode the transmitted data differentially using unitary matrices at the transmitter, and to decode differentially without knowing the channel coefficients at the receiver. Since channel knowledge is not required at the receiver, differential schemes are ideal for use on wireless links where channel tracking is undesirable or infeasible, either because of rapid changes in the channel characteristics or because of limited system resources. Although this basic principle is well understood, it is not known how to generate good-performing constellations of unitary matrices, for any number of transmit and receive antennas and for any rate. This is especially true at high rates where the constellations must be rapidly encoded and decoded. We propose a class of Cayley codes that works with any number of antennas, and has efficient encoding and decoding at any rate. The codes are named for their use of the Cayley transform, which maps the highly nonlinear Stiefel manifold of unitary matrices to the linear space of skew-Hermitian matrices. This transformation leads to a simple linear constellation structure in the Cayley transform domain and to an information-theoretic design criterion based on emulating a Cauchy random matrix. Moreover, the resulting Cayley codes allow polynomial-time near-maximum-likelihood (ML) decoding based on either successive nulling/canceling or sphere decoding. Simulations show that the Cayley codes allow efficient and effective high-rate data transmission in multiantenna communication systems without knowing the channel     

基于时间反转的MIMO雷达实值MUSIC算法

针对时间反转(TR)多输入多输出(MIMO)雷达多重信号分类(MUSIC)算法计算量庞大的问题,提出一种基于时间反转的MIMO雷达实值MUSIC算法。首先,通过采用降维思想对TR MIMO回波信号进行降维处理,来减少计算量;然后,为将协方差矩阵转化到实数域,构造酉变换矩阵进行实值变换;最后,分解出实值协方差矩阵的噪声子空间,构造谱函数估计信号波达角。相对于传统的MUSIC算法,该算法借助实值变换剔除了复数运算,极大地降低了计算量,而且不需要空间平滑降低阵列孔径就具有解相干的能力。仿真结果证实了算法的正确性。     

On the Application of the Fast Kalman Algorithm to Adaptive Deconvolution of Seismic Data

The application of a recently proposed fast implementation of the recursive least squares algorithm, called the Fast Kalman Algorithm (FKA) to adaptive deconvolution of seismic data is discussed. The newly proposed algorithm does not require the storage and updating of a matrix to calculate the filter gain, and hence is computationally very efficient. Furthermore, it has an interesting structure yielding both the forward and backward prediction residuals of the seismic trace and thus permits the estimation of a ?smoothed residual? without any additional computations. The paper also compares the new algorithm with the conventional Kalman algorithm (CKA) proposed earlier [3] for seismic deconvolution. Results of experiments on simulated as well as real data show that while the FKA is a little more sensitive to the choice of some initial parameters which need to be selected carefully, it can yield comparable performance with greatly reduced computational effort.     

An efficient DOA estimation method in multipath environment

An efficient direction of arrival (DOA) estimation method is proposed with uniform linear array (ULA) in multipath environment. By applying a transformation, we can convert a constructed complex matrix to a real one, and then utilize the real matrix combined with our proposed criterion to estimate the DOAs of uncorrelated signals. Afterwards, the contributions of uncorrelated signals are eliminated, and then several new matrices without the information of uncorrelated signals are constructed to resolve the remaining coherent signals. The proposed estimation method overcomes the shortcomings of the existing methods and has satisfactory performance. Simulation results confirm the theoretical analysis and show the effectiveness of the proposed method.     

均匀圆阵DOA估计的一种酉变换方法

针对基于均匀圆阵的子空间类DOA估计算法包含大量复数运算、硬件实现复杂的问题,提出了阵元空间中的一种酉变换方法。该方法利用阵列的中心对称性将协方差矩阵和导向矢量分别转化为实对称阵和实矢量,从而大大降低了硬件实现复杂度。基于该酉变换的MUSIC算法在性能上优于传统的MUSIC算法和均匀圆阵模式空间酉MUSIC算法。     

Alternative proposal for Modal Representation of a Non-transposed Three-Phase Transmission Line with a Vertical Symmetry Plane

The objective of this paper is to show an alternative representation in time domain of a non-transposed three-phase transmission line decomposed in its exact modes by using two transformation matrices. The first matrix is Clarke's matrix that is real, frequency independent, easily represented in computational transient programs (EMTP) and separates the line into quasi-modes a, b and zero. After that, Quasi-modes a and zero are decomposed into their exact modes by using a modal transformation matrix whose elements can be synthesized in time domain through standard curve-fitting techniques. The main advantage of this alternative representation is to reduce the processing time because a frequency dependent modal transformation matrix of a three-phase line has nine elements to be represented in time domain while a modal transformation matrix of a two-phase line has only four elements. This paper shows modal decomposition process and eigenvectors of a non-transposed three-phase line with a vertical symmetry plane whose nominal voltage is 440 kV and line length is 500 km.     

Computationally efficient 2-D DOA estimation for uniform rectangular arrays

A computationally efficient two-dimensional (2-D) direction-of-arrival (DOA) estimation method for uniform rectangular arrays is presented. A preprocessing transformation matrix is first introduced, which transforms both the complex-valued covariance matrix and the complex-valued search vector into real-valued ones. Then the 2-D DOA estimation problem is decoupled into two successive real-valued one-dimensional (1-D) DOA estimation problems with real-valued computations only. All these measures lead to significantly reduced computational complexity for the proposed method.     

Off-grid DOA estimation algorithm based on unitary transform and sparse Bayesian learning

A rapid off-grid DOA estimating method of RV-OGSBL was raised based on unitary transformation,against the problem of traditional sparse Bayesian learning (SBL) algorithm in solving effectiveness of signal’s DOA estimation under condition of lower signal noise ratio (SNR).Actual received signal of uniform linear array was generated through constructing augment matrix as the processing signal used by DOA estimation.Then,estimation model was transformed from complex value to real value by using unitary transformation.In the next step,off-grid model and sparse Bayesian learning algorithm were combined together to process the realization of DOA estimation iteratively.The accuracy of estimation could made relatively high.The simulation result demonstrates that the RV-OGSBL method not only maintains the performance of traditional SBL algorithm,but also reduces the computational complexity significantly.Under the situation of lower signal noise ratio (SNR) and low number of snapshots,the running time of algorithm is reduced about 50%.This shows the RV-OGSBL method is a rapid DOA estimation algorithm.     

采用局部搜索的二维DOA估计

针对酉旋转不变估计信号参数(Unitary-ESPRIT)算法估计精度较低的问题,提出了一种采用局部搜索实现的非相干信源二维波达方向(2-D DOA)估计方法.该方法首先利用实特征矢量近似值估计导向矩阵,然后利用矩阵Kronecker积性质以及阵列旋转不变特性获得自动配对的角度估计值,降低了2-D DOA初始估计复杂度,实现了对Unitary-ESPRIT算法的改进;接着,采用一维局部搜索法对该初始估计结果进行优化,提高了低信噪比下的2-D DOA估计精度.仿真实验结果表明,相较于传统的Unitary-ESPRIT算法,所提方法在DOA估计精度和成功率上具有明显的优势,特别是在低信噪比以及快拍数较少条件下,因此该方法能够在计算复杂度和估计性能之间取的较好的折中.     

3-puzzle量子计算的酉变换矩阵及逻辑线路

针对3-puzzle问题,运用量子计算方法,分析了节点扩展的酉变换矩阵.通过一个3-puzzle问题实例,对其进行了元素编码和节点状态编码,描述了具体的节点扩展酉变换矩阵,并运用量子受控非门逻辑线路实现了酉变换矩阵.讨论了N-puzzle量子计算的线路模型,对量子位的基态和最佳基态的制备作了分析.阐述了N-puzzle启发式搜索量子计算框架.     

基于ESPRIT算法的十字型阵列MIMO雷达降维DOA估计

该文针对十字型阵列配置下的单基地MIMO雷达2维空间角度估计问题,提出一种基于ESPRIT算法的降维DOA估计算法。算法通过降维矩阵的设计及回波数据的降维变换,将高维回波数据转换至低维信号空间,最大程度地去除了所有的冗余数据;利用矩阵的酉变换进行实数域信号子空间的估计,并基于ESPRIT算法实现2维空间角度的联合估计及参数的自动配对。算法不牺牲阵列孔径,在获取信噪比增益和快拍增益的同时,有效降低了回波数据的维数,具有更低的运算复杂度。仿真结果验证了理论分析的正确性和算法的有效性。     

Parallel VLSI matrix pencil algorithm for high resolution directionfinding

Algorithms to find the directions of arrival (DOAs) of multiple signals from measurements on an array of antenna doublets (ESPRIT method) and their parallel VLSI implementation are discussed. In particular, algorithms that allow large-scale pipelining and use only robust, unitary transformations are identified. This problem is solved by a matrix pencil approach in which the generalized eigenvalues of a pair of data matrices are determined. A modified Stewart Jacobi approach is used for which convergence is improved and parameter computations are simplified. The resulting architecture is a two-layer Jacobi array that can handle all the subproblems: two QR factorizations, two SVDs, and a single generalized Schur decomposition. The mapping of the subproblems on a single parallel array of CORDIC processors is considered     

Application of discrete periodic wavelets to measured equation ofinvariance

Recently, the wavelet expansions have been applied in field computations. In the frequency domain, the application is focused on the thinning of matrices arising from the method of moment (MoM). The thinning of matrices can best be done by the measured equation of invariance (MEI), which provides sparsity almost without sacrificing accuracy in that the boundary equation it entails is convertible to that of the MoM. The real power of the wavelet expansions is to give high resolution in convolution integrals. High resolution is also needed in the process of finding the MEI coefficients, which are obtained via an integration process almost identical to that of the MoM. In this paper, it is shown that when the fast discrete periodic wavelets (FDPW) are used as metron currents in the MEI method, the resolutions of the MEI coefficients are improved at high-frequency computations or at geometric extremities. The level of sparsity of the MEI is much more favorable than that achievable by the thinning of MoM matrix using the wavelet expansions. The role of FDPW in the MEI happens to be more fitting than its place in the MoM     

DOA estimation for monostatic MIMO radar based on unitary root-MUSIC

Direction of arrival (DOA) estimation is an important issue for monostatic MIMO radar. A DOA estimation method for monostatic MIMO radar based on unitary root-MUSIC is presented in this article. In the presented method, a reduced-dimension matrix is first utilised to transform the high dimension of received signal data into low dimension one. Then, a low-dimension real-value covariance matrix is obtained by forward–backward (FB) averaging and unitary transformation. The DOA of targets can be achieved by unitary root-MUSIC. Due to the FB averaging of received signal data and the eigendecomposition of the real-valued matrix covariance, the proposed method owns better angle estimation performance and lower computational complexity. The simulation results of the proposed method are presented and the performances are investigated and discussed.     

基于酉变换-矩阵束的稀布线阵方向图综合

该文提出一种非迭代的稀布线阵方向图综合方法。该方法首先对方向图采样数据进行centro-Hermit化处理,然后通过酉变换构造等价实矩阵束,得到非均匀单元位置与新矩阵束广义特征值的关系。在此基础上,对实矩阵奇异值分解,并舍弃非主要奇异值以获得低阶左奇异向量矩阵,进而求得稀布阵列的阵元位置和相应激励。相比于其他方法,该方法能够直接得到阵元位置的实数解,奇异值分解和特征值分解均在实数域进行,提高逼近程度的同时有效降低了计算量,仿真验证了该方法利用少量阵元即可高效实现线阵的方向图综合。     

基于矩阵初等变换的量子逻辑电路综合的新方法

量子逻辑电路是经典可逆计算和量子计算的交叉领域,对其综合方法的研究具有重要意义。提出了一个基于矩阵初等变换的全新的综合方法,Toffoli门集被选作基本门库,其中每个逻辑门的矩阵都可以分解为初等变换的乘积（称作一个初等变换路径）,结合一些启发式规则,将得到的初等变换路径变成Toffoli门序列的形式,也即逻辑电路形式。给出了一个三阶逻辑电路的例子,分析了该新方法的性能。     

一种数值稳健且低复杂度的信号子空间估计新方法

该文提出了一种数值稳健且低复杂度的信号子空间估计新方法。该方法通过多级维纳滤波器前向迭代构造观测数据协方差矩阵三对角化的转换矩阵,其列向量为信号子空间的一组正交基。与传统的相关相减结构结构相比,该文的多级维纳滤波器前向迭代通过Householder酉变换实现,显著增强了有限精度运算中信号子空间基向量的正交性,提高了数值稳健性。此外,基于Householder矩阵的酉性质和矩阵后向累积提出了一种转换矩阵的快速计算方法,降低了计算复杂度。计算机仿真结果验证了该方法的数值稳健性和计算效率。     

基于多步分解算法的解卷积混合盲源分离新方法

该文提出一种基于二阶统计量的时域多步分解算法求解卷积混合盲源分离问题。引入白化处理,将混迭矩阵转变成酉矩阵,同时,根据源信号不同延时下相关矩阵所具有的块状对角结构,将酉矩阵分为不同的列块。针对各列块之间相互正交的特性,提出一种关于某一特定列块的最小二乘三二次代价函数。利用一种常规的基于梯度下降法的三迭代算法,交替估计代价函数中的3组待定参数,搜索其最小点,得到酉矩阵一个列块的估计。利用系统化的多步分解算法(MSA),依次估计酉矩阵的每个列块,最终得到整个酉矩阵的估计,进而恢复出源信号。仿真结果表明,新方法性能优于经典的SUB方法及新近提出的JBD-NonU方法,可有效地解决卷积混合盲源分离问题。     

Localization of wideband signals using least-squares and totalleast-squares approaches

In this paper, we introduce a new focusing technique for localization of wideband signals. Relaxing the unitary assumption for the focusing matrices, we formulate the least-square (LS) and the total least-square (TLS) coherent signal-subspace methods. The TLS is an alternative to the conventional LS and uses the fact that errors can exist both in the focusing location matrix as well as in the estimated location matrix at a given frequency bin. To prevent the focusing loss, we use a class of focusing matrices that are constant under multiplication by their Hermitian transpose. The class of unitary matrices comports with this property. We then develop a new focusing technique based on a modification to the TLS (MTLS). It is shown that the computational complexity of the new technique is significantly lower than that for the rotational signal subspace method (RSS). The focusing gain of the new technique is also larger than the focusing gain of the RSS algorithm. The simulation study shows that, compared with the RSS, the new algorithm has a smaller resolution signal to-noise ratio (SNR)