Loading...
Office

Table of Content

    20 June 2008 Volume 35 Issue 3
      
    Original Articles
    Adaptive joint equalization for MB-OFDM UWB systems
    ZHAO Li;SUN Xian-pu;ZHANG Hai-lin
    J4. 2008, 35(3):  377-382. 
    Abstract ( 2272 )   PDF (752KB) ( 1143 )   Save
    Related Articles | Metrics
    An adaptive joint equalization (AJE) scheme for the muti-band OFDM ultra wideband (MB-OFDM UWB) system is proposed. For received diversity signals, the scheme can provide optimum combining (MMSE criterion) with an adaptive filter. Different from conventional optimum combining schemes, this scheme does not need channel parameters. Therefore, the corresponding computation and error caused by channel estimation are avoided. The scheme is implemented using the optimal linear combining normalized least mean squares (OLC-NLMS) algorithm. To deal with the high correlations of inputs, the characteristic of slow fading of UWB channels is applied to the algorithm, which leads to a high convergence rate. Simulation results show that compared with conventional optimum combining scheme, this scheme can result in the gain of1.2dB and2.7dB for two diversity branches and four diversity branches respectively at the 10-2 BER (bit error rate).
    Numerical analysis of the two-pump fiber optical parametric amplifier based on the triangular photonic crystal fiber
    SHANG Tao1;LI Feng1;WEN Ai-jun1;LIU Zeng-ji1;CHEN Jian-ping2
    J4. 2008, 35(3):  383-387. 
    Abstract ( 1739 )   PDF (555KB) ( 942 )   Save
    Related Articles | Metrics
    Due to the PCF high nonlinearity and low dispersion slope, in order to obtain high flattened gain over a wide bandwidth of two-pump fiber-optic parametric amplifiers (2P-FOPA) based on the triangular photonic crystal fiber (PCF), the shifted and scaled fourth-order Chebyshev polynomial is presented. Using the above polynomial gain ripple characteristic, expressions for the gain and bandwidth are derived, and numerical simulations are performed. A comparison of its performance with that of FOPAs based on the dispersion-shifted fiber (DSF) is also made. It is shown that less than±0.5dB gain flatness can be obtained over the80nm bandwidth by the 2P-FOPAs based on the triangular photonic crystal fiber. Finally, a PCF-based fiber optic parametric amplifier to reduce the influence of stimulated Raman scattering (SRS) is designed.
    Study of a scheduling algorithm based on simple network coding in broadband wireless access networks
    SHI Yan;SHENG Min
    J4. 2008, 35(3):  388-394. 
    Abstract ( 1999 )   PDF (704KB) ( 1017 )   Save
    Related Articles | Metrics
    For the purpose of supporting real-time services in broadband wireless access networks, a scheduling algorithm based on simple network coding, DSNC, is presented. With the newly introduced delivery state parameter, DSNC selectively combines retransmission packets into an innovative one by only XOR operation. Not only can DSNC reach the upper band of the network throughput defined by the maximum flow-minimum cut theorem, but receivers are able to recover original packets immediately upon successful packet receptions, which greatly lowers the system requirements for the processor speed, memory capacity and power consumption at mobile nodes. Integrated with the simple network encoding, the queue-delay-based scheduling scheme of DSNC is capable of providing packets with better delay and jitter performance while maintaining the maximal network throughput. Simulation results indicate that DSNC can nearly reach that throughput superior limit, and the average packet end-to-end delay and jitter decrease 11% and 19%, respectively, compared with other algorithms, which makes it much applicable to broadband real-time services.
    Novel transmission method for H.264/AVC video data over wireless OFDM channels

    MA Yan-zhuo1;CHANG Yi-lin1;YAO Jun2
    J4. 2008, 35(3):  395-402. 
    Abstract ( 2142 )   PDF (837KB) ( 1012 )   Save
    Related Articles | Metrics
    A novel three-dimension data interleaving method is proposed for video data transmission over wireless OFDM channels, where the three-dimensional interleaving includes interleavings in the spatial domain, frequency domain and temporal domain. The interleaving in the spatial domain is to uniformly disperse the burst bit-errors over the picture area. The frequency domain interleaving is to transmit adjacent slices over spaced sub-channels, which facilitates temporal or spatial error concealment. Temporal interleaving is to transport different slices in one OFDM sub-carrier in changed time intervals. It can provide credible reference picture for inter-frame prediction coding, and thus the error propagation over frames can be avoided, and the error concealment can be exploited too. System integrating the three-dimension data interleaving method with the multi-reference picture selection (RPS) and error concealment can efficiently improve the quality of the reconstructed video transmitted over wireless OFDM channels. Simulation results show that the proposed method can increase the PSNR of reconstructed video transmitted over OFDM wireless channels by over 4dB under different channel conditions.
    Novel scheme for the wide band ground-air communication system

    FEI Man-feng1;2;WANG Jie-ling1;YI Ke-chu1;LIU Zu-jun1
    J4. 2008, 35(3):  403-408. 
    Abstract ( 2096 )   PDF (679KB) ( 1000 )   Save
    Related Articles | Metrics
    For a wide band ground-air communication system with a low elevation antenna, the channel is of severe multi-path fading, whereas its characteristic is quite different from that of a terrestrial mobile communication channel. In this case, the OFDM technique is considered to be unsuitable, so that a channel model is established and a new scheme based on orthogonal code division multiplexing (OCDM)combined with block coding is proposed. Theoretical analysis and simulation results show that the proposed system can suffer so great a multi-path delay up to dozens of symbol periods, and has very good BER performance even when the Rice fading factor reaches6~7dB. The system can obtain as high a band efficiency as a non-spectrum-spreading system since it realizes OCDM based on M-ary spectrum spreading of multi-level PN codes. Compared with a corresponding OFDM system, it has better adapting capability to dynamic variation of the channel because of its shorter symbol period. Besides, it has low implementation complexity since channel estimation or equalization is not necessary. It has a good potential in wide band ground-air communication applications.
    Frame service delay analysis of IEEE 802.11 MAC protocol and its application in congestion control
    YUE Peng;WEN Ai-jun;ZHAO Rui-qin;LIU Zeng-ji
    J4. 2008, 35(3):  409-415. 
    Abstract ( 1739 )   PDF (766KB) ( 974 )   Save
    Related Articles | Metrics
    For the problem that a traditional congestion signal such as the average length of a queue cannot indicate network congestion effectively in the ad hoc network, an analysis has been made of the frame service delay(FSD) of IEEE 802.11 MAC protocol, and the relation between the average FSD and the average length of the frame, the collision probability, and the number of saturated stations. Analytical results show that FSD increases sharply with the increase in transmission probability or the number of saturated stations if the transmitting probability of stations is larger than the critical one, and that FSD has a high sensitivity to the link congestion. Finally, the effectiveness of FSD as the congestion signal is validated by simulation. Compared with the average length of the queue, FSD can indicate network congestion more effectively. Together with TCP, the use of FSD as the congestion signal can prominently improve the throughput of TCP connection and decrease the ratio of packet loss.
    Efficient method for two-dimensional frequency estimation
    NIE Wei-ke;FENG Da-zheng
    J4. 2008, 35(3):  416-420. 
    Abstract ( 2041 )   PDF (596KB) ( 1092 )   Save
    Related Articles | Metrics
    This paper proposes a tri-iteration algorithm (TIA) to estimate the two-dimensional(2-D) frequency embedded in additive Gaussian white noise. By exploiting the rotational invariance property of the 2-D data matrix, we established four matrices which possess a diagonal structure. Moreover, we expanded the data matrix in the temporal domain and derived a set of diagonal structure matrices. Consequently the 2-D frequency are estimated by accomplishing the joint diagonalization of the group of data matrices. It is worth mentioning that the estimated 2-D frequency can be paired automatically. The proposed algorithm eliminates the error propagation of the multistage decomposition algorithm because each iteration poses a typical least square problem with a unique closed solution. Hence the estimation accuracy is increased. A comparison of the performance of TIA to that of CRB demonstrates its effectiveness.
    Efficient robust STAP GMTI algorithm FAGATA
    LIU Cong-feng;LIAO Gui-sheng
    J4. 2008, 35(3):  421-426. 
    Abstract ( 1908 )   PDF (930KB) ( 1024 )   Save
    Related Articles | Metrics
    For the FRACTA algorithm and its enhancements which are used for ground moving targets detection by the airbore or spaceborne STAP radar in the non-homogenous clutter, jammer, and dense target clusters, a new improved algorithm: FAGATA is proposed. It only requires one-time reiterative censoring via multi-global outlier censoring algorithms, and also reduces the original three detection levels to two levels by two weight adaptive power residue tests, and therefore, the computational efficiency is improved greatly. It not only detects the targets and estimates the parameters accurately, but also has a higher detection efficiency and robustness. The simulation attests its correctness and effectiveness.
    FPGA implementation of a high-throughput memory-efficient LDPC decoder
    ZHANG Gui-hua1;ZHANG Shan-xu2;LI Ying2
    J4. 2008, 35(3):  427-432. 
    Abstract ( 1931 )   PDF (712KB) ( 1021 )   Save
    Related Articles | Metrics
    Based on the Turbo-decoding algorithm, a high-throughput memory-efficient decoder is proposed for a class of regular (r, c)-LDPC (low-density parity-check) codes. Compared to the traditional sum-product decoding algorithm, the Turbo-decoding algorithm decodes several packets in parallel, each of which is decoded by a parallel structure, resulting in faster convergence behavior and fewer memories. To decode a packet with a parallel structure, the LDC code is first divided into several super-codes. Then, each super-code is decoded by the parallel BCJR algorithm. To further simplify the inter-structure and the complexity, a modified coset algorithm is also proposed. An FPGA chip containing 15 parallel decoders for a regular (r, c)-LDPC code of length1600 has been developed based on the Altera Stratix EP1S25 FPGA device, which decodes 3 packets in parallel and can achieve a throughput of50Mbit/s with 20 decoding iterations.
    Image fusion algorithm using the Contourlet HMT model
    LIU Zhan-wen;JIAO Li-cheng;JIN Hai-yan;SHA Yu-heng;YANG Shu-yuan
    J4. 2008, 35(3):  433-438. 
    Abstract ( 1875 )   PDF (1115KB) ( 956 )   Save
    Related Articles | Metrics
    To overcome the limitation of the wavelet domain hidden Markov tree (HMT) in computational speed and sparse direction, a novel image fusion algorithm using the contourlet HMT model is presented. After the Contourlet transform on the images, the low-frequency subbands are compared to preserve the coefficients whose module are minimum, and local inner-product are performed on the new high-frequency directional subbands which are acquired from the product by the high-frequency directional coefficients and the edge probability density function which is acquired from the contourlet HMT model training on the images. Then the fusion image can be obtained by taking an inverse Contourlet transform. Because the dependence tree in the contourlet HMT can span several adjacent directions in the finer scales and inter-direction dependencies are modeled in a similar way as inter-location dependencies, this method can improve modeling precision and reduce computational complexity (reduce the number of parameters). Experimental results show that when compared with the Contourlet and wavelet HMT, our proposed method can get more accurate and smooth fusion images, and a remarkable improvement over wavelet HMT about standard deviation, average gradient and average cross entropy. Moreover, the training speed of the Contourlet HMT is reduced to1/15 that of the wavelet HMT, and more important, some images such as the “medicine” and “office” images which are difficult to process using the wavelet domain HMT can be fused quickly using the contourlet domain HMT.
    Orthogonal neighborhood preserving embedding algorithm for face recognition
    TAO Xiao-yan;JI Hong-bing;JING Zhi-hong
    J4. 2008, 35(3):  439-443. 
    Abstract ( 1935 )   PDF (836KB) ( 1299 )   Save
    Related Articles | Metrics
    Based on the Neighborhood Preserving Embedding (NPE) algorithm, a novel dimensionality reduction method called ONPE is proposed. First, a function which reflects the locality preserving power of the projective vectors is defined. Then, with the neighborhood preserving function as the objective function and the orthogonal constrained conditions added to the original optimal problem, the iterative formulae for finding a set of orthogonal optimal projection vectors are deduced. Compared with the NPE algorithm, the orthogonal vectors have the better locality preserving power, and thus the stronger discriminant power can be obtained and the error rate reduced. Experimental results on the standard face databases illustrate that in comparison with the other dimensionality reduction methods, the lowest error rate of the new method can be reduced by 15%~20% and can be achieved when the number of the selected features is comparatively small.
    Unsupervised image segmentation using an immune antibody competitive network
    HUANG Wen-long1;JIAO Li-cheng1;JIA Jian1;2
    J4. 2008, 35(3):  444-448. 
    Abstract ( 1589 )   PDF (1151KB) ( 1002 )   Save
    Related Articles | Metrics
    This paper proposes a fully unsupervised image segmentation algorithm by using a novel structural adaptation artificial immune antibody competitive network without a predefined number of clustering. Based on the basic conception of self organizing feature map, a new immune antibody neighborhood is presented to enhance the robustness of the network, and inspired by the long-term memory in cerebral cortices, a long-term memory coefficient is introduced into the network to improve the convergence speed of the algorithm, and three death operations are presented to eliminate those antibody droves by noise antigen. With above advanced methods, the model can adaptively map input data into the antibody output space, which has a better adaptive net structure. This approach is applied to segment a variety of images into homogeneous regions, including synthetic texture images, remote images and SAR images, and experimental results illustrate the effectiveness of the proposed novel algorithm.
    Fast public-key encryption scheme based on the Chinese remainder theorem
    WANG Bao-cang1;WEI Yong-zhuang1;2;HU Yu-pu1
    J4. 2008, 35(3):  449-454. 
    Abstract ( 2228 )   PDF (570KB) ( 1444 )   Save
    Related Articles | Metrics
    Traditional public key cryptosystems suffer from a drawback that the encryption/decryption speed is relatively low, which hampers their applications in resource-constrained environments. A fast public-key cryptosystem is proposed to remedy this drawback. The new algorithm uses the Chinese remainder theorem to hide the trapdoor information. The encryption of the system only carries out several modular multiplication operations, and the decryption only needs a modular multiplication and a low-dimensional matrix-vector multiplication, which makes the speed of the encryption and the decryption of the scheme very high. The security of the system is based on two number-theoretic hard problems. The attacker has to solve the integer factorization problem and the simultaneous Diophantine approximation problem simultaneously to recover the secret key from the public key. The proposed cryptosystem is also shown to be secure against the lattice attack. Analysis shows that the encryption algorithm is a secure, fast and efficient public key cryptosystem.
    Impossible differential attack on the 17-round block cipher SMS4
    CHEN Jie;HU Yu-pu;ZHANG Yue-yu
    J4. 2008, 35(3):  455-458. 
    Abstract ( 2139 )   PDF (481KB) ( 1065 )   Save
    Related Articles | Metrics
    The SMS4 is the first commercial block cipher published by our government in 2006. By analyzing the changes of the difference between input and output pairs in each round, this paper first presents an impossible differential property for the 14-round SMS4 if the difference of the input plaintext pair is (a, a, a, 0), it is impossible that the difference of 14-round output pair is (a, a, a, 0). Based on this property, a new method is proposed for cryptanalyzing the 17-round SMS4, which is to add two rounds and one round to each end of the impossible differential cryptanalysis for the 14-round SMS4. This attack on the reduced 17-round SMS4 requires about 2<sup>103</sup> chosen plaintexts, performs 2<sup>124</sup> 17-round SMS4 encryptions, and demands 2<sup>89</sup> words of memory. Furthermore, the probability of its failure to recover the secret key is only 2<sup>-88.7</sup>.
    Performance of non-binary concatenated coded OFDM systems
    WU Xiao-li1;2;GE Jian-hua1;WANG Yong1
    J4. 2008, 35(3):  459-463. 
    Abstract ( 1668 )   PDF (593KB) ( 934 )   Save
    Related Articles | Metrics
    A new concatenated code structure is proposed which concatenates a space-time block codes with non binary low density parity check (LDPC) codes, which is high-level modulated without any parallel-to-serial conversion to lower the error and simplify the system structure. The performance of the new system in Bit error rate (BER) and complexity is evaluated, its comparisons are made with the binary LDPC concatenated codes OFDM system by simulation in AWGN channels and multiple Raleigh fading channels. Results show that the new system is superior to the old one. Compared with GF(2), a0.2dB and0.3dB increments are obtained by GF(4) and GF(16) respectively atBER=10<sup>-6</sup> in AWGN channels, an 1dB and 2dB increments are obtained by GF(4) and GF(16) respectively in multi-path Rayleigh fading channels. The performance improves as the field order is increased, but the computational complexity is increased also. The number of additions is increased 2 times and 10times by GF(4) and GF(16) respectively.
    Efficient authentication protocol for 3G-WLAN interworking networks
    LI Ya-hui;YANG Wei-dong;MA Jian-feng
    J4. 2008, 35(3):  464-468. 
    Abstract ( 1736 )   PDF (683KB) ( 1019 )   Save
    Related Articles | Metrics
    A new authentication protocol based on 3G-WLAN interworking networks is proposed. It verifies the identity of the WLAN access network to prevent the malicious AP from the re-direction attack, and improves the efficiency of the reauthentication process by using localized authentication mechanisms for 3G mobile subscribers and offline accounting methods based on the fast signature. Simulation results show that the average message transmission delay of the proposed protocol is shortened about 45% of EAP-AKA, and the proposed protocol can provide smooth roam and handover for 3G mobile subscribers in WLAN.
    An autonomous distributed trust mode
    ZHAN Yang1;PANG Liao-jun1;ZHU Xiao-yan1;WANG Yu-min2
    J4. 2008, 35(3):  469-473. 
    Abstract ( 1777 )   PDF (530KB) ( 930 )   Save
    Related Articles | Metrics
    To estimate the trust value in P2P networks, an autonomous trust mode based on both direct experiences and recommendations is proposed, in which the recommendation synthetic coefficients are decided by the trustor’s trust on the recommendation subscribers. Both the direct trust and the recommendation trust are attenuated with time intervals. The corresponding data structure and an iterative computational method are given.
    Fast secure handoff scheme for wireless LANs
    YANG Wei-dong;MA Jian-feng;YANG Chao
    J4. 2008, 35(3):  474-477. 
    Abstract ( 1514 )   PDF (626KB) ( 1141 )   Save
    Related Articles | Metrics
    According to the requirements for real-time multimedia services in Wireless LANs, a fast secure handoff scheme based on mobility prediction is proposed. By using the stations’ mobility patterns and handoff location, a station is only scanned with unicast channels selected by neighbor graphs, which reduces the scanning delay. Furthermore, the pairwise transient key is computed in advance and message integrity code is piggybacked in probing massages, which satisfies desirable security attributes and reduces the re-authentication delay. Simulation results show that compared with the other scheme, the hardoff delays reduce by more than 35%.
    Analysis and improvement of the group signature member deletion scheme
    LI Xin-she;HU Yu-pu
    J4. 2008, 35(3):  478-482. 
    Abstract ( 1397 )   PDF (523KB) ( 908 )   Save
    Related Articles | Metrics
    In a group signature system, the group members can leave at any time. Therefore how to delete a member efficiently is an important research topic. Wang et al. presented an efficient member deletion scheme (Wang deletion scheme) whose computation complexity is irrelative to the numbers of group member deleted, but we prove that it can not delete group members really. Based on the mathematical principle by which to choose parameters in the Wang deletion scheme, the improved one turns the renewing operator of the characteristic key which is used in registration and deletion from publicity to secrecy, and shifts the renewing work from the group member to the group administrator. By the improved scheme, the group members can be deleted effectively without increasing the computation complexity.
    Balancing the key tree for dynamic groups
    WANG Wei1;MA Jian-feng1;YANG Chao1;ZHAO Wen-hong2
    J4. 2008, 35(3):  483-489. 
    Abstract ( 1511 )   PDF (761KB) ( 917 )   Save
    Related Articles | Metrics
    In group key management, the approach based on the key-tree is widely used to achieve logarithmic rekeying costs. However, the key tree may become unbalanced after inserting or deleting members, and has to be kept balanced. In this paper, an improved balanced key tree is presented for dynamic groups. In the scheme based on the proposed tree, the balancing tree after member adding or member deleting does not involve borrowing a child from a sibling, merging with a sibling, and splitting a node. The scheme based on the proposed tree satisfies the desired properties, such as group key secrecy, forward secrecy, backward secrecy, key independence, and has the same worst case rekeying cost as a weight-balanced-tree. Our analysis shows that the rekeying costs of the presented scheme are O(2h) and O(2h<sup>2</sup>) in the join event and the leave event respectively.
    Novel algorithm for adaptive image segmentation of moving targets
    LI En-ke;LIU Shang-qian;MA Yan-xuan;YIN Shi-min
    J4. 2008, 35(3):  490-494. 
    Abstract ( 1832 )   PDF (870KB) ( 1263 )   Save
    Related Articles | Metrics
    The segmentation algorithm for setting the gate-limit which is commonly used for image processing can segment targets and backgrounds effectively. But the suitable adjusting coefficient must be chosen in this method. Aiming at the question, a novel algorithm for adaptive image segmentation of moving targets is presented. Based on setting self-tracking widows for tracking moving targets, the adjustable coefficient can be found adaptively on the Otsu evaluation function, and then adaptive image segmentation is completed by setting the gate-limit of image segmentation. The novel method is tested, and compared with the Otsu method, the iteration method and the maximum entropy method. Results show that the algorithm is not only valid for various complex backgrounds, but also has the features of high precision and fast speed, and that it is a practicable and effective image segmentation method.
    Design of the new electronic magnetic compass
    MA Wan-ming1;LI Cun-zhi1;LIN Xiao-chun2;GUO Yan-yan1
    J4. 2008, 35(3):  495-498. 
    Abstract ( 1735 )   PDF (571KB) ( 1337 )   Save
    Related Articles | Metrics
    The author designed a new kind of compass which has the features of greater accuracy, low cost and greater portability. When the magnetic material gets saturated, the inductance’s self-induced coefficient is inversely proportional to the magnetic field’s intensity which is proportional to the surge frequency in RL surge oscillator circuits. The magnetic azimuth angle which is displayed on the LCD is calculated based on the frequency of the RL surging circuits detected by MCU. The errors caused by the apparatus itself are modified by the positive and inverse charging and discharging of RL circuits, and those caused by the outside are modified by the software. This compass adopts digital processing techniques, and it is anti-jamming, precise, dependable, and flexible. Test results have proved that the electromagnetic compass can reach a high accuracy. The error is less than 1 degree. Thus it can meet the requirements of actual application.
    Case-based reasoning method for fault recovery with expanded similarity space
    LI Tuan-jie1;WANG Fei-jun1;YAN Tian-hong2
    J4. 2008, 35(3):  499-503. 
    Abstract ( 1598 )   PDF (596KB) ( 948 )   Save
    Related Articles | Metrics
    An expanded similarity space (ESS) method for case-based reasoning and fault recovery is proposed by combining LID and CMM. It is the key to finding error nodes according to fault symptoms for the ESS method. The ESS with the error nodes is derived, and then the errors can be tested in order of the probabilities of error nodes in the ESS. This method need not follow the order of the depth of nodes to test error nodes, which reveals the phenomenon that some errors are more common in nature. The reasoning model and algorithms for the ESS method are presented. Simulation result shows the average times of testing errors for the ESS method are smaller than those of LEAF. It means the ESS method can shorten the time of the multiple robots system for fault recovery, so the ESS method has a better capability.
    Trajectory tracking control for the flexible-link robot manipulator using piezoelectric materials
    XU Ya-lan;CHEN Jian-jun;LIU Zhen
    J4. 2008, 35(3):  504-507. 
    Abstract ( 1594 )   PDF (542KB) ( 988 )   Save
    Related Articles | Metrics
    Based on the assumed mode method and the Lagrange equation, the dynamic model is developed for the flexible single-link robot manipulator with piezoelectric materials as collocated actuators and sensors bonded to its surface. The non-minimum phase inherent in the end-effector tracking control of the flexible manipulator may result in the instability of the system, so a combined PD feedback control law is designed by using the Lyapunov function, which takes the angle displacement of the rigid hub as the control output and suppresses the end-effector vibration of the flexible manipulator using piezoelectric patches. Simulation results show that the vibration of the end-effector is suppressed by applying a command voltage to the piezoelectric actuator patch while the trajectory is tracked by driving the rigid hub, and the control law is less complex in computation and can be practically implemented.
    Fast method for the large-scale power and ground network analysis based on the compressed BiCGStab algorithm
    SU Hao-hang;ZHANG Yi-men;ZHANG Yu-ming;MAN Jin-cai
    J4. 2008, 35(3):  508-512. 
    Abstract ( 1767 )   PDF (618KB) ( 1053 )   Save
    Related Articles | Metrics

    An effective method is proposed to perform static and transient simulations for the large-scale power and ground network circuits with a good result obtained. This method compresses the large coefficient matrix by only storing the non-zero elements with the column coordinate index which avoids the row coordinate index and eases the burden of memory usage. Then it uses the BiCGStab algorithm to analyze the large network which avoids the inverse matrix computing. Extensive experimental results on the large-scale power and ground network show that the presented method is over two orders of magnitude faster than HSPICE in transient simulations. Furthermore, our method reduces over 95% memory usage than HSPICE and 75% memory usage than Incomplete Cholesky Conjugate Gradient while the accuracy is not compromised. The presented method has more powerful capability to deal with the increasing size of power grids in modern microprocessors than general-purpose circuit simulators with significant memory and run-time advantages.

    Study on the theory and experiment of electrical characteristics of the novel HfO2 gate dielectric
    CAI Nai-qiong;LIU Hong-xia
    J4. 2008, 35(3):  513-516. 
    Abstract ( 1666 )   PDF (606KB) ( 995 )   Save
    Related Articles | Metrics
    The C-V characteristics of the MOS capacitor with ultra thin HfO2 as gate dielectrics pretreated in NH4F and annealed in high temperature are investigated by simulation and experiment. Distribution of interface states is consistent with the experimental results. Shift of the flat-band voltage, density of oxide traps and interface states are calculated. The electrical properties of samples under different processes are compared using high frequency C-V methods. The investigation shows that the novel combination of NH4F pretreatment and high annealing temperature can reduce interface states and oxide traps dramatically, thus decreasing the gate leakage current.
    Routing algorithm for multiple AGVs with the undirected Petri net

    REN Xiao-long;WEN Hao-yu;LI Hua
    J4. 2008, 35(3):  517-522. 
    Abstract ( 1591 )   PDF (570KB) ( 862 )   Save
    Related Articles | Metrics
    The undirected Petri net is used to model the AGV system layout problem. A time-based reachable state graph is constructed by the time-window combined with the reachable state graph. The scheduling method is used to route the bidirectional AGV system, and the multiple AGVs routing problem is transformed into the single AGV routing problem in order to reduce problem complexity. A shortest time routing algorithm is proposed based on Best-first search, which determines the present state depending on the information of its next step path. By using this method, the shortest time route for each AGV can be found while avoiding deadlock, blocking and collision. Example results indicate that the algorithm can achieve a better optimal solution. This method can be used to deal with large scale systems.
    New method to improve DBSCAN clustering algorithm quality
    FENG Shao-rong1;2;XIAO Wen-jun1
    J4. 2008, 35(3):  523-529. 
    Abstract ( 1766 )   PDF (643KB) ( 942 )   Save
    Related Articles | Metrics
    There are three problems along with the Density Based Spatial Clustering of Applications with Noise(DBSCAN) Clustering Algorithm: input sensitivity, desire for too much memory space and the effect of nonuniform data. To solve these problems, a fast Data Partition DBSCAN using Genetic Algorithm(DPDGA) Algorithm is developed which considerably improves the cluster quality. First, the Genetic Algorithm is used to improve the K-means Algorithm to get the initial clustering center. Second, data is partitioned and the DBSCAN Algorithm is applied to cluster partitions. Finally, all clustered result sets are merged. Simulation experiments indicate that the DPDGA Algorithm works well to solve these problems and that both the efficiency and the cluster quality are better than those of the original DBSCAN Algorithm.
    New fusion detection algorithm for the dual band IR small target
    WANG Jian-tao
    J4. 2008, 35(3):  530-535. 
    Abstract ( 1677 )   PDF (823KB) ( 1012 )   Save
    Related Articles | Metrics
    A new detection algorithm for a moving dim target in the dual-band infrared image based on fuzzy fusion is proposed. The algorithm, according to the noise characteristics of the differential images obtained from dual-band IR images, introduces the membership function that evaluates the intensity of gray-grade variation on each pixel point of the differential image, and then several differential images are fused with the membership function. The dim target’ possible trajectory in single-band IR images is found after the result image is dealt with by the operation of fuzzy reasoning according to the rule of ‘IF…THEN…’, and the final result should be obtained from the trajectory fusion of dual-band IR images. Experimental results show that our algorithm avoids the shortcoming of low detection probability caused by difficult threshold determination and “hard” decision in terms of fuzzy reasoning, improves the detection performances by fusion of dual-band IR images, and effectively detects the dim moving target.
    Swarm intelligence algorithm for particle filtering
    LU Tao-rong1;2;ZHU Lin-hu1;LI De-fang3;LIU Hong-jie4;XIA Wen-jun1
    J4. 2008, 35(3):  536-541. 
    Abstract ( 2150 )   PDF (603KB) ( 1067 )   Save
    Related Articles | Metrics
    By bringing the thought of swarm intelligence into particle filtering, a novel particle filter based on the artificial fish school algorithm is proposed. This algorithm makes prior particles move towards the high likelihood region by use of the alternation of behaviors of preying and swarming in the artificial fish school algorithm. So particle distribution and filtering accuracy are improved. Moreover, the difference between the particle distribution produced by behavior of swarming and the likelihood distribution is described by Kullback information. Kullback information decreases with the increasing iteration degree, which proves that this algorithm is rational. Finally, simulation results show that this swarm intelligence algorithm for particle filtering is effective, and has a better filtering performance than the EKF and the common PF.
    Texture image segmentation using the without re-initialization geodesic active contour model
    WANG Kai-bin1;YU Bian-zhang1;WANG Qi2;XI Wei1
    J4. 2008, 35(3):  542-545. 
    Abstract ( 1612 )   PDF (1201KB) ( 986 )   Save
    Related Articles | Metrics
    Segmenting an image into differently textured regions is a difficult problem. A new method for texture image segmentation is proposed, which has three advantages over the other active contours. Firstly, by combining the gray levels of pixels and texture information of an image, this method can be used for segmentation of a texture image or a none-texture image. Secondly, the method has low computation complexity, because the LBP (local binary pattern) is employed to extract texture features. Finally, the without re-initialization algorithm proposed in this paper can avoid the additional computation problem due to the re-initialization of the signal distance function. The segmentation tests for synthetic and natural texture images show that the proposed segmentation method is efficient, accurate, fast and robust.
    Improved UCONC authorization decision model for the service grid
    GUI Jin-song;CHEN Zhi-gang;DENG Xiao-heng;LIU Li
    J4. 2008, 35(3):  546-553. 
    Abstract ( 1546 )   PDF (719KB) ( 854 )   Save
    Related Articles | Metrics
    To keep free from weak capability of expression of the usage control model based on condition predication decision(UCONC), realize reasonable task assigning between decision component and execution component, and improve concurrent enforcement of independent authorization processes in the service grid, a delegation certification model is proposed to express the decision result in a fine-grained manner, and the UCONC is improved. Delegation certification processing statuses are defined to replace the simple access status. The decision component can make the reasonable delegation certification based on the system status when a request arrives, and also make a decision to change the delegation certification processing status when the system status is changed. This method effectively avoids the fact that the same access requests generate the delegation certification repeatedly, and the delegation certification really reflects actual demands of authorization. In an e-Learning Grid, the improved decision model expresses the authorization policy in a fine-grained manner, and exports reasonable decision results. Various access requests satisfies security requirements of application through the suitable decision and control.
    Modeling and optimizing of the information hiding communication system over streaming media
    XIAO Bo;HUANG Yong-feng
    J4. 2008, 35(3):  554-558. 
    Abstract ( 1649 )   PDF (683KB) ( 1119 )   Save
    Related Articles | Metrics
    Information hiding communication (IHC) over streaming media is an important branch of information hiding (IH). As for the problem of inconsistent hiding process caused by the diversity of the streaming media data format, the paper proposes a three-layer system model, which divides the IHC process into adaption & execution, transmission management and IH application. The functionality, service and interface of each layer are defined. An analytical model for primary parameters is then established, obtaining the presentation of effective IH channel usage. The optimal system parameter is calculated using the partial derivative method. The system model has been implemented on the VoIP platform. Experiments and tests show that the layered model successfully solves the inconsistent problem due to different carriers for IHC. The theoretical value of the optimal parameter serves the function of guiding the design of a practical system.
    Identity (ID)-based authentication and the key agreement protocol
    SUN Ji-min1;SUN Yu2;ZHANG Si-dong1;PEI Qing-qi1
    J4. 2008, 35(3):  559-562. 
    Abstract ( 1715 )   PDF (493KB) ( 902 )   Save
    Related Articles | Metrics
    Based on an improved signcryption technique and the ID-based public key cryptosystem, a new authentication and key agreement protocol is proposed. The problem of passing and verifying the certificate needed in the traditional public key cryptosystem is well resolved. At the same time, the proposed protocol offers perfect forward secrecy. That is to say, even if the private key of the participant is exposed, the security of the negotiated keys does not suffer. Analysis shows that the proposed ID-based authentication and key agreement protocol is more secure and effective and more applicable than the others.
    Joint power saving and power control MAC protocol in Ad Hoc networks
    ZHU Rong-bo1;GAO Bo2
    J4. 2008, 35(3):  563-571. 
    Abstract ( 1601 )   PDF (801KB) ( 890 )   Save
    Related Articles | Metrics
    For power efficiency and capacity in ad hoc networks, a novel joint power saving and power controlled medium access control (MAC) protocol called PSPC is proposed in single-channel networks. PSPC is made up of two periods in a beacon interval: ATIM (Ad hoc Traffic Indication Message) period and data transmission period. At the beginning of ATIM, nodes wake up simultaneously and exchange the control message to estimate the power to be used in later data transmission. At the same time, receivers inform neighbour nodes of their allowable maximum transmission power for avoiding interference to allow for concurrent transmission in the same vicinity. After the end of ATIM, nodes can decide their transmission power level and whether they can transmit data on the information they have exchanged in the ATIM. If nodes cannot transmit data or have no data to transmit, they enter the sleeping state until the end of this beacon interval. Simulation results demonstrate the significant throughput and energy gains that can be obtained under the PSPC protocol.
    Adaptive-weighted clustering algorithm based on flow balance for mobile ad hoc networks
    ZHANG Li1;2;YU Zhen-wei1;ZHANG Yang3
    J4. 2008, 35(3):  572-576. 
    Abstract ( 1831 )   PDF (594KB) ( 937 )   Save
    Related Articles | Metrics
    To solve the stability issue of clustered mobile ad hoc networks, a weighted clustering algorithm is proposed, based on the theory of the network flow balance. The algorithm chooses cluster heads relying on the adaptive weight, and dynamically clusters the mobile nodes distributed randomly and clinging to the network conditions and nodes’ state. Clusters are optimized according to the scalable degree. Simulation results show that, in the condition of maintaining the former expenses, the algorithm could balance the load of cluster heads, and prevent the cluster heads from becoming the bottleneck effectively.
    New approach for image retrieval based on olor and spatial features
    ZHANG Zhi-an;LUO Bin
    J4. 2008, 35(3):  577-580. 
    Abstract ( 1895 )   PDF (690KB) ( 1326 )   Save
    Related Articles | Metrics
    The invariant of Radon transform using the statistical theory is constructed and a new kind of color image retrieval algorithm based on Radon transform is presented. In the first place, the shift invariant project is achieved by centering the Radon project of HSV color space. The singular values of the project can be used as the character vector. The singular values of the scaling invariant can be obtained by the statistical characteristics of Radon transform. Since the singular values of the matrix are uncorrelated with the position of the column or the row of the matrix. In this way, the character vector of singular values with shift, scaling and rotational invariant is arrived at by this algorithm. The Gaussian model is used to normalize the different sub-character distances to the character vector. The similarity between the querying image and other images is computed by the Euclidean distance. Experiments indicate that this method has a higher retrieval-rate than other methods.