针对传统时间反转多重信号分类(Multiple Signal Classification,MUSIC)算法在探测中依赖大规模天线阵列、计算复杂度高且实时性差的问题,文章提出一种基于迭代QR分解的共偏移空频(QR Common-offset Space-Frequency,QR-CSF)成像算法。...针对传统时间反转多重信号分类(Multiple Signal Classification,MUSIC)算法在探测中依赖大规模天线阵列、计算复杂度高且实时性差的问题,文章提出一种基于迭代QR分解的共偏移空频(QR Common-offset Space-Frequency,QR-CSF)成像算法。该方法通过共偏移距测量架构建立空频多态响应矩阵,仅需双天线配置即可获取时间反转算子,显著降低了系统复杂度;同时,利用迭代QR分解并求解噪声子空间,将算法核心复杂度从超线性降至亚线性阶,有效提升了计算效率。实验结果表明,QR-CSF算法在多目标场景中能够精准定位目标,空间响应强度分布契合目标物理属性,在提升成像分辨率的同时,将运算时长压缩至传统MUSIC方法的15%,成像效率获得显著提升。展开更多
A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The...A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The derivation of the first algorithm is based on QR decomposition of the input data matrix directly, and the Givens rotations approach is used to compute the QR decomposition. Using first a prerotation of the input data matrix and then a repetition of the single channel Givens lattice algorithm, the second algorithm can be obtained. Both algorithms have superior numerical properties, particularly the robustness to wordlength limitations. The parameter vector to be estimated can be extracted directly from internal variables in the present algorithms without a backsolve operation with an extra triangular array. The results of computer simulation of the parameter identification of a two-channel system are presented to confirm efficiently the derivation.展开更多
QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD...QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.展开更多
This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precisio...This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precision of the former algorithm.展开更多
In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix...In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.展开更多
Reduced Q-matrix (Qr matrix) plays an important role in the rule space model (RSM) and the attribute hierarchy method (AHM). Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method...Reduced Q-matrix (Qr matrix) plays an important role in the rule space model (RSM) and the attribute hierarchy method (AHM). Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.展开更多
摘要针对传统时间反转多重信号分类(Multiple Signal Classification,MUSIC)算法在探测中依赖大规模天线阵列、计算复杂度高且实时性差的问题,文章提出一种基于迭代QR分解的共偏移空频(QR Common-offset Space-Frequency,QR-CSF)成像算法。该方法通过共偏移距测量架构建立空频多态响应矩阵,仅需双天线配置即可获取时间反转算子,显著降低了系统复杂度;同时,利用迭代QR分解并求解噪声子空间,将算法核心复杂度从超线性降至亚线性阶,有效提升了计算效率。实验结果表明,QR-CSF算法在多目标场景中能够精准定位目标,空间响应强度分布契合目标物理属性,在提升成像分辨率的同时,将运算时长压缩至传统MUSIC方法的15%,成像效率获得显著提升。
基金Foundation of the Academy of Electronic Science,China
摘要A pair of multichannel recursive least squares (RLS) adaptive lattice algorithms based on the order recursive of lattice filters and the superior numerical properties of Givens algorithms is derived in this paper. The derivation of the first algorithm is based on QR decomposition of the input data matrix directly, and the Givens rotations approach is used to compute the QR decomposition. Using first a prerotation of the input data matrix and then a repetition of the single channel Givens lattice algorithm, the second algorithm can be obtained. Both algorithms have superior numerical properties, particularly the robustness to wordlength limitations. The parameter vector to be estimated can be extracted directly from internal variables in the present algorithms without a backsolve operation with an extra triangular array. The results of computer simulation of the parameter identification of a two-channel system are presented to confirm efficiently the derivation.
基金Supported by the ‘Transformation of Scientific and Technological Achievements Project’ funded by the Department of Science and Technology of Jiangsu province,P.R. China (BA2006076)
摘要QR Decompositon with an M-algorithm(QRD-M) has good performance with low complexity,which is considered as a promising technique in Multiple-Input Multiple-Output(MIMO) detections.This paper presented a simplified QRD-M algorithm for MIMO Orthogonal Frequency Division Multiplexing(MIMO-OFDM) systems.In the proposed scheme,each surviving path is expanded only to partial branches in order to carry out a limited tree search.The nodes are expanded on demand and sorted in a distributed manner,based on the novel expansion scheme which can pre-determine the children's ascending order by their local distances.Consequently,the proposed scheme can significantly decrease the complexity compared with conventional QRD-M algorithm.Hence,it is especially attractive to VLSI implementation of the high-throughput MIMO-OFDM systems.Simulation results prove that the proposed scheme can achieve a performance very close to the conventional QRD-M algorithm.
摘要This paper establishes an improvement on the QL algorithm for a symmetric tridiagonal matrix T so that we can work out the eigenvalues of T faster. Meanwhile, the new algorithm don’t worsen the stability and precision of the former algorithm.
基金The author is supported by the State Major Key Project for Basic Researches of China the National Science Ponndation of China
摘要In this paper,we demonstrate that the double-shift QL algorithm for an irreducible anti-symmetric iridiagonal matrix with the shifts being two eigenvalues of the 2×2 matrix in the left upper corner of this matrix is convergent and the convergence rale of Ms kind of algorithm is generally cubic.
基金Supported by the National Natural Science Foundation of China (30860084,60673014,60263005)the Backbone Young Teachers Foundation of Fujian Normal University(2008100244)the Department of Education Foundation of Fujian Province (ZA09047)~~
摘要Reduced Q-matrix (Qr matrix) plays an important role in the rule space model (RSM) and the attribute hierarchy method (AHM). Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.