检索结果-南通市图书馆

Science China(information Sciences) 2011年第7期54卷 1500-1511页

作者： WANG Ding & WU Ying institute of information engineering,information engineering University,Zhengzhou 450002,China 1. institute of information engineering Information Engineering University Zhengzhou 450002 China

The array mutual coupling,gain-phase errors and sensor position errors would significantly degrade the performance of high-resolution direction of arrival (DOA) estimation *** at the combined influences of the above three array errors,a kind of active calibration algorithm is presented with the help of instrumental sensors in this ***,the integrated effects of the three array errors are shown to be equivalent to angularly dependent gain-phase ***,a non-linear least square (LS) optimization model for the three array errors is established through an auto-calibration algorithm using auxiliary sensors,and the corresponding resolving algorithms of the LS optimization problem are given according to the different models of array errors ***,the parameter estimation uniqueness of the proposed algorithms is analyzed in detail and an improvement strategy is ***,the effectiveness of the novel algorithm is validated by simulations.

关键词： array calibration array errors mutual coupling effect gain-phase errors sensor position errors instrumental sensors

Array errors active calibration algorithm and its improvement

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第5期53卷 1016-1033页

作者： WANG Ding & WU Ying institute of information engineering, information engineering University, Zhengzhou 450002, China 1. institute of information engineering Information Engineering University Zhengzhou 450002 China

The combined effects of mutual coupling, gain and phase errors, and sensor position errors have great negative impact on the direction-finding performance of the MUSIC algorithm. This paper investigates the calibration of the array errors induced by the three errors. based on the array errors calibration algorithm (algorithm 1) presented by See, two improved array error-calibrating algorithms are presented. One (algorithm 2) uses the sparseness of mutual coupling matrix, and the other (algorithm 3) utilizes more special structures of mutual coupling matrix. Although the three algorithms have the same computation mode and theoretical framework, the latter two algorithms have much higher precision than the former one, as more properties of mutual coupling matrix are utilized in the two algorithms, and if the array manifold is uniform linear array or uniform circular array, algorithm 3 could have more obvious advantages. On the other hand, the three algorithms can be generalized to the situation when the calibration source azimuths have deviations. The three extended algorithms can not only calibrate the array errors, but also offset the deviations of calibration source azimuths simultaneously. Finally, the performances of the three algorithms are compared both in the absence and presence of the deviations of calibration source azimuths. Many simulation experiments demonstrate that the estimation precision of array errors can be obviously improved if more properties of mutual coupling matrix are effectively used.

关键词： array calibration mutual coupling gain and phase error sensor position errors complex symmetric banded Toeplitz matrix complex symmetric circular matrix sparse matrix

Constructing quantum error correcting code via logic function

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2010年第3期53卷 515-523页

作者： ZHONG ShuQin, MA Zhi & XU YaJie Zhengzhou institute of information engineering, University of information engineering of China, Zhengzhou 450002, China 1. Zhengzhou institute of information engineering University of Information Engineering of China Zhengzhou 450002 China

We present a systematic way to construct p-ary quantum error correcting codes using logic functions. As a consequence, for a given function with APC distance d′ 2, we can construct quantum codes with parameters ((n, K, d))p and gain a lower bound of K for all 2 d d′. The basic states of the constructed quantum codes can be stated and the sufficient conditions for saturating quantum Singleton bound are also discussed. We give quantum codes [[5, 1, 3]]p with p prime, [[6, 0, 4]], [[6, 2, 3]]p with p > 2 prime and [[2n, 2n - 2, 2]] as examples constructed in this way.

关键词： quantum error-correcting code logic states APC distance

WEAK TYPE(1,1)bOUNDS FOR A MARCINKIEWICZ INTEGRAL

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Analysis in Theory and Applications 1994年第2期10卷 54-66页

作者： Hu Guoen institute of information engineering, China Department of Mathematics institute of information engineering Zhengzhou, Henan, 450002. 1. Department of Mathematics Institute of Information Engineering Zhengzhou 450002 Henan

In this paper, the two-dimensional Marcinkewicz integral introduced by Stein μ(f)(x)=(∫_0~x|∫_(|x-y|≤1) _(|x-y|)^(Ω(x-y))f(y)dy|~2t^(-3)dt)~2 is shown to be of weak type (1,1) and weighted weak type (1,1) with r... 详细信息

关键词： Math Pro bOUNDS FOR A MARCINKIEWICZ INTEGRAL WEAK TYPE

