Please wait a minute...

Current Issue

    25 August 2010, Volume 31 Issue 8A
    Papers
    Using SROIQB to model and compose semantic Web service
    Da-you LIU,Si-pei LIU,Hong QI
    2010, 31(8A):  1-9.  doi:1000-436X(2010)8A-0001-09
    Asbtract ( 0 )   HTML ( 4)   PDF (127KB) ( 2 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    One kind of semantic Web service modeling and reasoning method based on description logic with Boolean role constructors (SROIQB) was introduced.By using DL to figure out the hyponymy rel ionship between concepts in domain ontology and model Web service functional semantic in ServiceProfile,and Boolean role expressions to describe the composition process in ProcessProfile respecti ly.Furthermore,Boolean role expression is introduced to describe all possible composition structures of atomic services and then semantic Web service composition can be regarded as a process of consistence checking and class subsumption computing reasoning on DL knowledge base.Thus the comparison and example validation show that introduced one kind of new and reasonable semantic Web service modeling and composition method in the framework of semantic Web by using SROIQB,which with more strong expressive capability and decidable type inference.

    Blind equalization algorithm for high-order QAM signals
    Bin WANG,Lin-dong GE,Di WU,Fu-qiang XUE
    2010, 31(8A):  10-16.  doi:1000-436X(2010)8A-0010-07
    Asbtract ( 0 )   HTML ( 2)   PDF (208KB) ( 152 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A modified weighted multi-modulus blind equalization algorithm(MWMMA) and a new hybrid multi-modulus algorithm(HMMA) for high-order QAM signals were proposed.The MWMMA uses a new eight factor definition method to reduce the residual error and improve the adaptive capacity to different modulation order.Furthermore,the variable step size method based on kurtosis was used to increase the convergence rate.The HMMA combined MWMMA with the decision directed algorithm properly to construct new hybrid blind equalization cost function,which can markedly increase the convergence rate with a lower residual er .Theoretic analyses and simulation results prove that both of the methods are not sensitive to the shape of different constellations and make better on residual error and convergence rate than other algorithms.

    New image coding and reconstruction algorithm based on all phase bi-orthogonal Tchebichef transform
    Fen-hong GUO,Chang-zhen XIONG
    2010, 31(8A):  17-25.  doi:1000-436X(2010)8A-0017-09
    Asbtract ( 0 )   HTML ( 2)   PDF (277KB) ( 4 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to overcome the shortcomings that the JPEG quantization table is not easy to design and the blocking effect of reconstructed image based on low bit rate JPEG compression is hard to remove,an all phase bi-orthogonal transform based on tchebichef system (APBTT) was constructed.This method combined the good data approximation performance of the complete orthogonal Tchebichef system and the zero phase characteristics of the all phase digital filter.Then by using APBTT matrix,a low bit rate image coding and reconstruction algorithm was proposed.The proposed image coding and reconstruction algorithm used uniform quantization intervals to quantify the coeffic ts obtained by APBTT.This method did not need the quantization table.The approach simplified and speeded the process of the image coding.The blocking effect of reconstructed image by could be removed effectively by smoothing the pixels on the borderline of blocks or the whole image with an averaging filter.The proposed method outperforms DCT-JPEG algorithm in image quality and coding speed.The new method is suitable for low bit rate image compression.

    Overlay reliable multicast protocol in wireless ad-hoc network
    Xi,FENGGang SHI,Yi-de ZHANG
    2010, 31(8A):  26-31.  doi:1000-436X(2010)8A-0026-06
    Asbtract ( 0 )   HTML ( 2)   PDF (140KB) ( 3 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Reliable multicast service becomes essential to support a class emerging applications which require reliable data delivery to multiple nodes simultaneously in wire ess ad-hoc networks.A new overlay reliable multicast protocol called lightweight overlay reliable multicast (LORM )was proposed.LORM built up overlay network topology with periodic detection of node information.The reliability multicast data was guaranteed by combining local recovery and source recovery mechanisms.The results of the experiment based on 802.11b ad-hoc network show that LORM significantly outperforms LightWeight in terms of packet loss rate.

    Modified eigenspace-based beamforming algorithm
    Nai-ping CHENG,Shu-yan NI
    2010, 31(8A):  32-36.  doi:1000-436X(2010)8A-0032-05
    Asbtract ( 0 )   HTML ( 2)   PDF (104KB) ( 8 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A modified eigenspace-based algorithm was presented.The algorithm first added another distortionless constraint to the conventinal minimum variance (MVDR) beamformer in the direction different to but near the presumed direction to avoid the certain positions.Then the weight vector of the modified MVDR optimization was calculated utilizing the linearly constrained minimum variance (LCMV) a ithm.Finally the obtained weight vector was projected onto the signal subspace.Several computer simulations demonstrated that the proposed algorithm provided much more robust capabilities and could perform well in a large scope of pointing errors.

    Asymmetric bilinear pairing based direct anonymous attestation scheme
    Hong-hu ZHEN,Yue CHEN,Peng-xu TAN,Yuan-bo GUO
    2010, 31(8A):  37-43.  doi:1000-436X(2010)8A-0037-07
    Asbtract ( 165 )   HTML ( 10)   PDF (90KB) ( 210 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to achieve the direct anonymous attestation need of chinese domestic trusted cryptography module (TCM),based on asymmetric bilinear pairings,a presentation of the bran-new DAA scheme:ABP-DAA scheme was given.Comparing with the existing DAA schemes,ABP-DAA scheme is not only adaptable for TCM,but also more secure,more simple and efficient.

    Method of text vector construction based on concept cluster
    Yang FENG,Sen-lin LUO,Li-min PAN,Li-li LIU,Kai-jiang CHEN
    2010, 31(8A):  44-47.  doi:1000-436X(2010)8A-0044-04
    Asbtract ( 84 )   HTML ( 2)   PDF (86KB) ( 145 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To enhance the performance of the text vector,terms were clustered,which contained similar syntax or semantic feature,to construct concept cluster.The text vector would be transformed from term-space to concept-cluster-space to represent the original text.The experiment compared effects of text classification based on TF-IDF,IG,TF-IDF-IG,LSA,and their combinations with concept cluster.And the results show that,the text vector based on concept cluster improves the accuracy of text concept approaching,and advances the discriminating degree between different types of texts.

    Approach of MTV abstraction automatic extracting based on shot-group weighting
    Shu-jie MA,Sen-lin LUO,Li-min PAN,Er-man XIE
    2010, 31(8A):  48-51.  doi:1000-436X(2010)8A-0048-04
    Asbtract ( 84 )   HTML ( 3)   PDF (77KB) ( 67 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An approach based on shot-group weighting to generate static and dynamic MTV abstraction was proposed.The static abstraction was generated by obtaining the shot-group information in MTV,and the dynamic abstraction was generated by hierarchical analyzing.Experiment shows that static abstractions achieve 86.25% average recall with 86.25% average precision,and dynamic abstractions can reflect the main contents of the original videos with good intelligibility and appreciation quality when compression ratios are lower than 5.

    Compressed sensing based on the single layer wavelet transform for image processing
    Yi-gang CEN,Xiao-fang CHEN,Li-hui CEN,Shi-ming CHEN
    2010, 31(8A):  52-55.  doi:1000-436X(2010)8A-0052-04
    Asbtract ( 150 )   HTML ( 8)   PDF (85KB) ( 551 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    According to the properties of wavelet transform sub-bands,an improved compressed sensing algorithm based on the single layer wavelet transform was proposed,which only measured the high-pass wavelet coefficients of the image but preserving the low-pass wavelet coefficients.For the reconstruction,by using the orthogonal matching pursuit(OMP) algorithm,high-pass wavelet coefficients could be recovered by the measurements.Then the image could be reconstructed by the inverse wavelet transform.Compared with the original compressed sensing algorithm,simulation results demonstrated that the proposed algorithm improved the quality of recovered image significantly.For the same measurement number,the PSNR of the proposed algorithm was improved about 2~4dB.

    Fractional frequency estimation algorithm for OFDM system based on noise decision
    Yu-ming SUN,Yan-zhong ZHANG,Ding-rong SHAO,Shu-jian LI
    2010, 31(8A):  56-62.  doi:1000-436X(2010)8A-0056-07
    Asbtract ( 44 )   HTML ( 2)   PDF (192KB) ( 39 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To improve the orthogonal frequency division multiplexing (OFDM) system fractional frequency estimation precision,a fractional frequency offset estimation algorithm assisted by the real time channel estimation was presented.By means of estimating the received channel noise to ensure the threshold logic,the seamless connection of frequency offset estimation between the presented algorithm and estimation algorithm based on cycle prefix was realized.The simulation results show that,in additive white Gaussian noise channel,the estimation mean-square error of the new algorithm is less than 5.91% of the cyclic prefix based algorithm,the convergence speed of the former algorithm is more than the latter 5 feedback point; in multipath fading channel,the estimation mean-square error of the former is less than 5.18% of the latter,the convergence speed of the former is more than the latter 6 feedback point.Therefore,the receiver performance could be improved.

    Research on a routing algorithm for clustered wireless sensor networks
    Shu-cheng GUO,Yu LU,Ding-gen XU
    2010, 31(8A):  63-69.  doi:1000-436X(2010)8A-0063-07
    Asbtract ( 66 )   HTML ( 2)   PDF (120KB) ( 46 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In wireless sensor networks,clustering algorithm prolongs networks’ lifetime drastically.For a large size of WSN,the cluster head will consume too much energy if ansmits message to the sink directly.At first the EDR(energy distance ratio) was proposed for the problem,which gave the relationship between transmitting distance and energy efficiency.Afterward,a routing algorithm for transmitting message from cluster head to the sink was brought forward.In the algorithm,every node saved the information about location and energy of other nodes in current cluster.A transmitter selected the relaying node from its memory.If there was no node to relay in this cluster,the transmitter would send asking information to neighbor cluster and one of nodes in neighbor cluster answered the transmitter who was the relaying node.At last,simulation exhibited the algorithm was able to reduce energy consumption of WSN and also do well for balancing energy for WSN.

    On the construction and enumeration of orthomorphic permutations
    Da-jian LIAO,Yuan-sheng TANG
    2010, 31(8A):  70-75.  doi:1000-436X(2010)8A-0070-06
    Asbtract ( 57 )   HTML ( 2)   PDF (99KB) ( 79 )   Knowledge map   
    References | Related Articles | Metrics

    Based on the one to one corresponding relationship between orthomorphic permutations and transversal of Latin square,the construction issue for orthomorphic permutations was studied.A new equivalent relation between orthomorphic permutations was proposed.According to the equivalent relation,all the n-bit orthomorphic permutations could be divided into a number of equivalence classes.composite transversal can be constructed could be between these equivalent orthomorphic permutations within an equivalence class.Based on these composite transversal,a new construction method was proposed to construct a (n+1) bit orthomorphic permutation from a n-bit one.By this method,enumeration and counting of orthomorphic permutations are easier and more orthomorphic permutations can be constructed Could be constucted.The method is also easily realized in engineering.

    Secure data collection approach for wireless sensor networks based on multipath routing and feedback
    Yu-xin MAO
    2010, 31(8A):  76-80.  doi:1000-436X(2010)8A-0076-05
    Asbtract ( 49 )   HTML ( 2)   PDF (85KB) ( 60 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel approach of secure data collection for wireless or networks with compromised nodes was proposed.Secret sharing and multipath routing to solve the problem of secure data collection in wireless sensor network was explored.A novel tracing-feedback mechanism was used,which made full use of the routing functionality of ireless sensor networks,to improve the quality of data collection.The algorithms of the approach are easy to be implemented and performed in resource-constrained wireless sensor networks.The performance of the approach with simulation experiments was evaluated.Compared with existing similar methods,the approach provides higher security with less complexity.

    Task match scheduling algorithm on using heap sort of multi-layer sub-tree
    Xiu XU
    2010, 31(8A):  81-86.  doi:1000-436X(2010)8A-0081-06
    Asbtract ( 59 )   HTML ( 2)   PDF (80KB) ( 314 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    At the characteristic of the arrangement matching recursion and based on the sole data inserting in the cru-node,one method of sub-tree to be formed one pile was proposed.One algorithm of sub-tree heap sort was advanced,and then one task matching algorithm based on multi-layers sub-tree heap sort was disquisition and designed.The algorithmic analysis and the experimental result indicated that this algorithm can carry on reasonable,fast,and effective task matching for the resources tree's information need quantity enhancing the efficiency of the task scheduling and the resources gain.

    Signcryption-based fair exchange protocol
    Ming LUO,Chun-hua ZOU,Jun HU,Ying-you WEN
    2010, 31(8A):  87-93.  doi:1000-436X(2010)8A-0087-07
    Asbtract ( 44 )   HTML ( 2)   PDF (78KB) ( 89 )   Knowledge map   
    References | Related Articles | Metrics

    By introducing signcryption technology into concurrent signature,a signcryption-based concurrent signature scheme was presented,which was proven to have the existential unforgeability against adaptive chosen messages attacks under the random oracle model,Based on this scheme,a fair exchange protocol was proposed,which could be used to exchange digital goods.This protocol did not need secure communications channel,in which two parties generate symmetrical ambiguous signatures and individual keystones were released by themselves,which ensured the properties of confidentiality,ambiguousness and fairness,which made our protocol could be used in e-commerce payment,e-contract signing,mail authentication,etc.

    Research on signals modulation classification based on SVM and RVM
    Xin ZHOU,Ying WU
    2010, 31(8A):  94-99.  doi:1000-436X(2010)8A-0094-06
    Asbtract ( 45 )   HTML ( 2)   PDF (98KB) ( 140 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A new classification method based on relevance vector machine (RVM) was proposed in the MPSK signals modulation classification.The fourth order cumulants of the received signals were used as classification vectors firstly,then the kernel thought was used to map the feature vector impliedly to the high dimensional feature space and support vector machine (SVM) and RVM were applied to signal classification.The cross validation algorithm was adopted to select kernel function parameters,robust SVM and RVM classifiers were built and a fast sequential sparse Bayesian learning algorithm was adopted to solve RVM hyperparameters.Through the experiment it can be concluded that compared with SVM classifier,RVM can get almost the same classification accuracy and requires less time,the basis function number needed is much less.

    Method of determining BBA based on multi-class support vector machine
    Hong-bin JIN,Jiang-qiao LAN
    2010, 31(8A):  100-104.  doi:1000-436X(2010)8A-0100-05
    Asbtract ( 45 )   HTML ( 2)   PDF (73KB) ( 177 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Evidence theory was an important method in the field of multi-sensor information fusion,but its BBA was difficult to determine so that it became a bottleneck in practical applications.Therefore,a novel method of determining BBA based on multi-class support vector machine was proposed.On the basis of Platt posteriori probability,the two-class posteriori probabilities were extended to multi-class in the method.And then the soft decision in the form of posteriori probability was improved and the BBA function was constructed.The rationality and effectiveness of the proposed method are verified by the simulation analysis finally.

    Trusted computing model based on lattice
    Xin-qiang MA,Yi HUANG
    2010, 31(8A):  105-110.  doi:1000-436X(2010)8A-0105-06
    Asbtract ( 72 )   HTML ( 3)   PDF (77KB) ( 38 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In the computer information systems,in general,some security strategies to access and handle information to protect the confidentiality and integrity of information were followed.The BLP model only solved the confidentiality problem,and the Biba model only solved the integrity problem,the others were similar.It couldn’t give attention to both sides at the same time.Based on the set of sensitivity labels for security model coming into being lattice order theory in math,a lattice security model was proposed,which was combined BLP model and Biba model of information flow.The lattice security model could keep the confidentiality and integrity of the informat at the same time.The information security model theory research will be developed through the constructing of the new model of information flow lattice.

    Comparative research on blind detection algorithm of HF burst signal
    Di WU,Lin-dong GE,Bin WANG
    2010, 31(8A):  111-116.  doi:1000-436X(2010)8A-0111-06
    Asbtract ( 67 )   HTML ( 3)   PDF (140KB) ( 214 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Two kinds of blind detection algorithm of HF burst signal were proposed respectively,which were based on the format and characteristics of HF serial burst MPSK signal.For the burst signal of pilot-less frequency,a kind of self-adaptive threshold detection algorithm was proposed,which was based on the higher-order cumulant of sliding window.The algorithm used higher-order cumulant as detection function to distinguish the useful signal and noise.By setting the self-adaptive adjustment threshold of detection function collection,the adjudication mechanism of length control and state transition were adopted to reduce the effect of dithering of detection function on the judgment results.For the burst signal of pilot frequency,the maximum value of uniformi ion instantaneous power spectrum density was used to capture the pulse of pilot frequency.Then combing the self-adaptive threshold algorithm based on the higher-order cumulant,it was detected the end point of proruption signal.Simulation experiment a the detecting result of actual signal show the two kinds of algorithm put forward have good performance.And they are convenient for real-time dispose,which can be applied in the actual engineering.

    Construct of QC-LDPC codes based on Z-shape and arithmetic progression sequence
    Li-li ZHANG,Ze-mao ZHAO,Jian-rong BAO
    2010, 31(8A):  117-121.  doi:1000-436X(2010)8A-0117-05
    Asbtract ( 39 )   HTML ( 3)   PDF (82KB) ( 56 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    For the issue of determining cyclic shift coefficients of the quasi-cyclic sub-matrix in the quasi-cyclic low density parity check,a method was presented based on Z-shape and arithmetic progression sequence to compute the cyclic shift coefficients.By this method,cyclic shift coefficients could be expressed in simple analytic expressions,and cycles of length four in parity matrix were eliminated.Simulations show that,under the classing BP decoding algorithm,the SNR of the LDPC codes with the proposed algorithm is better than the LDPC codes in DVB-S2 close to 0.4dB at the BER performance of 10-4.Futhermore,the BER performance of the new codes is no less than the Mackay random codes under the same conditions.

    Optimized fast multi-scalar multiplication algorithm based on MBNS
    Xin-chun YIN,Hai-ling ZHANG,Ting YANG
    2010, 31(8A):  122-126.  doi:1000-436X(2010)8A-0122-05
    Asbtract ( 63 )   HTML ( 3)   PDF (82KB) ( 302 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    As a generalization of double base chains,multi-base number system were very suitable for efficient computation of scalar multiplications of elliptic curves because of shorter representation length and less Hamming weight.Combined with the given formulas for computing the 5-fold of an elliptic curve point P,the efficient scalar multiplication algorithms of elliptic curve was proposed using 2,3 and 5 as bases of the multi-base number system.The algorithms cost less compared with Shamir’s trick and interleaving with NAF’s method.

    Technical Reports
    Single-station measurement method for spacecraft velocity
    Tao YU
    2010, 31(8A):  127-131.  doi:1000-436X(2010)8A-0127-05
    Asbtract ( 62 )   HTML ( 2)   PDF (153KB) ( 110 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    On the assumption that spacecraft was uniform motion alone straight line,a measurement method that could rapidly survey spacecraft orbital velocity only by use of single ground station was presented compositely making use of the ratio relationship of Doppler changing rate and velocity identity between adjacent measuring node.The reliab lity of derived formula was verified by analog simulation.The error analysis shows that formula measurement accuracy is inversely proportional to the wavelength based on frequency measurement technique.This method can be also applied to single-observer passive location.

    Optimized compress strategy of solving route delay in backbone nodes
    Hui-jun DU
    2010, 31(8A):  132-136.  doi:1000-436X(2010)8A-0132-05
    Asbtract ( 42 )   HTML ( 2)   PDF (121KB) ( 58 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    After analyzing the procedure of refreshing route list addresses,via balanced B-Tree algorithm,deduce that huge route list capacity did not affect fast route mat h.The main reason why routing match was delayed was that current routing capacity was quite low,which caused the failure to find destination addresses.Bring forward a compressed strategy in which real maximal route list capacity was the yardstick of solving route match delay.Its purpose is to assure IP destination addresses being in the route list.The results show that the compressed strategy is able to solve the route match delay.

    Linear frequency modulation interference suppressing in DSSS system based on BFT and FRFT
    Ding-gen XU,Nai-ping CHENG,Hui ZHOU
    2010, 31(8A):  137-142.  doi:1000-436X(2010)8A-0137-06
    Asbtract ( 60 )   HTML ( 4)   PDF (129KB) ( 99 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A fast approach to BFT (bi-orthogonal Fourier transform) was proposed,which transforms BFT to the product of the constants and discrete moments with Taylor series expansion,after the computational complexity of BFT was discussed.A method of multi-component LFM interference suppression in DSSS was introduced.First the received signal is transformed by BFT,thus the value of every chirp ratio is estimated by peak-searching in the BFT domain,and the corresponding rotational angles of FRFT can be figured out from these values.Then the interference in fractal domain is excised by serial filters.Discussion and numerical simulation results show the validity of this method.In addition,when compared with other two-dimension time-frequency filtering algorithms,it reduces computational complexity with no loss of BER performance.

    Robust GPS interference suppression method in the case of small sample size
    Wen-fei GONG,Xin SUN,Si-liang WU
    2010, 31(8A):  143-147.  doi:1000-436X(2010)8A-0143-05
    Asbtract ( 54 )   HTML ( 0)   PDF (128KB) ( 88 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To suppress GPS interferences effectively in the case of small sample ize,an adaptive reduced-rank space-time adaptive processing (STAP) interference suppression method was proposed based on adaptive diagonal loading in the condition of linearly constrained minimum variance (LCMV).First,the range of diagonal loading valu is given according to the matrix inversion theorem.Then the process diagonal loading factor is realized in the backward recursion of multistage nested Wiener filter (MSNWF).Analysis and results of the experiment show that the proposed method enhances the anti-jamming performance compared to traditional STAP methods.Meanwhile,the computation of STAP can be reduced further and the real-time property can also be enhanced.

    Throughput optimization of cognitive radio networks based on sequential cooperative sensing
    Wen ZHANG,Jia-wei YANG,Qi YAN,Li-yuan XIAO
    2010, 31(8A):  148-153.  doi:1000-436X(2010)8A-0148-06
    Asbtract ( 39 )   HTML ( 0)   PDF (165KB) ( 35 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Under the constraint that the primary users were sufficiently protected,throughput optimization problem was studied in cognitive radio networks based on sequential cooperative spectrum sensing.Throughput optimization problem was established,and was analyzed by optimization theory.Furthermore,a searching method was proposed to obtain the optimal throughput and the corresponding optimal parameters.The simulation results show that the optimal throughput exists in the cognitive radio networks based on sequential cooperative sensing,and the optimal throughput decreases as the transmission overhead increases.

    Co-channel interference cancellation in M-PSK/QAM systems based on phase pre-coding and blind source separation
    Xiao-niu YANG,Jun-liang YAO,Jian-dong LI,Zhao LI,Yan ZHANG
    2010, 31(8A):  154-160.  doi:1000-436X(2010)8A-0154-07
    Asbtract ( 56 )   HTML ( 2)   PDF (168KB) ( 62 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    A novel approach for co-channel interference cancellation in M-PSK/QAM systems was proposed.In this method,the desired signals were extracted by combining phase pre-coding and blind source separation (BSS) techniques,so then channel state information (CSI) was not required.It provided significant improvement in bandwidth utiliz ion by saving the training symbols,and avoided the impact on system performances introduced by channel estimation error.Experiments show that,the proposed method has lower bit error rate (BER) than MMSE with perfect CSI when SNR higher than 6dB.

    Research on transmit technology for the missile system based on ultrahigh-speed real-time network
    Hui-qi XU,Ping-yun ZHU,Li-li PAN,Xian-wu HE
    2010, 31(8A):  161-165.  doi:1000-436X(2010)8A-0161-05
    Asbtract ( 48 )   HTML ( 2)   PDF (98KB) ( 60 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    In order to meet the information transmission demand of the new generation missile weapon system,the ultrahigh-speed real-time optical fiber network based on reflective memory discussed,and a design concept which was suitable for the information transmission of the missile was proposed.Double ring redundancy design and fault-tolerance strategy is used to enhance the reliability and fault-tolerance capability of the whole system.The dynamic it mode selection strategy can not only increase the efficiency of small data transfers,but also burst data transfers.Performance testing indicates that the system has excellent transm t speed,real-time characteristic,reliability and fault-tolerance capability,and it can meet the increasing requirement of missile information transmission systems.

    Application of improved grey correlation algorithm on radiation source recognition
    Yun LIN,Xi-cai SI,Ruo-lin ZHOU,Hui YANG
    2010, 31(8A):  166-171.  doi:1000-436X(2010)8A-0166-06
    Asbtract ( 51 )   HTML ( 3)   PDF (65KB) ( 88 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the characteristics of imperfection and vagu of radiation source information acquired by electronic reconnaissance sensor in complex electromagnetic circumstance,a new method based on grey correlation and evidence theory was presented.Firstly,the shortcoming of common subjective grey correlation algorithm was overcome by the method.According to the information entropy theory,the weight of grey correlation algorithm was calculated in real time.And the basic probability assignment function(BPAF) of evidence was obtained by the self-adaptive entropy-weight grey correlation algorithm.Then according to the evidence combination rule and decision criteria based on basic probability assignment,the proofs of different electronic reconnaissance sensor were fused.And the different kinds of radiation source were identified.The analysis of theory and result of simulation proved that,in contrast to the common subjective grey correlation algorithm,the self adapti entropy-weight grey correlation algorithm had higher objective recognition rate,better circumstance adaptability and stronger computation reliability.

    Papers
    Creation method of Chinese subjective lexicon
    Jing ZHANG,Hao JIN
    2010, 31(8A):  172-176.  doi:1000-436X(2010)8A-0172-05
    Asbtract ( 47 )   HTML ( 0)   PDF (90KB) ( 163 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Based on the current situation of and demand for Chinese sentiment analysis,the method of automatically obtaining subjective lexicon from the target corpus was studied.A creation method of subjective lexicon was presented,the subjective lexicon and language model were defined,a self-adaptive subjectivity bootstrapping algorithm and the characteristic model of subjectivity attribute were designed,and all these lead to the realization of the automatic judgment of sentiment polarity,subjectivity intensity and the subjectivity and objectivity of a word in the subjectivity entry.Experiments prove that by using machine learning the proposed method of automatic creation of Chinese subjective lexicon is highly efficient and with excellent performance.

    Technical Reports
    Per-user frequency domain equalization for SC-CDMA asynchronous uplink transmission
    Liang LIU,Yan-zhong ZHANG,Ding-rong SHAO,Shu-jian LI
    2010, 31(8A):  177-183.  doi:1000-436X(2010)8A-0177-07
    Asbtract ( 44 )   HTML ( 1)   PDF (146KB) ( 74 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    An optimal linear FDE called per-user minimum-mean-square-error (PU-MMSE) FDE was derived for SC-CDMA uplink by equalizing all the virtual subcarriers ntly.After a short discussion on the PU-MMSE FDE,a low complexity block-diagonal PU-MMSE FDE was proposed by exploiting the inherent characteristics of the FDE matrix.By means of theoretical analysis and computer simulation,the conventional per-carrier MMSE (PC-MMSE) FDE,proposed PU-MMSE FDE and block diagonal PU-MMSE FDE were compared from the perspectives of complexity and performance.Results obtained show that the proposed PU-MMSE FDE significantly outperforms the conventional PC-MMSE FDE,particularly in asynchronous uplink with practical impairments including carrier frequency offset and near-far effect.Furthermore,owing to the low complexity block-diagonal PU-MMSE FDE,the number of symbols in each block can be carefully chosen to trade-off between system performance and complexity.

    Papers
    Timing synchronization with multi-symbols in MIMO-OFDM system based on interleaved cyclic prefix
    Bing-jie ZHANG,Han-ying HU,Da-ming WANG
    2010, 31(8A):  184-187.  doi:1000-436X(2010)8A-0184-04
    Asbtract ( 39 )   HTML ( 1)   PDF (82KB) ( 192 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    To reduce the peak value of signals when error of timing exists,interleaved cyclic prefix was proposed,by which the correlational characteristic of that window was improved and the peak value was obtained only when the accurate timing presents for main path and multiple paths.To increase the performance of maximum-like estimation,multi-symbols correlation was suggested to apply in MIMO-OFDM system.In contrast with the traditional cyclic prefix,it was easier to obtain the accurate timing synchronization of symbol.

    Concise Papers
    Secure communication based on network coding
    Zhang-hua CAO,Yuan-sheng TANG
    2010, 31(8A):  188-194.  doi:1000-436X(2010)8A-0188-07
    Asbtract ( 48 )   HTML ( 1)   PDF (140KB) ( 69 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Network coding allowed intermediate nodes to mix information from different data flows.Building on this observation,two secure communication protocols were proposed for c ication systems on wiretap multicast networks.The first approach d on linear network coding completely and enabled the multicast networks to have perfect secrecy without keys,which was the essential distinction from cryptographic methods.Another way of achieving security over wiretap multicast network via encrypting part of source message packets.Thus,new secure communication schemes indicate that security is an intrinsic property of network coding.Furthermore,comparing with other approaches,no network capacity is lost by our methods.

    Recursive algorithm based on QR decomposition for fixed sample size
    Shu-yan NI,Nai-ping CHENG,Zheng-zhong NI
    2010, 31(8A):  195-200.  doi:1000-436X(2010)8A-0195-06
    Asbtract ( 45 )   HTML ( 1)   PDF (144KB) ( 125 )   Knowledge map   
    Figures and Tables | References | Related Articles | Metrics

    Most of recursive algorithms based on QR decomposition(QRD) for adaptive beamform ng are deduced by assuming that at each incoming snapshot an additional vector is added.However,in practical use,the sample size which can beuse is always limited.After the sample data are cumulated to a certain amount,an old data vector should e removed at the same time when a new data vector is added.For this way of data updating,a more practical recursive QRD algorithm was proposed utilizing hyperbolic householder transformation.To reduce the computational cost of the algorithm a simplified method was also studied.Then based on the theory of the inverse QRD,further improvements were made for the algorithm more fit for real time use.Finally,the recursive algorithm was applied to the diagonal loading beamformer which had more robust capabilities.Several computer simulations illustrates that,when the sample size is limited,the proposed algorithms provide large array gain and better beam pattern than the traditional QRD algorithm.

Copyright Information
Authorized by: China Association for Science and Technology
Sponsored by: China Institute of Communications
Editor-in-Chief: Zhang Ping
Associate Editor-in-Chief:
Zhang Yanchuan, Ma Jianfeng, Yang Zhen, Shen Lianfeng, Tao Xiaofeng, Liu Hualu
Editorial Director: Wu Nada, Zhao Li
Address: F2, Beiyang Chenguang Building, Shunbatiao No.1 Courtyard, Fengtai District, Beijing, China
Post: 100079
Tel: 010-53933889、53878169、
53859522、010-53878236
Email: xuebao@ptpress.com.cn
Email: txxb@bjxintong.com.cn
ISSN 1000-436X
CN 11-2102/TN
Visited
Total visitors:
Visitors of today:
Now online: