Loading...
Office

Table of Content

    20 October 2006 Volume 33 Issue 5
      
    Original Articles
    A new approach to ground moving target detection and location based on two-look processing for the single channel SAR system
    ZHOU Feng;LI Zhen-fang;BAO Zheng
    J4. 2006, 33(5):  673-677. 
    Abstract ( 3024 )   PDF (181KB) ( 2199 )   Save
    Related Articles | Metrics

    A new approach to ground moving target detection based on two-look processing is proposed for the single channel SAR system. In the proposed approach, according to the shifts of the Doppler spectra of moving targets relative to that of a stationary scene, the Doppler spectra of echoes are separated into two parts and focused separately to obtain two sub-images; the ground clutter can be suppressed by incoherent subtracting of t1he two sub-images; so the signal-to-clutter-plus-noise ratio(SCNR) can be improved. The procedures for ground moving targets location are as follows: the detected moving target complex signatures are first extracted by a window in the SAR image after clutter suppression, then the ground moving targets can be precisely located through estimating the Doppler spectra shift quantities between the ground moving targets and clutter through which the constant false alarm rate (CFAR) can be decreased simultaneously. The validity of this method is verified by the simulation data and the measured data.

    A baseline estimation method for INSAR based subspace projection
    LIU Ying;LIAO Gui-sheng;MA Lun
    J4. 2006, 33(5):  678-681. 
    Abstract ( 2315 )   PDF (145KB) ( 1045 )   Save
    Related Articles | Metrics

    In the Interferometric SAR, the existence of the baseline error and height error of the satellite will affect the precision of the altitude information transformed from the interferometric phase. A new baseline estimation method for InSAR is proposed in this paper. This method is based on subspace projection and in this method the information about some points on the ground is used. This method needs a little amount of computation and has a high estimation precision. It is highly robust to the unwrapping phase and can restrain the noise well. Its validity is illustrated through computer simulations.

    Image denoising method using wavelet based on the multiscale geometrical directional windows

    LI Wei;YANG Xiao-hui;SHI Guang-ming;JIAO Li-cheng
    J4. 2006, 33(5):  682-686. 
    Abstract ( 2265 )   PDF (188KB) ( 963 )   Save
    Related Articles | Metrics

    The conventional wavelet transform technique is efficient when dealing with 1-D signals. But for 2-D images with abundant geometrical texture information, the standard 2-D separable wavelet transform is not satisfying because of its directional absence. In order to obtain better image representation, we present a novel image de-noising method in terms of the intrinsic geometrical characteristics of images. Based on the principle of the minimal approximation error, we search for geometrical directions in each initialized direction windows, and combine smaller windows with a bigger one according to the regulation of combination. When the best denoising direction is obtained, we project 2-D information on the 1-D along the certain directions and perform 1-D wavelet transform for denoising. The validity and efficiency are shown by experiments.

    An error concealment algorithm based on Newton interpolation in the hybrid field
    ZHANG Jian-long;WU Cheng-ke;SHI Ying-bo;SONG Rui
    J4. 2006, 33(5):  687-690. 
    Abstract ( 1671 )   PDF (63KB) ( 869 )   Save
    Related Articles | Metrics

    An error concealment algorithm for H.264 using Newton interpolation in the hybrid field is presented. Two motion vectors are obtained by interpolation in the spatial field and in the temporal field. A hybrid interpolation model is constructed to get the optimal motion vector of the lost motion vector by setting up a table for interpolation coefficients and judging with boundary match algorithm. Simulation results show that this scheme can highly improve the quality of reconstructed video and obtain a gain of about 0.3~0.8dB in PSNR, compared with Lagrange interpolation in the spatial field under the condition of Packet Loss Rate with 10%.

    Hybrid loss protection method based on the measurement of the effective expected quality for image transmission
    YANG Ya-dong(1;2);WU Cheng-ke(1); XIAO Song(1); DU Jian-chao(1)
    J4. 2006, 33(5):  696-699. 
    Abstract ( 1827 )   PDF (87KB) ( 854 )   Save
    Related Articles | Metrics
    The performance of the existing unequal loss protection system based on the interleaver structure is usually measured by the expected quality without considering the minimum quality requirement. In this paper, a new objective function named the effective expected quality is proposed, which is defined as the received expected quality excluding the contribution from failure transmission, i.e., the quality of the decoded image is below the minimum quality requirement. With this objective function, a new algorithm combining equal and unequal protection strategies based on bidirectional local search is presented to allocate the transmission bit budget between the source and the channel coders to maximize the effective expected quality. Experiments are carried out with the source coders of SPIHT and JPEG2000 and the network model of two-state Markov. Results show that the new algorithm can provide significantly higher effective expected quality and lower probability of failure transmision with lower computational complexity compared to the previous algorithm.
    Study of topology availability in wireless mobile communication networks
    CHEN Yan-hui;KANG Jin; LI Jian-dong
    J4. 2006, 33(5):  700-702. 
    Abstract ( 2037 )   PDF (138KB) ( 921 )   Save
    Related Articles | Metrics
    The impact of coverage radius and movement speed on the linkage and topology is investigated in wireless mobile communication networks. The 2D random walk process is applied to build the random mobility model based on the epoch. The measurement of linkage availability at different epochs is achieved with mathematical derivation. The integrated mobility characteristic of all nodes in the coverage is further studied, resulting in the mathematical expression of the measurement function of topology availability. Numerical simulation shows that the proposed availability measurements are able to represent the effect of node mobility on the linkage and topology.
    A new multiple access protocol for WLAN based on adaptive token passing
    CHEN Dong;LI Jian-dong;LI Wei-ying;SHENG Min;MA Jing
    J4. 2006, 33(5):  703-708. 
    Abstract ( 1823 )   PDF (204KB) ( 804 )   Save
    Related Articles | Metrics

    We develop a new multiple access protocol ATPMAP(Adaptive Token Passing Multiple Access Protocol with fairness guarantee) for WLAN, to improve the performance of the MAC protocol of IEEE 802. 11 DCF(Distributed Coordination Function). In this protocol, token which lead to the reduction of collisions are used to queue the stations. The token passing parameter p is adjusted adaptively according to the fairness of a newtork. The performance of the protocol is analyzed. The saturation throughput bound of the ATPMAP protocol is given. Simulation results have shown that the proposed scheme can improve the performance of the MAC protocol by providing a higher throughput and a lower loss of fairness.

    A MoM calculation of the lowest cutoff frequencies of uniform waveguides by conformal mapping
    ZHU Man-zuo;LIANG Chang-hong
    J4. 2006, 33(5):  709-710. 
    Abstract ( 1671 )   PDF (86KB) ( 1015 )   Save
    Related Articles | Metrics
    A new approach to the computation of the lowest cutoff frequencies of TE and TM models in uniform waveguides is presented, which uses the method of moment(MoM) combined with a conformal mapping. A conformal mapping is applied to transform the waveguides section onto the circle, and the lowest cutoff frequencies is calculated by the MoM. Comparisons with numerical results found in the literature validate the presented method.
    Dynamic analysis of the elastic linkage mechanism based on the artificial neural network
    TUO Yao-fei(1;2);CHEN Jian-jun(1); CHEN Yong-qin(1); ZHANG Chi-jiang(1)
    J4. 2006, 33(5):  711-715. 
    Abstract ( 1836 )   PDF (216KB) ( 869 )   Save
    Related Articles | Metrics
    In accordance with the complexity and time-consuming character of the dynamic analysis of the elastic linkage mechanism, a dynamic analysis model is established based on the BP(Back-propagation) Network. By using the approximate functional relationship between the input parameters and the output parameters given by the trained network, the formula for the sensitivity of the network output parameters is derived. Application of the trained network and the formula to the optimization design and the reliability analysis of elastic linkage mechanism decreases the time for the dynamic analysis obviously and raises the design efficiency effectively.
    A novel distributed algorithm for MAC address assignment in wireless sensor networks
    TIAN Ye;SHENG Min; LI Jian-dong
    J4. 2006, 33(5):  716-720. 
    Abstract ( 2270 )   PDF (65KB) ( 981 )   Save
    Related Articles | Metrics
    This paper presents a novel distributed MAC address assignment algorithm (Virtual Grid Spatial Reusing-VGSR) for wireless sensor networks, which reduces the size of the MAC address efficiently based on both the spatial reuse of MAC address and the mapping of the geographical position. By adjusting the communication range of sensor nodes, the VGSR algorithm can minimize the size of the MAC address and meanwhile guarantee the connectivity of the sensor network. Theoretic analysis and experimental result show that the VGSR algorithm is not only low in energy cost, but also scales well with the network size, with its performance superior to that of other existing algorithms.
    Modeling and simulation of the HCI degradation model for the NMOSFET in deep submicron circuits
    LI Kang; MA Xiao-hua; HAO Yue; CHEN Hai-feng; WANG Jun-ping
    J4. 2006, 33(5):  721-724. 
    Abstract ( 2167 )   PDF (180KB) ( 980 )   Save
    Related Articles | Metrics
    A model of drain current degradation of DSM NMOSFET devices induced by HCI and implementation in circuit reliability simulation is proposed. The model unifies the subthreshold, linear and saturation regions into a continuous equation, which a voids the simulation convergence problem due to the discontinuous model. And the gate bias dependency in the subthreshold region is also modeled for improved accuracy. The model has a high accuracy for SMIC on their 0.25μm technologies. The simulation method in this paper has been applied to the XDRT circuit reliability simulator.
    Optimal design of flexure-based compliant mechanisms based on probability
    CUI Ming-tao; CHEN Jian-jun; MA Xiao-song;TUO Yao-fei
    J4. 2006, 33(5):  725-729. 
    Abstract ( 1925 )   PDF (6KB) ( 802 )   Save
    Related Articles | Metrics
    Considering the randomness of the parameters of planar compliant mechanisms with single-axis flexure hinges, the mean value and variance of displacement amplification, input stiffness, output stiffness and additional restrictions are obtained by Monte Carlo simulation, on the basis of which a mathematical model for the optimal design of the planar flexure-based compliant mechanisms based on probability are built, where the optimal compound performance is taken as the objective function, meeting reliability requirements of each minimum and maximum limits of the design parameters and additional restrictions as constraints. The approach of Lagrange’s multipliers is adopted during optimization. The distribution function method is used to display the reliability constraints in the optimal design model, and then the probability constraints are converted into convention constraints. Displacement amplification and stiffness are calculated according to the optimal design vectors achieved via the optimization design. It is shown that when the variances of parameters increase, the optimal design results are conservative.
    Analysis of reachable workspace of a wire driven parallel robot and its stiffness estimation
    TANG Ao-fei;QIU Yuan-ying;DUAN Bao-yan
    J4. 2006, 33(5):  730-734. 
    Abstract ( 2096 )   PDF (259KB) ( 1012 )   Save
    Related Articles | Metrics
    The feed cable-supporting system of the large radio telescope (LT) can be regarded as a wire driven parallel robot (WDPR). Based on the nonlinear mechanics model of this system, the reachable workspace of the WDPR is confirmed to be subject to the restrictions on the cable tensions, spherical joints, and cable lengths. Furthermore, the static stiffness matrix of the WDPR is established by the finite element analysis to estimate the stiffness characteristics utilizing the minimum eigenvalue of the matrix. Through the kinematic numerical simulation, the stiffness curved surface and the three-dimensional reachable workspace of the 50 meter scaled model of the WDPR are drawn respectively. Results show that the restriction on the cable tensions has the most prominent effect on the reachable workspace, and that the differences of the stiffness characteristics are obvious between the WDPR and Stewart platform.
    Non-blocking supervisory control of a modular class of discrete event systems
    ZHAO Mi; LI Zhi-wu
    J4. 2006, 33(5):  735-738. 
    Abstract ( 1843 )   PDF (169KB) ( 887 )   Save
    Related Articles | Metrics
    We develop a novel deadlock control policy to add monitors to ensure the controllability of elementary siphons of Petri nets, and the controllability of dependent siphons is ensured by properly selecting the control depth variables of elementary siphons, which can be obtained by linear programming techniques. The control policy can model concurrent execution of manufacturing assembly processes in FMS (Flexible Manufacturing Systems) through a class of nets, called the G-system that is a large class of discrete event systems. A relevant property of the system behavior is to be non-blocking, i.e., from any reachable state, a desirable state can be always reached under supervision. Compared with the existing policies, the advantage of ours is that a much smaller number of monitors are added with unnecessary iterative processes avoided.
    Reliability analysis of the deployment mechanism of a large satellite antenna based on the non-probabilistic model
    ZHANG Jian-guo; CHEN Jian-jun; DUAN Bao-yan;HU Tai-bin
    J4. 2006, 33(5):  739-744. 
    Abstract ( 2103 )   PDF (224KB) ( 1054 )   Save
    Related Articles | Metrics
    The deployment principium of a large hoop-truss satellite antenna is studied and the mechanical analysis model and the non-probabilistic reliability model of its deployment mechanism are presented. Synthetically considering the effect of dimension errors and the space environment factors, we treat the mechanism movement as a function of some interval variables, and derive the reliability formula by using optimization. The movement reliability of the mechanism of a large satellite antenna in the whole spreading process is predicted, and the result is compared with that based on the probabilistic model, in which all variables in the movement function are seen as normal distributed random variables. The probabilistic reliability specification is about three times larger than the non-probabilistic one, and the trends of their variation are alike. Both of them agree well with the experiment, which shows that the method of this paper is reasonable and practical.
    Hybrid algorithm based on ant colony optimization in continuous space optimization
    KOU Xiao-li;LIU San-yang
    J4. 2006, 33(5):  745-747. 
    Abstract ( 1713 )   PDF (113KB) ( 906 )   Save
    Related Articles | Metrics
    Based on the properties of the ant colony optmization (ACO) and Alopex algorithm, a hybrid optimization algorithm(ACOAL), in which the Alopex algorithm is embedded in the improved ant colony optimization algorithm, is proposed for searching for continuous space optimization. In the algorithm, the new pheromone updating rule and the searching way in the continuous space and the moving strategy of ants are defined. The algorithm is of the rapid search capability of the improved Alopex algorithm and the good search characteristics of the improved ant colony optimization algorithm, and the convergent speed of the presented algorithm avoiding being trapped in local optimum is improved. Simulation results show that the algorithm is effective.
    The impact of OBS network’s characteristic on TCP performance
    WEN Ai-jun(1);JING Jie(1);LIU Jian-ping(1); ZHANG Wei-dong(2)
    J4. 2006, 33(5):  748-753. 
    Abstract ( 2178 )   PDF (194KB) ( 946 )   Save
    Related Articles | Metrics
    TCP segments are assembled into an OBS burst at the edge of an OBS network. In order to accurately analyze the relationship between assembly delay and TCP throughput, this paper simulates TCP over OBS is simulated focusing on the influence of assembly delay. It is found that there is a threshold of the assembly delay, and only when the delay is larger than the threshold, will the delay severely reduce the TCP throughput; it is also found that when a lost burst contains more than three continuous segments, the TCP sender will surely work overtime. A theoretical analysis of the above process is made, which proves that the simulation is accurate.
    A resource scheduling strategy based on the BD algorithm for MIMO systems
    LI Xiao-hui;YI Ke-chu; LIU Nai-an; TIAN Bin
    J4. 2006, 33(5):  754-758. 
    Abstract ( 1918 )   PDF (169KB) ( 991 )   Save
    Related Articles | Metrics
    A space-time resource scheduling stategy based on the Block Diagonal (BD) algorithm is presented for Multi-Input and Multi-Output systems. The transmission power is allocated by the water-filling algorithm in the space dimension and adjusted dynamically in the time domain, and then the resource allocation is expanded to space-time dimensions. The quality of service for each user is guaranteed, and the number of the users is no longer limited by the number of the transmission antennas. Simulation results show that the modified BD algorithm improves the power efficiency and maintenances the fairness among users.
    Image restoration using the total variation and the anisotropic diffusion equation
    LI Min;FENG Xiang-chu
    J4. 2006, 33(5):  759-762. 
    Abstract ( 2005 )   PDF (142KB) ( 1112 )   Save
    Related Articles | Metrics
    We propose a new model for image restoration, which combines the total variation minization with the “pure” anisotropic diffusion equation of Alvarez L and Morel J M. Due to the introduction of the new diffusion term, this model can not only remove noise but also enhance edges and keep their locality. And it can also keep textures and large-scale fine features that are not characterizaed by edges. Because of these favorable characteristics, not only do the processed images look much clearer and smoother, but also significant details are kept, resulting in appealing vision.
    Application of the decomposing cascade network method for measuring the electro-magnetic parameters of microwave materials
    GUO Li-qiang(1;2); JIAO Yong-chang(1); TANG Jia-ming(1)
    J4. 2006, 33(5):  763-767. 
    Abstract ( 1903 )   PDF (200KB) ( 911 )   Save
    Related Articles | Metrics
    This paper presents one kind of sampler formed by the cascade network with three segments, and discusses the decomposing cascade network method with the linear fraction transformation. By using the odd-even mode method, the electro-magnetic parameters of the material under test are easy to obtain. The method can be used to measure the electro-magnetic parameters of the mushy and powdered materials. Moreover, the measured data of several kinds of material are given. According to the features of different measured objects, techniques for correcting some noticeable error factors are also discussed.
    A window-based multi-rate multicast congestion control algorithm
    ZHANG Bing;LIU Zeng-ji;YUAN Bing
    J4. 2006, 33(5):  768-772. 
    Abstract ( 1668 )   PDF (227KB) ( 892 )   Save
    Related Articles | Metrics
    A window based multi-rate multicast congestion control(WMCC) algorithm is proposed. The sender of a multicast session changes the rate of each layer dynamically and adaptively according to the feedbacks from receivers. Each receiver maintains a congestion window on the base layer and adjusts it based on the binomial algorithm, and from the congestion window an expected rate is calculated. The receiver subscribes to appropriate layers based on its expected rate, thus obtaining a corresponding throughput. Simulations indicate that WMCC is effective in providing a multi-rate multicast congestion control, and shows good TCP-friendliness, smoothness and responsiveness.
    Bayesian face detection algorithm based on skin segmentation
    WEN Jing;GAO Xin-bo
    J4. 2006, 33(5):  773-777. 
    Abstract ( 2177 )   PDF (132KB) ( 2359 )   Save
    Related Articles | Metrics
    In order to build up a fast and effective system for face detection by combining the skin color information with facial features, the paper proposes a Bayesian detection algorithm based on the skin model. There are mainly two steps in our algorithm: skin color detection and facial feature detection. The former models skin regions to the Gaussian Mixture Model and sets up rules for skin detection. Meantime, a new method based on the cluster validity function is proposed to determine the optimal numbers of GMM components so as to improve the precision of detection. To speed up the facial feature detection, a diamond search algorithm is introduced in the Bayesian classifier. Experimental results illustrate the high detection precision and low false alarm of the proposed algorithm. Moreover, it can realize the face detection in real time basically.
    An improved strong proxy signature schemes
    MING Yang; JIANG Zheng-tao; WANG Yu-min
    J4. 2006, 33(5):  778-781. 
    Abstract ( 1593 )   PDF (135KB) ( 837 )   Save
    Related Articles | Metrics
    Based on the revised LKK scheme presented by Lee et al., an improved strong proxy signature scheme is proposed. A method of blindness is used between the original signer and the proxy signer, and the construction of s<sub>A</sub> is improved in the period of delegation. The problem that the original scheme is insecure against the original signer’s forgery attack and the original signer’s changing attack is resolved. Analysis shows that the proposed scheme satisfies all security properties of the strong proxy signature scheme and does not need a secure channel.
    A space-time multiuser detection based on the RLS-LMF algorithm
    ZHENG Lin(1;2);OUYANG Shan(2);QIU Hong-bing(2)
    J4. 2006, 33(5):  782-787. 
    Abstract ( 2599 )   PDF (217KB) ( 911 )   Save
    Related Articles | Metrics
    A code-constrained least mean fourth(LMF) criterion is presented for blind multiuser detection. It is an improved higher-order form of the least mean square(LMS) criterion. Other than the commonly used existing high-order criterion local minima, the LMF is proved to be globally convergent. The Hessian matrix of the objective function is derived and analyzed to prove the global convexity of the LMF. In multipath CDMA channels, the LMF criterion is combined with the recursive least-square method and the RLS-LMF algorithm is further developed to construct a space-time receiver. Simulations show that this novel algorithm outperforms existing techniques in CDMA and ultra-wideband channels.
    Joint nominative proxy signature scheme
    LEI Qiang;WANG Yu-min
    J4. 2006, 33(5):  788-791. 
    Abstract ( 2017 )   PDF (132KB) ( 832 )   Save
    Related Articles | Metrics
    This paper presents a joint nominative proxy signature scheme by combining the methods of nominative proxy signatures and multi-signatures, which can be used to solve the problem of signing on a document by multiple original signers efficiently. Also, an improved scheme is further proposed to protect the proxy’s privacy, and the identity of the proxy signer is hidden behind an alias, with only a trusted registration center revoking his or her identity.
    Token-based single sign-on protocol and its formal analysis
    SHEN Ting;LI Hui;YU Ming-zhe
    J4. 2006, 33(5):  792-796. 
    Abstract ( 1623 )   PDF (165KB) ( 877 )   Save
    Related Articles | Metrics
    A new single sign-on protocol used for the distributed network is proposed to achieve double-way authentication between user application servers. With a service token, identity authentication and service authorization are implemented by an authentication server, and the key is saved in the token which can be used in the verification process. The token not only makes the user that has been authenticated when it enters the network communicate with any application server, and improves the authentication efficiency of the whole network, but also makes the authentication server unnecessarily save the sate of users, and promotes authentication server’s performance. Using the BNA logic, the objective and the security of this protocol are proved by the formal analytical process.
    Application of PSO and GA in beamforming of an array antenna
    LIU Rui-bin;YAN Ze-hong;SUN Cong-wu;ZHANG Xiao-miao;WEI Wen-yuan
    J4. 2006, 33(5):  797-799. 
    Abstract ( 3256 )   PDF (145KB) ( 1237 )   Save
    Related Articles | Metrics
    Particle Swarm Optimization(PSO) and Genetic Algorithms(GA) are applied to the problem of beamshaping of antenna arrays. We use MATLAB to calculate both the line array with ten elements and the circle array with thirty one elements and obtain the desired beam forms. Comparing PSO with GA we can see their advantatges and disadvantages in shaping the beams. We try to use a modified Bernstein polynomial to reduce the number of variables when calculating the circle array. Finally we use PSO to optimize the circle array and obtain a beam form with a flat top which is needed in the practical design.
    Research on computational soundness of formal attacker ability description
    TIAN Hai-bo(1);DING Yong(2);WANG Yu-min(1)
    J4. 2006, 33(5):  800-803. 
    Abstract ( 1637 )   PDF (143KB) ( 854 )   Save
    Related Articles | Metrics
    This paper researches the computational soundness of the ability description about a formal attacker in a formal analytical system when security protocols use only data integrity algorithms. Firstly, the authors assume that a computational attacker is more powerful than a formal attacker. Secondly, an attack experiment is constructed. And thirdly, a contradiction is proved about the output of the computational attack of the attack experiment against the security definitions of signature algorithms and keyed hash functions. So the conclusion is obtained that all the messages created by a computational attacker belong to the message closure which can be created by a formal attacker. Based on the conclusion, one can construct or improve a formal analytical system to make sound computations.
    An access method of integrating WPA and WAPI protocols into the IEEE 802.11b adapter
    DUAN Ning(1;2);MA Jian-feng(1)
    J4. 2006, 33(5):  804-808. 
    Abstract ( 2035 )   PDF (179KB) ( 901 )   Save
    Related Articles | Metrics
    According to the various security access methods applied to WLAN, an approach to integrating WPA and WAPI is presented, which can make wireless terminals able to access WLAN expediently. With the related access information, this approach can recognize the network type, and then adaptively choose the corresponding protocol to access the network.
    Fault analysis for self-shrinking generator
    GAO Jun-tao;HU Yu-pu;LI Xue-lian
    J4. 2006, 33(5):  809-813. 
    Abstract ( 1426 )   PDF (135KB) ( 768 )   Save
    Related Articles | Metrics
    A fault attack on the self-shrinking generator is presented by changing the internal states in the linear feedback shift registers. Besides, a shifts attack on the shrinking generator is described by modifying the control clock. Results show that, for the shrinking generator, the attacker can obtain the secret keys by implementing n=max{n<sub>1</sub>,n<sub>2</sub>}times phase shift attacks, and that for the self-shrinking generator, the attacker can obtain the secret keys by changing the bit values in n registers.
    Optimal transmitter design in MIMO systems under correlated fading channels
    ZHAO Zhen-shan(1);XU Guo-zhi(1);FAN Jing(2)
    J4. 2006, 33(5):  814-818. 
    Abstract ( 1847 )   PDF (174KB) ( 877 )   Save
    Related Articles | Metrics
    We investigate the optimal transmitter design for the single-user multiple-input multiple-output(MIMO) communication system based on the knowledge of the correlation matrix of Rayleigh fading channels. The practical system with correlated receive and correlated transmit antennas is considered in this paper. Furthermore, we assume that the receiver has perfect channel state information, while the transmitter knows only the transmit correlation matrix and receive correlation matrix. The optimality pertains to minimizing an upper bound on the symbol error rate. The optimal transmit directions turn out to be the orthogonal directions along the eigenvectors of the transmit correlation matrix and independent of the receive correlation matrix. However the optimal power allocation scheme is related to both transmit and receive correlation matrix.
    A novel BIST technique for multipliers cores
    LEI Shao-chong;SHAO Zhi-biao;LIANG Feng
    J4. 2006, 33(5):  819-823. 
    Abstract ( 1689 )   PDF (181KB) ( 862 )   Save
    Related Articles | Metrics
    A novel built-in self-test (BIST) scheme for multiplier cores is proposed. The scheme combines the advantages of C-testable and pseudorandom testing, and the designed test circuit imposes small extra hardware, which is less than that of the pseudorandom testing circuit by 56%. In test generation, the proposed method uses the unique assigning technique to achieve a very small test set with fault coverage higher than 99%. The generated test set is reordered and compressed by our developed program, and its switching activities and width are drastically reduced. Based on the above results, a low cost circuit can be easily implemented. Experimental results show that the designed BIST circuits are superior to other BIST circuits in hardware, power consumption and test time.
    Improved compressed edge fragment sampling algorithm
    YAN Qiao(1;2); XIA Shu-tao(2); WU Jian-ping(2)
    J4. 2006, 33(5):  824-828. 
    Abstract ( 1819 )   PDF (177KB) ( 928 )   Save
    Related Articles | Metrics
    A new encoding proposal which improves the compressed edge fragment sampling algorithm of Savage is proposed. In this new proposal, we overload the IP header fields which are correlative with the IP packet fragment to increase marking amounts. Moreover, 64 parity-check bits generated by 2different hash functions are employed to reduce the false positive alarm. Then, we further give some optimization procedures to reduce computational complexity during reconstruction. Finally, the two algorithms, i.e., the compressed edge fragment sampling algorithm of Savage’s(CEFS) and our new proposal named the improved compressed edge fragment sampling algorithm(ICEFS), are compared in three aspects, i.e., the number of packets required for the victim to reconstruct the attack graph, computational complexity, and false positive alarm. The comparing results show that the new proposal ICEFS has much better performance than CEFS. For example the computational complexity during reconstruction of CEFS is m<sup>8</sup> and that of ICEFS is lower than 3m<sup>2</sup>(where m is the number of attackers at the particular distance). When there are only 20 attackers at the same distance, the false positive rate of CEFS is nearly 0.99. When there are 1000 attackers at the same distance, the false positive rate of ICEFS is still about zero. So ICEFS can be used in tracking large scale DDoS attacks.
    Normal Filters of pseudo MTL-algebras (WPBL-algebras)
    ZHANG Xiao-hong(1); LIU San-yang(2); LIU Yong-lin(2)
    J4. 2006, 33(5):  829-832. 
    Abstract ( 1736 )   PDF (192KB) ( 902 )   Save
    Related Articles | Metrics
    Pseudo MTL-algebra (or psMTL-algebra, WPBL-algebra) is a new class of algebra system as an algebraic counterpart of the non-commutative fuzzy logic system psMTL. The aim of this paper is to investigate the filter theory of pseudo MTL-algebra. Some new properties of pseudo MTL-algebra are given, and an important counterexample is constructed to show that the sufficient and necessary condition for the normal filter in pseudo BL-algebra is not true in pseudo MTL-algebra. A new equivalent condition for the normal filter in pseudo MTL-algebra is established. Moreover, by these results, quotient algebra of pseudo MTL-algebra is built.
    Research on combining radar emitter recognition with a priori knowledge
    GAI Ming-jiu(1); GUAN Xin(2); YI Xiao(2); SHI Bao(1)
    J4. 2006, 33(5):  833-837. 
    Abstract ( 1860 )   PDF (162KB) ( 860 )   Save
    Related Articles | Metrics
    Based on the concept of the concordance existing between the measurement evidences and the prior knowledge, and on the conditioning Dempster-Shafer evidence theory, this paper provides a novel radar emitter recognition approach which reflects the influences of prior knowledge. The first step for this approach is to change the measurements on the radar emitter into the form of bodies of D-S evidence by the application of gray correlation analysis. Furthermore, we apply the conditioning D-S evidence theory to combine these evidences, and calculate the concordance. This method can help us to increase the reliability of radar emitter recognition under complex battle circumstances.