Loading...
Office

Table of Content

    20 October 2012 Volume 39 Issue 5
      
    Original Articles
    Traffic-aware routing protocol for the cognitive wireless network
    J4. 2012, 39(5):  1-5+11.  doi:10.3969/j.issn.1001-2400.2012.05.001
    Abstract ( 988 )   PDF (590KB) ( 1059 )   Save
    References | Related Articles | Metrics

    In existing routing protocols for wireless networks, congestion control schemes are taken into consideration only after congestion has happened, and these reactive manners may result in more packets loss, longer end-to-end delay and more overhead. This paper proposes a traffic-aware routing protocol(TACR) which can be used in cognitive wireless networks. By the use of prediction methods based on wiener processes and local probe information, TACR perceives traffic state changes quickly and accurately, thereby optimizing network routing and effectively balancing the network load. Meanwhile, distributed Q-learning mechanism is introduced into TACR to dynamically adjust the route lifetime according to network conditions, and the routing adaptability for traffic distribution is improved. Under the reasonable definition of network overhead, we analyze the performance of TACR in the typical scene, and prove its superiority. Simulation results show that the TACR routing protocol shortens the average end-to-end delay by 40%, reduces packets loss by 10% and network control overhead by 27% compared with the existing routing protocol in heavy load environments.

    Multi-user quantum key distribution model and the correlative protocol
    LIU Xiaohui;PEI Changxing;NIE Min
    J4. 2012, 39(5):  6-11.  doi:10.3969/j.issn.1001-2400.2012.05.002
    Abstract ( 2384 )   PDF (556KB) ( 920 )   Save
    References | Related Articles | Metrics

    We propose a Multi-user Quantum Key Distribution (MQKD) protocol, which only needs n quantum channels for a communication system of n users to realize the protocol with entangled states and entanglement swapping. By the quantum mediator, any two among n users of the system can communicate with each other, even though there is no direct quantum channel between them. Based on the traffic theory, we present a relationship formula of the number of user n and the number of Bell state measurement units m. Because entanglement swapping entangles the quantum states of the two users, the quantum mediator has no way to fraudulently intervene in or eavesdrop on the communication.

    Change detection in multitemporal remote sensing images based on local mean dynamic Fisher discriminant analysis
    XIN Fangfang;JIAO Licheng;WANG Lingxia;WANG Guiting
    J4. 2012, 39(5):  12-17+29.  doi:10.3969/j.issn.1001-2400.2012.05.003
    Abstract ( 965 )   PDF (2810KB) ( 955 )   Save
    References | Related Articles | Metrics

    This paper proposes a novel change detection technique, which treats the detection problem as a classifier problem and uses the improved dynamic Fisher classifier to identify the changes in the joint intensity histogram. By considering the relationship between the pixel and its neighborhood, local mean dynamic Fisher discriminant analysis (LMDFDA) is proposed to introduce the neighborhood’s information. Meanwhile, the parameters of the classifier are adjusted according to the current detection result, which avoids the influences of initial conditions. The proposed method is distribution free, context-sensitive and not affected by comparison operators. Experiments show that the proposed algorithm is effective and feasible for real multi-temporal remote sensing images.

    Second order total generalized variational inpainting model and its algorithm
    XU Jianlou;FENG Xiangchu;HAO Yan
    J4. 2012, 39(5):  18-23.  doi:10.3969/j.issn.1001-2400.2012.05.004
    Abstract ( 1357 )   PDF (3412KB) ( 1150 )   Save
    References | Related Articles | Metrics

    In order to restore the damaged image better, this paper proposes a new second total generalized variation based image inpainting model. By analysing the properties of new model, an efficient primal-dual algorithm is introduced. Experimental results show that the new model is better than the total variation model in terms of both peak signal to noise ratio(PSNR) and visual effect.

    Digital anti-counterfeiting scheme based on key-exposure free chameleon signature
    LIU Dongsu;MIAO Meixia;MA Hua;LIN Ruibin;TIAN Haibo
    J4. 2012, 39(5):  24-29.  doi:10.3969/j.issn.1001-2400.2012.05.005
    Abstract ( 1121 )   PDF (515KB) ( 804 )   Save
    References | Related Articles | Metrics

    For the purpose of solving the problems of low query rate, inefficiency, and non-traceability in the existing digital anti-counterfeiting systems, a new anti-counterfeiting scheme based on chameleon signature without key exposure is proposed. The scheme can effectively improve the query rate of the system, strengthen the data integrity, resist the brute force attack, and distinguish the true products from bogus ones. Therefore, it is more suitable for anti-counterfeiting digital products in the electronic commerce infrastructure.

    Properties of cross-correlation between two P-ary m-sequences of different periods
    SUN Yuhua;LI Hui;YAN Tongjiang
    J4. 2012, 39(5):  30-34+41.  doi:10.3969/j.issn.1001-2400.2012.05.006
    Abstract ( 1241 )   PDF (383KB) ( 826 )   Save
    References | Related Articles | Metrics

    Recently, Ness and Helleseth initiated studies on the cross-correlation between two binary m-sequences of different periods. Based on their results, we analyse the properties of the cross-correlation between two p-ary m-sequences of different periods, and give the equations for the cross-correlation values to be met. Finally, for p=3, it is proved that the cross-correlation values takes on at least three different values.

    Adaptive time-frequency analysis based on the parameter decomposition
    WANG Hai;MA Linli;ZHANG Min
    J4. 2012, 39(5):  35-41.  doi:10.3969/j.issn.1001-2400.2012.05.007
    Abstract ( 1011 )   PDF (918KB) ( 849 )   Save
    References | Related Articles | Metrics

    Aiming at the influence of cross terms in the secondary time-frequency transformation, we have studied a kind of time-frequency analysis method based on signal decomposition. Combined with Gaussian extraction thoughts and excellent characteristics of WVD, the signal is decomposed into several chirp signal with gauss envelope components. And then through WVD time-frequency transform and comprehensive display of time-frequency diagrams, the influence of cross terms is eliminated with the signal's time-frequency aggregation degrees maintained. The time-frequency analysis method is applied to radar signal analysis. Experimental results show that this decomposition method effectively eliminates the cross terms of the signal, and maintains its time-frequency aggregation degrees.

    Reducing the waveform auto-correlation sidelobes and cross-correlation of MIMO radar by using chaotic sequences
    SHEN Dong;ZHANG Linrang;LIU Xin;LIU Nan
    J4. 2012, 39(5):  42-46+60.  doi:10.3969/j.issn.1001-2400.2012.05.008
    Abstract ( 1060 )   PDF (505KB) ( 858 )   Save
    References | Related Articles | Metrics

    Based on the good auto-correlation and random property of chaotic sequences, a method is proposed to reduce the waveform auto-correlation sidelobes and cross-correlation of multiple-input multiple-output(MIMO) radar with chaotic sequences. Chaotic waveforms can be generated by quantifying and quadriphase coding of chaotic sequences from different initial values. As auto-correlation sidelobes of different chaotic waveforms are not correlated, cross-correlations of different chaotic waveforms are not correlated either, so multiple pulse compression accumulation can help to reduce auto-correlation sidelobes and cross-correlation effects in MIMO radar effectively. The output has a low peak sidelobe value and the detection performance is increased. Finally, simulation results show the effectiveness of this method.

    A Hybrid Phase Unwrapping Algorithm Combining Branch-Cut and Surface-Fitting for InSAR
    ZHANG Yan;FENG Dazheng;QU Xiaoning
    J4. 2012, 39(5):  47-53.  doi:10.3969/j.issn.1001-2400.2012.05.009
    Abstract ( 1346 )   PDF (3989KB) ( 894 )   Save
    References | Related Articles | Metrics

    A hybrid phase unwrapping algorithm that combines the branch-cut algorithm and surface-fitting method is proposed to slove the problem of phase wrapping in the Interferometric synthetic aperture radar (InSAR). The algorithm applies different methods in different quality regions to unwrap the phase. It first uses the branch-cut algorithm to unwrap the phases in high quality regions for the benefit of high accuracy, then uses the surface-fitting method to fit the phases in low quality regions and finally, optimizes the coefficients of the surface-fitting function using the gene algorithm to obtain the unwrapped phase. Both simulated and experimental results have shown that the new algorithm can avoid the "isolated island phenomenon" of the branch-cut algorithm and the phase gradient error of the least-mean-square algorithm. The proposed hybrid algorithm is more precise than other methods.

    Wide swath SAR imaging with pulse-phase-codes
    HOU Yuxing;ZHANG Lei;XU Gang;TANG Yu;FENG Dazheng;XING Mengdao
    J4. 2012, 39(5):  54-60.  doi:10.3969/j.issn.1001-2400.2012.05.010
    Abstract ( 1094 )   PDF (922KB) ( 819 )   Save
    References | Related Articles | Metrics

    For traditional monostatic Synthetic Aperture Radar (SAR), the wide swath imaging and cross-range resolution are mutually limited. However, conventional approaches are always to make a trade-off between the both. To overcome the problem, a novel algorithm for resolving range ambiguity is proposed by using the technique of Pulse-phase-codes, in which wide swath imaging could be achieved without the loss of cross-range resolution. In the scheme, the geometric model and linear equation are constructed with modulated initial phases to realize range ambiguity. Meanwhile, high quality of SAR imaging could also be achieved. Besides, the proposed algorithm has the advantages of low system complexity and easy implementation. Experimental results by using simulated data confirm the validation of the proposal.

    Improved PSO-based fast clustering algorithm
    WANG Zonghu;LIU Zhijing;CHEN Donghui
    J4. 2012, 39(5):  61-65+78.  doi:10.3969/j.issn.1001-2400.2012.05.011
    Abstract ( 1415 )   PDF (486KB) ( 941 )   Save
    References | Related Articles | Metrics

    This paper presents an improved particle swarm optimization based fast K-means algorithm which effectively overcomes the shortcomings of the K-means algorithm such as sensitive to initial cluster centroid and easiness to fall into local optimum so as to affect the clustering results. Compared with the existing particle clustering algorithm, is algorithm first normalizes the attributes of all the samples, and then computes the dissimilarity matrix. We propose simplified particle encoding rules and use PSO-based K-means clustering based on the dissimilarity matrix to ensure the basis for the clustering effect and reduce computational complexity. Experimental results on several UCI data sets validate the advantages of the proposed algorithm.

    Fast target localization and the mutual coupling self-calibration algorithm for bistatic MIMO radar
    GUO Yiduo;ZHANG Yongshun;ZHANG Linrang;TONG Ningning
    J4. 2012, 39(5):  66-71+90.  doi:10.3969/j.issn.1001-2400.2012.05.012
    Abstract ( 1029 )   PDF (527KB) ( 845 )   Save
    References | Related Articles | Metrics

    By exploiting the banded symmetric and Toeplitz matrix model for the mutual coupling of uniformly linear array(ULA), an ESPRIT-based target localization and mutual coupling self-calibration algorithm is proposed for bistatic MIMO radar. The 2-dimensional (2-D) angles and mutual coupling parameters can be decoupled by smart choosing of subarrays for the ESPRIT method, and favorable 2-D angle estimation can be provided without the knowledge of the sensor mutual coupling matrix. Based on the estimated 2-D angles, an accurate estimation of the mutual coupling matrix can also be achieved for the self-calibration of bistatic MIMO radar. The 2-D angles estimation and mutual coupling estimation could be completed without any angle-searching and iterative procedure, so its computational burden is low. The correction and efficiency of the proposed algorithm are verified by the computer simulation results.

    SAR imaging algorithm for hypersonic vehicles
    LIU Gaogao;ZHANG Linrang;LIU Nan;LIU Xin;ZHANG Bo;CHEN Guangfeng
    J4. 2012, 39(5):  72-78.  doi:10.3969/j.issn.1001-2400.2012.05.013
    Abstract ( 872 )   PDF (1242KB) ( 745 )   Save
    References | Related Articles | Metrics

    The SAR system on hypersonic vehicles, which is a hot issue of Aeronautics and Astronautics all over the world, faces two significant problems, the coupling of Doppler with range time and the dechirped data imaging in a squint mode. This paper, which incorporates the FMCW SAR geometric model, derives a new de-coupling EFSA. The algorithm can be used to formulate SAR imaging in squint cases without much degradation. Finally, simulated results are given to illustrate the validity of the proposed algorithm.

    Super-resolution imaging of forward-looking scan SAR
    XU Gang;CHEN Qianqian;HOU Yuxing;LI Yachao;XING Mengdao
    J4. 2012, 39(5):  79-84+95.  doi:10.3969/j.issn.1001-2400.2012.05.014
    Abstract ( 1493 )   PDF (2952KB) ( 842 )   Save
    References | Related Articles | Metrics

    A novel algorithm for super-resolution imaging based on the Compressive sensing theory for forward-looking SAR is proposed. Azimuth resolution is achieved by laying the practical linear array in a Multiple-Input and Multiple-Output mode. A narrow radiation pattern could be obtained using the beam-form technique to observe the small scene, which provides the sparsity prior of the SAR image. Then regularization is constructed by exploiting the sparsity prior and super-resolution could be realized by solving the optimization. Enhanced imaging resolution could be captured with a limited length of array, lowing the cost and complexity of the system. Numeric simulation results confirm the validation of the proposed algorithm.

    Realization of PSK using a microwave phase shifter
    CHEN Jie;HUANG Youhuo;BAI Xiaoping;LIU Weixing
    J4. 2012, 39(5):  85-90.  doi:10.3969/j.issn.1001-2400.2012.05.015
    Abstract ( 1088 )   PDF (552KB) ( 988 )   Save
    References | Related Articles | Metrics

    The new realization of PSK using a digital microwave phase system is presented. A microwave phase shifter controlled by FPGA is used to shift the phase of the radio carrier wave to finish PSK modulation. The new design can realize 2, 4, 8, 16, 32 or 64 PSK modulations. When the new design is used in an antenna array system, only one phase shifter is needed to finish both PSK modulation and beam-forming. Tests of the wireless transmitter that is fabricated according to the new design show that the phase shifting error is lower than 1.2° and the BER is lower than 10-5, which leads to the BER level of the common PSK realization of orthogonal modulation. The new design does not need an orthogonal modulator and a mixer which are necessary in the common PSK realization of orthogonal modulation, thus simplifying the system and reducing its cost.

    Radar absorbing material applied to the RCS reduction of array antennas
    WANG Fuwei;GONG Shuxi;ZHANG Pengfei;HONG Tao;YU Songtao;MA Ji
    J4. 2012, 39(5):  91-95.  doi:10.3969/j.issn.1001-2400.2012.05.016
    Abstract ( 1068 )   PDF (1584KB) ( 915 )   Save
    References | Related Articles | Metrics

    The radiation performance of an antenna must be ensured when reducing the antenna radar cross section (RCS), which makes it difficult to control the in-band RCS. For this reason, this paper presents a radar absorbing material (RAM) applied to reduce the in-band RCS of the array antenna. The structure of the RAS is based on the square patch structure loaded with lumped resistances. An array with four patch elements is designed, and the RAM is located between two adjacent patch elements. Simulated and measured results show that the radiation performance of the array antenna is preserved when RAS is used. At the working frequency the RCS of an array antenna with RAM can be reduced more than 9dB by this method.

    Classification method for multimodal data-class dependent ELDA
    REN Huorong;LI Chunxiao;SUN Jianwei;QIN Hongbo;HE Peipei;GAO Min
    J4. 2012, 39(5):  96-101+167.  doi:10.3969/j.issn.1001-2400.2012.05.017
    Abstract ( 1258 )   PDF (2084KB) ( 839 )   Save
    References | Related Articles | Metrics

    Multimodal data refer to the data of a class that can be divided into two or more clusters. This paper proposes an improved method which is called the class-dependent and enhanced method. Enhanced LDA is combined with class-dependent LDA (CDLDA) to classify the multimodal data. In the new algorithm, we first use Enhanced LDA to reduce the dimensionality of multimodal data without losing the local structure and then get a projection matrix for each data class to obtain the characteristic differences for different data class distribution by the maximum scatter difference discriminant analysis criterion. Experiments on the face databases show the encouraging recognition performance of the proposed algorithm.

    Reconstruction of three-dimensional information in an integral imaging system
    YANG Dingding;WANG Xiaorui;YANG Chen;XIANG Jianyong;ZHANG Fangfang
    J4. 2012, 39(5):  102-106+153.  doi:10.3969/j.issn.1001-2400.2012.05.018
    Abstract ( 1059 )   PDF (2171KB) ( 1016 )   Save
    References | Related Articles | Metrics

    Computational reconstruction of integral imaging is an important research on three-dimensional image visualization and stereoscopic display. In this paper, according to integral imaging mechanisms, we propose a new points pairs based stereo matching algorithm for element images on the basis of stereoscopic vision theory, which can be used to accurately determine the mapping relationship between the pixels in the element images and the reconstructed voxel points, and the three-dimensional integral image reconstruction results are implemented. Further, we propose a figure of merit consistent with the human visual system, which can perform the quantitative analysis of the impact of different parameters on the reconstruction results.

    Feature selection in conditional random fields using a membrane particle swarm optimizer
    DOU Zengfa;GAO Lin
    J4. 2012, 39(5):  107-112.  doi:10.3969/j.issn.1001-2400.2012.05.019
    Abstract ( 925 )   PDF (493KB) ( 790 )   Save
    References | Related Articles | Metrics

    In order to delete redundant features in conditional random fields to recognize the gene name from literature, a novel particle swarm optimizer based on the membrane system for feature selection is proposed. In this new algorithm, the particle swarm optimizer is assigned to all sub-regions as sub-algorithms using hierarchy and message mechanism of the membrane system. Based on the structure of the membrane system, the original particle swarm optimizer is disassembled into two parts, the local optimizer and the global optimizer. The local optimizer is assigned to the all outer regions to search for the local best solution and the global optimizer is assigned to the innermost region to search for the global best solution. All outer regions send its best solution to its adjacent inner region and send its worst solution to its adjacent outer region, and the innermost region only sends its worst solution to its adjacent region. When the communication between regions stops in a specific duration or iteration reaches limit times, the iteration is stopped and gets the best solution in the innermost region as the output of the algorithm. We use the maximum log likelihood estimation function of conditional random fields as the objective function, calculate weights of all feature functions by the membrane particle swarm optimizer, and delete those feature functions with a smaller weight than a specific value. Experiment results show that selecting feature functions in conditional random fields by the algorithm we proposed to recognize the gene name from literature can reduce interference produced by redundant features and improve the accuracy of conditional random fields.

    Mode dependent H predictive control of networked control systems under variable-period sampling
    YU Shuiqing;LI Junmin
    J4. 2012, 39(5):  113-118+180.  doi:10.3969/j.issn.1001-2400.2012.05.020
    Abstract ( 792 )   PDF (455KB) ( 795 )   Save
    References | Related Articles | Metrics

    An H predictive control problem is investigated for a class of networked control systems with random delays and disturbances. Applying the variable-period sampling method, the networked control system is discretized and modeled as a Markovian jump linear system with partly unknown transition probabilities. By using the one-step cost function, sufficient conditions are presented to guarantee asymptotical stability and an upper bound of the performance index for the closed-loop system. The design procedure for the state feedback controller is also derived based on the linear matrix inequality method. Finally, an example is presented to illustrate the effectiveness of the proposed method.

    Non-fragile synchronization algorithm for complex time-varying dynamical networks
    LI Junmin;CAO Mengtao;SHEN Si
    J4. 2012, 39(5):  119-125+185.  doi:10.3969/j.issn.1001-2400.2012.05.021
    Abstract ( 1086 )   PDF (554KB) ( 859 )   Save
    References | Related Articles | Metrics

    A non-fragile synchronization approach is proposed for a time-varying complex dynamical network via state feedback control. Under the assumptions that uncertainty of the weight matrix of the complex network is bounded and the norm of the perturbation of internal coupled matrix is bounded, the additive and product non-fragile feedback control algorithms are designed and the sufficient conditions for the synchronization of the complex dynamical network are presented in terms of LMIs, respectively. An example is given to show the effectiveness of the algorithm.

    Adaptive resource allocation scheme for MBSFN transmission in LTE
    ZHANG Tiankui;JIANG Aoxue;FENG Chunyan
    J4. 2012, 39(5):  126-131+191.  doi:10.3969/j.issn.1001-2400.2012.05.022
    Abstract ( 1114 )   PDF (631KB) ( 899 )   Save
    References | Related Articles | Metrics

    In the LTE systems, the multicast and broadcast single frequency network (MBSFN) transmission mode is defined for multimedia services. An adaptive resource allocation scheme for LTE systems with MBSFN transmission mode is proposed, in which the sub-frame is allocated according to the required radio resource of multicast traffic and the channel condition. In each resource allocation interval, the sub-frame ratio required by the multicast traffic is estimated and then a single plus interference and noise ratio threshold is given based on the estimated sub-frame ratio; the sub-frame is allocated adaptively to the multicast traffic or the unicast traffic based on the threshold decision and the allocated resource of the multicast traffic as well. Simulation results show that the proposed scheme can guarantee the data rate of the multicast traffic and improve the throughput of the unicast traffic, so the radio resource utility of the system is optimised.

    Fast level set partition algorithm without setting thresholds
    WANG Yunfei;BI Duyan
    J4. 2012, 39(5):  132-139+196.  doi:10.3969/j.issn.1001-2400.2012.05.023
    Abstract ( 787 )   PDF (6503KB) ( 823 )   Save
    References | Related Articles | Metrics

    In the application of image segmentation based on Shi's fast level set algorithm, there exist difficulties of setting thresholds,so a new approach is presented. In this new approach, the process of curve evolution can be seen as the pattern classification for the points of the curve constantly, so that the external velocity function for controlling curve evolution is redesigned,Both of the Bayesian classification rule and the Minimal distance classification rule are introduced by this new algorithm to work alternatively, in order to obtain the driving force of the external velocity acquired from image data indirectly, and therefore, the driving force does not come from thresholds anymore which are used for partitioning the image data, and the invalidation conditions for both of the classification rules are set as the iteration stop conditions in our new algorithm. Simulation experiments show that the new partition algorithm is not only more robust,which could evolve automatically by itself being adaptive to the image intensity information, but also has stronger anti-noise capability under the effect of noise; in the aspect of speed, it also executes much faster than several existing level set algorithms.

    Range-free three-dimensional node location algorithm for the wireless sensor network
    JIANG Yusheng;FENG Yanhao;GUAN Fang;LI Ping
    J4. 2012, 39(5):  140-147.  doi:10.3969/j.issn.1001-2400.2012.05.024
    Abstract ( 1119 )   PDF (954KB) ( 836 )   Save
    References | Related Articles | Metrics

    The paper employs the thoughts of distance vector hop and average hop distance of the DV-hop location algorithm,based on principles of geometry,and a position estimation deviation is introduced to conduct the weighted centroid algorithm, leading to a novel range-free three-dimensional (3D) localization scheme. Both the principles and implementation steps of the algorithm are given. Simulation results indicate that almost all nodes could be located and that the location accuracy will be within 0.4 in the set of three-dimensional space with 40 randomly scattered anchor nodes, while the communication cost remains reasonable compared with the 2D algorithm.

    Conditional diagnosability algorithm for hypercube under the PMC model
    ZHANG Liguo;DU Huimin;HAN Jungang
    J4. 2012, 39(5):  148-153.  doi:10.3969/j.issn.1001-2400.2012.05.025
    Abstract ( 845 )   PDF (560KB) ( 865 )   Save
    References | Related Articles | Metrics

    Diagnosis has played an important role in the reliability of the interconnection network. Conditional diagnosability is the method that assumes that none of the neighbors of any vertex in the system are faulty at the same time. This diagnosis method greatly enhances the effectiveness of the diagnosis. A conditional diagnosability algorithm for the hypercube based on the PMC model is proposed in the paper. The nodes of the hypercube are divided into several sets through the diagnosis result between two adjacent nodes, and faulty sets and fault-free sets are identified through the realation among sets and the number of elements in the set. The conditional diagnosability of faulty nodes can be effectively implemented when the number of the faulty nodes do not exceed 4(n-2)+1(n≥5). The time complexity of the algorithm is O(N2)for the n-dimensional hypercube with N nodes.

    Quasi-monte-carlo merging resampling particle filter for passive location
    LIU Xue;JIAO Shuhong;LAN Xiaoyu
    J4. 2012, 39(5):  154-160.  doi:10.3969/j.issn.1001-2400.2012.05.026
    Abstract ( 849 )   PDF (576KB) ( 807 )   Save
    References | Related Articles | Metrics

    To meet the requirements of high location speed and accuracy in the air-borne passive location, a quasi-monte-carlo merging resampling particle filter is proposed. Firstly, the particle merging technique based on particles' spatial similarity is used to keep rational distribution and restrain the weight degeneracy problem of the particles. Secondly, the deterministic samples are chosen according to the quasi-monte-carlo integration technique to push the particles into the high likelihood area and explore the state space more efficiently, so that the integration error is reduced and the precision of the filter is improved. Finally, simulation results show that the efficiency of the filter is improved while the precision is quaranteed compared with the quasi-monte-carlo gaussian particle filter.

    Multi-disciplinary design method for the matched response surface based on the hybrid neural network
    LIU Daohua;WANG Shuli;XUE Rui
    J4. 2012, 39(5):  161-167.  doi:10.3969/j.issn.1001-2400.2012.05.027
    Abstract ( 803 )   PDF (617KB) ( 779 )   Save
    References | Related Articles | Metrics

    In order to improve the solving performance of Multi-disciplinary design optimization (MDO), a multi-disciplinary design method for the matched response surface based on the hybrid neural network is proposed. By combining the advantages of the back-propagation (BP) network with the adaptive resonance theory (ART) network and making full use of the target results sample through discipline-level optimization to adaptively change the traditional response surface structure, the proposed method improves the accuracy of the response surface and reduces the number of times of iteration of the discipline-level optimization, which leads to a better solving efficiency for the multi-disciplinary optimization methods. The optimization method is validated by a specific example. Comparison studies in terms of solving accuracy, discipline optimization times, average number of times of iteration and iterative occupancy hours of obtaining the optimization solution indicate that the method for the multi-disciplinary design  of the matched response surface based on the hybrid neural network has a few advantages such as higher solution accuracy and higher computational efficiency.

    Real-time object tracking system on the FPGAs
    LIU Su;SUN Weifeng;WANG Hongjun
    J4. 2012, 39(5):  168-173.  doi:10.3969/j.issn.1001-2400.2012.05.028
    Abstract ( 1239 )   PDF (1224KB) ( 948 )   Save
    References | Related Articles | Metrics

    Object tracking is an important task in computer vision applications. One of the crucial challenges is the real-time speed requirement. In this paper we implement an object tracking system in reconfigurable hardware using an efficient parallel architecture. In our implementation, we adopt a background subtraction based algorithm. The designed object tracker exploits hardware parallelism to achieve a high system speed. We also propose a dual object region search technique for further boosting the performance of our system under complex tracking conditions. For our hardware implementation we use the Altera Stratix III EP3SL340H1152C2 FPGA device. We compare the proposed FPGA-based implementation with the software implementation running on a 2.2GHz processor. It has been observed that the speed can be increased by more than 100 times for complex video inputs.

    Fuzzy threshold coalescence memory algorithm for embedded real-time multimedia systems
    JIANG Yan;ZENG Xuewen;SUN Peng;ZHU Xiaoyong
    J4. 2012, 39(5):  174-180.  doi:10.3969/j.issn.1001-2400.2012.05.029
    Abstract ( 1035 )   PDF (623KB) ( 912 )   Save
    References | Related Articles | Metrics

    In order to raise the memory management efficiency in real-time embedded multimedia systems, a fuzzy threshold coalescence memory algorithm based on TLSF (Two-Level Segregate Fit) is proposed. This algorithm employs fuzzy rules combined with the probability of free memory regions and statistics of free memory blocks in every region to obtain the coalescence coefficient, which is compared with dynamic threshold adjusted by memory fragmentation to decide whether the coalescence needs to be postponed. Experimental results show that the performance of this algorithm is similar to that of TLSF when the allocated memory size is random, but allocation and release efficiencies are increased by 12.6% and 9.5%, respectively, in a real video on the demand system, by adopting this algorithm in an embedded system.

    Phase quantum and its application between periodic signals
    ZHANG Xueping;ZHOU Wei;LI Zhiqi;MIAO Miao
    J4. 2012, 39(5):  181-185.  doi:10.3969/j.issn.1001-2400.2012.05.030
    Abstract ( 1111 )   PDF (532KB) ( 870 )   Save
    References | Related Articles | Metrics

    According to the universal relationship between periodic signals, a basic theory about phase quantum is proposed based on the equivalent phase comparison frequency. Besides the own periodic changes of frequency signals, the base of interactions and relationships between periodic signals is phase quantum, which reveals the key of the universal relationship between the periodic signals. The phase quantum is the necessary one of the periodic signals in the experiment. Measurement comparison and control based on the phase quantum may achieve direct comparison between different frequencies. The application of the phase quantum in the PLL circuit experiment of the active hydrogen maser can simplify its frequency transformation circuits, reduce the noise caused by those circuits and improve its performance.

    CFD modeling of relaxation SiGe RPCVD
    DAI Xianying;ZHENG Ruochuan;GUO Jingjing;ZHANG Heming;HAO Yue;SHAO Chenfeng;JI Y
    J4. 2012, 39(5):  186-191.  doi:10.3969/j.issn.1001-2400.2012.05.031
    Abstract ( 1231 )   PDF (1528KB) ( 857 )   Save
    References | Related Articles | Metrics

    Based on the CVD growth principle of SiGe materials,CFD (Computational Fluid Dynamics) simulation model about kinetics of relaxation SiGe and the corresponding fluid model are built,for the reduced pressure chemical vapor deposition (RPCVD) system. We simulate and analyze the effects of flow, pressure, and rotation speed on the gas density field and the velocity field in the reaction chamber, by using CFD simulation software named Fluent. According to simulation results, when flow is 50L/min, pressure is 2666.44Paand  rotation speed is 35r/min, the uniformity of the flow field above the substrate is the best. We carry out the relaxation SiGe RPCVD experiment under optimized process conditions, and experimental results of SiGe film thickness distribution is consistent with the simulation result about the Fluent concentration distribution of the relaxation SiGe precursor SiH2Cl2, which proves the correctness of our model.

    Compositional verification of a carry-save adder with the propositional projection temporal logic
    ZHANG Nan;DUAN Zhenhua
    J4. 2012, 39(5):  192-196.  doi:10.3969/j.issn.1001-2400.2012.05.032
    Abstract ( 1031 )   PDF (429KB) ( 820 )   Save
    References | Related Articles | Metrics

    To guarantee the correctness of hardware designs, a compositional methodology for hardware verification is proposed. This methodology uses the propositional projection temporal logic(PPTL) as the underlying logic. The hardware designs(implementations) and properties are formalized with PPTL formulas. The design is correct if the specification can be deduced from the system model in the axiom system of the propositional projection temporal logic. An example for a carry-save adder is given to illustrate the methodology is workable.