In this paper, a new recursive algorithm of adaptive array weight vectors and its systolic array implementing structure is proposed, which is based on the QR decomposition algorithms and the idea of algorithmic engine...In this paper, a new recursive algorithm of adaptive array weight vectors and its systolic array implementing structure is proposed, which is based on the QR decomposition algorithms and the idea of algorithmic engineering. The algorithm can realize fully parallel and pipeline processing.展开更多
An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach....An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.展开更多
In order to make the typical Montgomery’s algorithm suitable for implementation on FPGA, a modified version is proposed and then a high-performance systolic linear array architecture is designed for RSA cryptosystem ...In order to make the typical Montgomery’s algorithm suitable for implementation on FPGA, a modified version is proposed and then a high-performance systolic linear array architecture is designed for RSA cryptosystem on the basis of the optimized algorithm. The proposed systolic array architecture has dis- tinctive features, i.e. not only the computation speed is significantly fast but also the hardware overhead is drastically decreased. As a major practical result, the paper shows that it is possible to implement public-key cryptosystem at secure bit lengths on a single commercially available FPGA.展开更多
This paper proposes a new multitarget constant modulus array structure for code division multiple access (CDMA) systems. The new algorithm for the structure is called pre-despreading and wavelet denoising constant mod...This paper proposes a new multitarget constant modulus array structure for code division multiple access (CDMA) systems. The new algorithm for the structure is called pre-despreading and wavelet denoising constant modulus algorithm (D-WD-CMA). In the new algorithm, the pre-despreading is applied to multitarget arrays to remove some multiple access inter- ferences. After that the received signal is subjected to wavelet de-noising to reduce some noise, and used in CMA adaptive iteration for signal separation. Simulation results showed that the proposed algorithm performed better than the traditional CMA algorithm.展开更多
A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus alg...A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus algorithm （D-DDLSCMA）. In the new algorithm, the pre-despreading is first applied for multitarget arrays to remove some multiple access signals, then the despreaded signal is processed by the algorithm which united the constant modulus algorithm and decision directed method. Simulation results illustrate the good performance for the proposed algorithm.展开更多
The least squares(LS) minimization problem constitutes the core of many real-time signal processing problems. A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS resi...The least squares(LS) minimization problem constitutes the core of many real-time signal processing problems. A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS residual evaluation are presented in this paper. We analyze upper bounds of the dynamic range of processing cells and the internal parameters. Thus the wordlength can be obtained to prevent overflow and to ensure correct operations. Simulation results confirm the theoretical conclusions and the stability of the algorithm.展开更多
The spatial diversity of distributed network demands the individual filter to accommodate the topology of interference environment. In this paper, a type of distributed adaptive beamformer is proposed to mitigate inte...The spatial diversity of distributed network demands the individual filter to accommodate the topology of interference environment. In this paper, a type of distributed adaptive beamformer is proposed to mitigate interference over coordinated antenna arrays network. The proposed approach is formulated as generalized sidelobe canceller （GSC） structure to facilitate the convex combination of neighboring nodes＇ weights, and then it is solved by unconstrained least mean square （LMS） algorithm due to simplicity. Numerical results show that the robustness and convergence rate of antenna arrays network can be significantly improved in strong interference scenario. And they also clearly illustrate that mixing vector is optimized adaptively and adjusted according to the spatial diversity of the distributed nodes which are placed in different power of received signals to interference ratio （SIR） environments.展开更多
文摘In this paper, a new recursive algorithm of adaptive array weight vectors and its systolic array implementing structure is proposed, which is based on the QR decomposition algorithms and the idea of algorithmic engineering. The algorithm can realize fully parallel and pipeline processing.
文摘An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.
文摘In order to make the typical Montgomery’s algorithm suitable for implementation on FPGA, a modified version is proposed and then a high-performance systolic linear array architecture is designed for RSA cryptosystem on the basis of the optimized algorithm. The proposed systolic array architecture has dis- tinctive features, i.e. not only the computation speed is significantly fast but also the hardware overhead is drastically decreased. As a major practical result, the paper shows that it is possible to implement public-key cryptosystem at secure bit lengths on a single commercially available FPGA.
基金Project supported by the National Natural Science Foundation of China (No. 60372107) and the Hi-Tech Research and Development Program (863) of China (No. 2002AA121068)
文摘This paper proposes a new multitarget constant modulus array structure for code division multiple access (CDMA) systems. The new algorithm for the structure is called pre-despreading and wavelet denoising constant modulus algorithm (D-WD-CMA). In the new algorithm, the pre-despreading is applied to multitarget arrays to remove some multiple access inter- ferences. After that the received signal is subjected to wavelet de-noising to reduce some noise, and used in CMA adaptive iteration for signal separation. Simulation results showed that the proposed algorithm performed better than the traditional CMA algorithm.
文摘A new mulfitarget constant modulus array is proposed for CDMA systems based on least squares constant modulus algorithm. The new algorithm is called pre-despreading decision directed least squares constant modulus algorithm （D-DDLSCMA）. In the new algorithm, the pre-despreading is first applied for multitarget arrays to remove some multiple access signals, then the despreaded signal is processed by the algorithm which united the constant modulus algorithm and decision directed method. Simulation results illustrate the good performance for the proposed algorithm.
文摘The least squares(LS) minimization problem constitutes the core of many real-time signal processing problems. A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS residual evaluation are presented in this paper. We analyze upper bounds of the dynamic range of processing cells and the internal parameters. Thus the wordlength can be obtained to prevent overflow and to ensure correct operations. Simulation results confirm the theoretical conclusions and the stability of the algorithm.
基金supported by National Basic Research Program of China (No. 2010CB731903)
文摘The spatial diversity of distributed network demands the individual filter to accommodate the topology of interference environment. In this paper, a type of distributed adaptive beamformer is proposed to mitigate interference over coordinated antenna arrays network. The proposed approach is formulated as generalized sidelobe canceller （GSC） structure to facilitate the convex combination of neighboring nodes＇ weights, and then it is solved by unconstrained least mean square （LMS） algorithm due to simplicity. Numerical results show that the robustness and convergence rate of antenna arrays network can be significantly improved in strong interference scenario. And they also clearly illustrate that mixing vector is optimized adaptively and adjusted according to the spatial diversity of the distributed nodes which are placed in different power of received signals to interference ratio （SIR） environments.