Particle swarm optimization with a leader and followers

在线全文

学校读者我要写书评

暂无评论

Progress in Natural Science:Materials International 2008年第11期18卷 1437-1443页

作者： Junwei Wang Dingwei Wang institute of Systems engineering,College of information Science and engineering,Northeastern University,Shenyang 110004,China institute of Systems engineering College of Information Science and Engineering Northeastern University Shenyang 110004 China

Referring to the flight mechanism of wild goose flock,we propose a novel version of Particle Swarm Optimization(PSO)with a leader and *** is referred to as Goose Team Optimization(GTO).The basic features of goose team flight such as goose role division, parallel principle,aggregate principle and separate principle are implemented in the recommended *** GTO,a team is formed by the particles with a leader and some *** role of the leader is to determine the search *** followers decide their flying modes according to their distances to the leader ***,a wide area can be explored and the particle collision can be really *** GTO is applied to four benchmark examples of complex nonlinear functions,it has a better computation perfor- mance than the standard PSO.

关键词： Particle swarm optimization Goose team optimization Role division Parallel principle Aggregate principle Separate principle

First photometric study of the eclipsing binary PS Persei

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Research in Astronomy and Astrophysics 2011年第2期11卷 191-197页

作者： Jin-Zhao Yuan Physics and information engineering institute,Shanxi Normal University,Linfen 041004,China Physics and information engineering institute Shanxi Normal University Linfen 041004 China

CCD photometric observations of the eclipsing binary PS Persei （PS Per） were obtained on two consecutive days in *** 2003 version of the WilsonDevinney code was used to analyze the first complete light curves in the V and R *** is found that PS Per is a short-period Algol-type binary with the less massive component completely filling its inner critical Roche *** mass ratio of q=0.518 and the orbital inclination of i=89.86° are *** addition,based on all available times of primary light minima,including two new ones,the orbital period has been improved.

关键词： stars: binaries: close -- stars: binaries: eclipsing -- stars: individual:PS Per

Generalized Self-Adaptive Genetic Algorithms

在线全文

学校读者我要写书评

暂无评论

International Journal of Minerals,Metallurgy and Materials 2000年第1期14卷 72-75页

作者： bin Wu Xuyan Tu Jian Wu information engineering School, University of Science and Technology beijing, beijing 100083, China Department of information and Control engineering, Southwest institute of Technology, Mianyang 621002, China information engineering School University of Science and Technology Beijing Beijing 100083 China Department of information and Control engineering Southwest Institute of Technology Mianyang 621002 China

In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.

关键词： generalized self-adaptive genetic algorithm initial population immigration fitness function

A NEW METHOD OF FREQUENCY-HOPPING(FH) SIGNAL DETECTION

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2011年第4期28卷 468-473页

作者： Zeng Yu Liu Xueqian Li Ou(information and engineering University,information and engineering institute,Zhengzhou 450002,China) information and engineering institute Information and Engineering University Zhengzhou China Zhengzhou China

A new Frequency-Hopping(FH) signal detection method is *** from pre-vious methods which need to monitor the total band,it can monitor part of the band and decrease the range of the *** to this method,a new detection model is set and the computation formulas of the detection probability and false-alarm probability are *** parameters of a VHF radio are used to prove the validity of the *** results show that this method can de-crease the range of the bandwidth and detect the FH signal with some penalty on the SNR and signal loss.

关键词： Frequency-Hopping(FH) Detection Monitor Interception Channelized radiometer

Reconfigurable design and implementation of the MD6 Hash function

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2010年第2期17卷 109-115页

作者： GAO Xian-wei Department of Electronic and information engineering,beijing Electronic Science and Technology institute,beijing 100070,China [a] Department of Electronic information engineering Beijing Electronic Science Technology institute Beijing 100070 China

Efficient reconfigurable field programmable gate array （FPGA） architectures for the MD6-224/256/384/512 Hash algorithm are proposed in this article. The basic iterative compact design requires 923 ALMs and achieves a throughput ranging from 225 Mbit/s to 394 Mbit/s at a maximum frequency of 198 MHz. The 32-step-urtrolled high-throughput design requires 7 090 ALMs and achieves a throughput ranges from 5 776 Mbit/s to 9 490 Mbit/s at a maximum frequency of 173 MHz. The simulation results show that high flexibility and efficient FPGA implementation of the MD6 Hash function is achieved.

关键词： SHA-3 MD6 reconfigurable iterative loop-unrolling