Loading...
Office

Table of Content

    20 June 2019 Volume 46 Issue 3
      
    Very high resolution SAR imaging method combined with motion estimation
    JING Guobin,LI Ning,SUN Guangcai,XING Mengdao
    Journal of Xidian University. 2019, 46(3):  1-7.  doi:10.19665/j.issn1001-2400.2019.03.001
    Abstract ( 693 )   HTML ( 110 )   PDF (2073KB) ( 296 )   Save
    Figures and Tables | References | Related Articles | Metrics

    For very high resolution synthetic aperture radar(VHR-SAR), SAR image quality is affected by nonlinear trajectory. To solve this problem, we propose an approach for very high resolution imaging based on motion error estimation. First, inertial navigation system(INS)information is projected on the slant-plane to obtain the motion error, and the coarse range-variant error is compensated by interpolation operation. A modified range migration algorithm(RMA) based on the new Stolt interpolation kernel is proposed and a corresponding motion error estimation method is also proposed to estimate phase errors by the use of sub-aperture error estimation and full aperture error fitting. Then the map-drift(MD) algorithm is used to obtain residual azimuth-variant phase errors estimation. After the above procedures, we obtain the VHR-SAR image with the resolution of 0.05 m, and experimental results of X-band and Ku-band airborne data demonstrate the effectiveness of the proposed method.

    Advances in measurement methods from transient to full stability
    BAI Lina,WANG Yifei,ZHOU Wei,HUANG Libei,WANG Yuan
    Journal of Xidian University. 2019, 46(3):  8-13.  doi:10.19665/j.issn1001-2400.2019.03.002
    Abstract ( 413 )   HTML ( 33 )   PDF (1262KB) ( 103 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In this paper, the edge effect is extended to the digital domain. The digital edge is combined with the digital phase discrimination algorithm to obtain the transient frequency stability, the transient stability increased from 10 -4/100 ns to 10 -5/100 ns.The invention solves the problems that the analog phase coincidence detection technology has high requirements for the hardware circuit, that the device has drifts, and that the technology cannot be extended to the global stability. The digital method can be extended to short-term, medium-and long-term stability based on transient stability, and a more comprehensive description of frequency source phase noise from the aspects of root cause and effect can be given.

    Adaptive quasi-newton projection algorithm for sparse recovery
    ZHOU Xueqin,FENG Xiangchu,JING Mingli
    Journal of Xidian University. 2019, 46(3):  14-19.  doi:10.19665/j.issn1001-2400.2019.03.003
    Abstract ( 452 )   HTML ( 27 )   PDF (1573KB) ( 113 )   Save
    Figures and Tables | References | Related Articles | Metrics

    An adaptive quasi-Newton projection sparse restoration algorithm is proposed to solve the problem that greedy algorithms need to know the sparsity in advance. The algorithm consists of two layers: the sparsity of the signal is estimated by using the threshold operator in the outer loop, and the sparse signal is recovered based on the quasi-Newton projection algorithm under the current sparsity of the outer iterative estimation in the inner loop. Simulation results show that this method has a better approximation performance and recovery rate of sparse signals with unknown sparsity compared with the greedy algorithms with known sparsity in advance.

    RFCcertDT: a testing tool for certificate validation in SSL/TLS
    CHEN Chu
    Journal of Xidian University. 2019, 46(3):  20-25.  doi:10.19665/j.issn1001-2400.2019.03.004
    Abstract ( 623 )   HTML ( 26 )   PDF (1322KB) ( 79 )   Save
    Figures and Tables | References | Related Articles | Metrics

    To solve the problems such as low efficiency of existing tools which are used to check certificate validation modules in the implementation of Secure Sockets Layer or Transport Layer Security protocol, a novel tool named RFCcertDT for differential testing of certificate validation modules is designed and developed. First, rules of certificates are automatically extracted, updated, classified and expressed based on the Request for Comments specified by the Internet Engineering Task Force, and certificates which act as test cases are generated based on the dynamic symbolic execution technique. Second, the generated certificates and the token-ring testing are used to conduct differential testing of a single or multiple certificate validation modules and generate bug reports. Experimental results show that the RFCcertDT is more efficient than existing tools. In summary, the RFCcertDT tests certificate validation modules with high efficiency and is helpful to reinforcing the software security of the Secure Sockets Layer or Transport Layer Security protocol.

    Effective construction method for locally repairable codes
    WANG Xiangxu,CHE Shuling,JI Yuhui
    Journal of Xidian University. 2019, 46(3):  26-31.  doi:10.19665/j.issn1001-2400.2019.03.005
    Abstract ( 381 )   HTML ( 30 )   PDF (1766KB) ( 77 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In order to optimize average information locality, average locality and update complexity of Locally Repairable Codes(LRC) at the same time, and reduce the algorithm complexity of constructing LRC, a new construction method is proposed by analyzing the characteristics of the Tanner graph. First, the local check nodes are designed. On the basis of the fact that the LRC’s average information locality is optimal, by distinguishing the characteristics of the local groups, the average locality is optimized by construction of overlapping groups; second, the update complexity is optimized by designing the global check nodes; finally, the algorithm complexity is analyzed and compared. The results show that the proposed method optimizes the performance above and reduces the complexity of constructing LRC.

    Fast estimation method for a two-dimensional planar array based on subspace reconstruction
    ZHANG Zhenghe,LI Yiyang,ZHANG Linrang,LIU Nan
    Journal of Xidian University. 2019, 46(3):  32-38.  doi:10.19665/j.issn1001-2400.2019.03.006
    Abstract ( 447 )   HTML ( 80 )   PDF (1566KB) ( 160 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of high computational complexity in the estimation of the high-precision direction of arrival of a two-dimensional array, a fast estimation method for high-precision and low computational complexity of a two-dimensional array is proposed. This method first uses the rotational a invariant relationship between the subarrays to complete the two-dimensional angle prediction. Then the estimated angle is used as the prior information, and the signal subspace of the subarray is used to reconstruct the signal subspace of the planar array, and the gradient search is performed to achieve accurate estimation of the two-dimensional angle. Among them, reconstruction of the signal subspace for the planar array effectively reduces the computational complexity when subspace estimation is performed. The gradient search method is used for local search, which declines the computational complexity during search. The estimation accuracy consistent with the classical two-dimensional MUSIC algorithm is obtained. Computer simulation results verify the effectiveness of the proposed algorithm.

    Hop timing estimation method by exploiting sparse Bayesian inference
    ZHANG Chaozhu,WANG Yu,JING Fulong
    Journal of Xidian University. 2019, 46(3):  39-44.  doi:10.19665/j.issn1001-2400.2019.03.007
    Abstract ( 342 )   HTML ( 20 )   PDF (1628KB) ( 75 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In order to improve the performance of hop timing estimation when the frequencies of frequency hopping (FH) signals are not in the known frequency set, a novel method is developed based on the sparse Bayesian inference (SBI). The proposed method first sets the frequency bias in the signal model. The updating rules of the parameters are calculated based on the Dirichlet process and SBI, and then the frequency bias is utilized to correct the dictionary matrix. Finally, the sparse matrices and the hop timing estimation can be obtained. Simulation results demonstrate that compared to the existing methods, the proposed method can obtain higher correct ratios of the hop timing estimation and a better performance of the spectrum estimation.

    Android malware detection model
    YANG Hongyu,NA Yuzhuo
    Journal of Xidian University. 2019, 46(3):  45-51.  doi:10.19665/j.issn1001-2400.2019.03.008
    Abstract ( 719 )   HTML ( 101 )   PDF (1382KB) ( 151 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the low detection accuracy of traditional Android malware detection technology, an Android malware detection model based on the Dual-channel Convolutional Neural Network (DCNN) is proposed. First, it extracts the software original opcode sequence and generates the command function sequence. Then, it uses these two sequences as the input to the two channels of the convolutional neural network to iteratively train and adjust the neurons weights in each layer. Finally, the trained detection model implements the Android malware detection. Experimental results demonstrate that our detection model has a good detection accuracy and detection precision for malware.

    Method for retrieving the teaching image based on the improved convolutional neural network
    LIU Daohua,CUI Yushuang,ZHAO Yansong,SONG Yuting,WANG Jinghui
    Journal of Xidian University. 2019, 46(3):  52-58.  doi:10.19665/j.issn1001-2400.2019.03.009
    Abstract ( 483 )   HTML ( 26 )   PDF (1534KB) ( 156 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the loss of feature information caused by the convolution neural network in extracting image features and the reduction of high-dimensional image feature data, an image retrieval optimization scheme based on the improved convolution neural network is proposed. First, the image features are extracted through the convolutional layer of fusion, and a full connection layer is added between the convolutional layers of fusion to reduce the loss of image feature information. Then the PCA is used to effectively reduce the dimension of high-dimensional characteristic data and the high-dimensional feature vectors are mapped to the low-dimensional vector space. Finally, the cosine similarity method is used to match the similarity to achieve similar image retrieval. The proposed method is compared with classical methods such as LeNet-L and LeNet-5 in the performance of image retrieval. Experimental results show that the proposed retrieval method improves the recall rate and the average precision rate by at least 3%27.3% compared with classical methods.

    Analysis of the performance of the multichannel S-ALOHA by the power ramping scheme
    JIAN Xin,WANG Fang,SONG Jian,FANG Wei,JIANG Xin,ZENG Xiaoping,TAN Xiaoheng
    Journal of Xidian University. 2019, 46(3):  59-64.  doi:10.19665/j.issn1001-2400.2019.03.010
    Abstract ( 393 )   HTML ( 12 )   PDF (1337KB) ( 65 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of the rapid increase in power consumption caused by retransmission under the massive machine type devices concurrent access to the network. Therefore, in this paper, by use of the number of contending devices that transmit the j-th preamble at the i-th random access slot as the state variable, we present a transient performance analysis method (especially the power consumption and access delay model) for the multi-channel S-ALOHA by the power ramping scheme as well as a simplified form under stable access attempts. By taking two kinds of machine type communications traffic models proposed by the 3GPP as examples, numerical simulation is conducted to validate the effectiveness of the proposed performance analysis method as well as its simplified form, to analyze the effects of the number of users, the size of the back-off window, and the maximum number of retransmissions on the performance of the multi-channel S-ALOHA by the power ramping scheme, and to propose an optimization strategy for appropriately extending the back-off window to exchange power consumption with delay. These practices together can provide a good reference for performance analysis and optimization design of the random access channel under the massive machine type devices concurrent access to the netwok.

    Method for the verification of safety requirements of avionics systems
    DING Ming,ZHANG Shuling,ZHANG Chen,Zhang Jun
    Journal of Xidian University. 2019, 46(3):  66-73.  doi:10.19665/j.issn1001-2400.2019.03.011
    Abstract ( 345 )   HTML ( 90 )   PDF (2081KB) ( 125 )   Save
    Figures and Tables | References | Related Articles | Metrics

    To ensure the correctness of avionics systems safety assessment, a model-based system safety requirements description and verification approach is proposed. First, hazard use cases are established and safety requirements are captured according to the system functional requirements, safety objectives and failure states. Second, the state machine diagrams with functional failure are used to describe the system functional model including safety requirements. The safety extended hierarchical automata are used as the intermediate models, and the formal description of the system functional model is realized by the transformation algorithm. Finally, the correctness of safety requirements is verified by model checking. Case studies are presented to show that this method can verify whether the designed system's functions meet the safety attributes and improve the accuracy and efficiency of safety assessment.

    Speech enhancement based on discriminative joint sparse dictionary alternate optimization
    JIA Hairong,WANG Weimei,WANG Yan,PEI Junhua
    Journal of Xidian University. 2019, 46(3):  74-81.  doi:10.19665/j.issn1001-2400.2019.03.012
    Abstract ( 404 )   HTML ( 14 )   PDF (1734KB) ( 67 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In the speech enhancement of the joint sparse dictionary, due to the similarity of the joint dictionary, the speech and noise confusion is generated in the sparse reconstruction stage, which will generate the speech distortion problem. In view of this, an objective function under the Fisher criterion is proposed in the training stage. This function contains the distinguishing constraint of speech and noise, and adjusts the weights with the balance factor related to the signal change, so as to make the confusion error as small as possible. At the same time, in order to make the objective function converge, an algorithm is designed for alternately optimizing the dictionary and sparse coefficients. The algorithm is iterated to find the needed dictionary and sparse coefficient, and completes the output of the speech dictionary and noise dictionary. A joint dictionary with dissimilarity and good discrimination performance is obtained. In the enhancement phase, the noisy speech signal is represented sparsely in the joint dictionary, and the speech amplitude spectrum and noise amplitude spectrum are estimated. Finally, combining the advantages of the Wiener filter and ideal binary mask, a new soft mask filter is proposed. The residual noise is further eliminated. Through the experiments of noisy speech with different signal-to-noise ratios (SNR), the new algorithm has high SNR and auditory perception evaluation, which verifies the effectiveness of the new algorithm in improving speech performance.

    Algorithm for identification of fine-grained vehicles based on singular value decomposition and central metric
    JIANG Xingguo,WAN Jinzhao,CAI Xiaodong,LI Haiou,CAO Yi
    Journal of Xidian University. 2019, 46(3):  82-88.  doi:10.19665/j.issn1001-2400.2019.03.013
    Abstract ( 332 )   HTML ( 16 )   PDF (2458KB) ( 137 )   Save
    Figures and Tables | References | Related Articles | Metrics

    To solve the problem of the low recognition rate caused by the redundancy feature on the image classification, an algorithm for identification of fine-grained vehicles based on singular value decomposition and central metric is proposed. First, a convolutional neural network based on singular value decomposition is designed. With the method, the weight matrix of the fully connected layer is decomposed by the singular value, then it is re-assigned and fine-tuned. In this way, the redundant features with correlation can be removed, and the discriminative features of fine-grained levels can be learned. Second, a fusion loss method for different learning features is utilized, in which the losses of the central distance and the classification are fused in a weighted way to shorten the distance between the learned feature classes. Finally, experimental results prove that the test accuracy of the Residual Network (ResNet) framework is up to 93.02% in the Cars-196 fine-grained model data set. The proposed model outperforms the bilinear and attention model. Furthermore, the extended experiments prove that the method is applicable to other network frameworks.

    Algorithm for scheduling energy-saving frame-based tasks on the heterogeneous multi-core SoC
    XIA Jun,YANG Yi,LIN Yi
    Journal of Xidian University. 2019, 46(3):  89-95.  doi:10.19665/j.issn1001-2400.2019.03.014
    Abstract ( 255 )   HTML ( 16 )   PDF (1722KB) ( 76 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the high energy consumption of the heterogeneous multi-core system on the chip, an efficient two-level optimization algorithm for frame task assignment is proposed. The algorithm defines the problem of minimizing system energy consumption as a nonlinear integer programming problem. The first-level optimization is used to relax and solve the problem. The second-level optimization uses the rounding function with the decision threshold to update the assignment matrix, and then constructs a new planning problem and solves it. Finally, combining the two-level optimization results to formulate the final assignment matrix. Simulation shows that compared with some heuristic algorithms, the energy consumption of the algorithm is reduced by 20%50%, which is close to the theoretical optimal energy consumption. Compared with other optimization algorithms with similar energy consumption, the complete time is reduced by 54%75%.

    Waveform and detection threshold self-adaption algorithm for maneuvering target tracking
    WANG Shuliang,BI Daping,RUAN Huailin
    Journal of Xidian University. 2019, 46(3):  96-101.  doi:10.19665/j.issn1001-2400.2019.03.015
    Abstract ( 362 )   HTML ( 18 )   PDF (1511KB) ( 148 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The existing adaptive waveform and detection threshold algorithms for radar target tracking focus mostly on the one-dimensional target with the range and range rate as measurements. As it ignores the effect of the angle on target tracking, it is impossible to track and locate the target. A joint adaptive waveform and detection threshold algorithm for two-dimensional maneuvering target tracking in clutter background is proposed. First, the traditional theory based on the time delay-Doppler resolution cell is further extended to design a resolution cell with the “prism” structure, which includes the range-range rate and azimuth measurements. Then, an approximate joint expression for measurement error covariance, containing the waveform parameter and detection threshold, is given. Finally, inspired by the cognitive radar, the next waveform parameters and detection threshold are adaptively selected at the cost of minimizing the trace of filtering error covariance to improve the tracking performance of the system. Simulation results show that the performance of the waveform and detection threshold self-adaption algorithm is obviously superior to the fixed parameter algorithm.

    Effective method for analysis of LFM signals in the CFCR domain
    JING Fulong,ZHANG Chunjie,SI Weijian,WANG Yu,JIAO Shuhong
    Journal of Xidian University. 2019, 46(3):  102-108.  doi:10.19665/j.issn1001-2400.2019.03.016
    Abstract ( 307 )   HTML ( 19 )   PDF (1561KB) ( 99 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In modern electronic warfare, to solve the problems of high computation cost, poor anti-noise performance, and low estimation accuracy of no delay Linear Frequency Modulation (LFM) signal methods under a low Signal-to-Noise Ratio (SNR), an effective method for analysis of no delay LFM signals is proposed. By using Local Scale Fourier Transform (LSFT) and Fourier transform, the LFM signal is transformed into a two-dimensional domain named the Centroid Frequency-Chirp Rate (CFCR) domain. In the CFCR domain, the energy of the LFM signal is effectively accumulated to form a peak which is easy to detect. By locating the peak, the parameter estimation of the LFM signal is obtained. In order to improve the estimation accuracy and reduce the computational cost, a two-scale estimation strategy is adopted in this paper. The algorithm has low computational complexity and is easy to implement. The simulation results verify that the algorithm has a good anti-noise performance and estimation accuracy under a low SNR.

    Spectral-spatial classification of hyperspectral images using deep Boltzmann machines
    YANG Jiangong,WANG Xili,LIU Shigang
    Journal of Xidian University. 2019, 46(3):  109-115.  doi:10.19665/j.issn1001-2400.2019.03.017
    Abstract ( 397 )   HTML ( 19 )   PDF (1567KB) ( 67 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In the classification of hyperspectral images, extracting more expressive information on the ground objects from the data is a key problem in the classification method. For the purpose of improving classification accuracy, a classification method based on the Deep Boltzmann Machine (DBM) is proposed. First, PCA whitening is performed on the hyperspectral image data, and spatial information on pixels is extracted, followed by the combination with the spectral information on the pixel to construct hybrid spectral-spatial information on pixels; Second, deep features are extracted from the spectral-spatial information on pixels by the multi-layer DBM model; finally, the extracted features are classified based on the logistic regression model. The Deep Boltzmann Machine can extract features from high-dimensional data using prior knowledge, and the extracted features inherently represent the spatial structure and spectral characteristics of objects. Experimental results show that the proposed method can effectively improve the classification accuracy of hyperspectral images.

    Blind interference suppression based on precoding in two-path MIMO relay networks
    DENG Ran,DOU Gaoqi,GAO Jun,WANG Qingbo,CHEN Yang
    Journal of Xidian University. 2019, 46(3):  116-122.  doi:10.19665/j.issn1001-2400.2019.03.018
    Abstract ( 317 )   HTML ( 91 )   PDF (1328KB) ( 62 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Aiming at the problem of residual inter-relay interference (IRI) caused by the channel estimation error in amplify-and-forward two-path MIMO relay networks, a blind interference suppression scheme based on row space precoding under unknown channel state information (CSI) is proposed. In the new scheme, the desired received signal and IRI signal are mapped to an orthogonal subspace independent of CSI by alternating the row space precoding of the transmitted signal, so that the blind interference suppression of the IRI signal and relay noise under unknown channel state information is realized, and the optimal precoding design is given from the angle of the maximizing signal-to-noise ratio. Simulation results show that the proposed scheme can effectively avoid the impact of the link channel estimation error on the IRI suppression algorithm, and is superior to the traditional CSI-based interference suppression scheme in system performance and capacity.

    Sparse-aperture ISAR imaging algorithm
    ZENG Chuangzhan,ZHU Weigang,JIA Xin
    Journal of Xidian University. 2019, 46(3):  123-129.  doi:10.19665/j.issn1001-2400.2019.03.019
    Abstract ( 427 )   HTML ( 28 )   PDF (1675KB) ( 130 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Under sparse aperture conditions, some problems arise with inverse synthetic aperture radar imaging such as low azimuth resolution and susceptibility to noise. To solve them, the two-dimensional sparseness of a target is used to transform the imaging problem into the sparse signal reconstruction problem under the multiple measurement vectors model. The zero norm-least mean square algorithm is processed in parallel to improve the efficiency. The optimal step-size formula is used instead of the fixed step-size to avoid the influence of the improper step-size on the convergence speed and accuracy. And the smoothed zero norm is introduced to approximate the zero norm to improve the reconstruction accuracy and noise immunity ability. In comparison with existing methods, the proposed algorithm can obtain a clearer target image, which is robust to noise and requires less computation. The effectiveness of the proposed method is verified by simulation and the real data processing result.

    High performance reconfigurable accelerator for deep convolutional neural networks
    QIAO Ruixiu,CHEN Gang,GONG Guoliang,LU Huaxiang
    Journal of Xidian University. 2019, 46(3):  130-139.  doi:10.19665/j.issn1001-2400.2019.03.020
    Abstract ( 449 )   HTML ( 20 )   PDF (1894KB) ( 69 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In deep convolutional neural networks,the diversity of channel sizes and kernel sizes makes it difficult for existing accelerators to achieve efficient calculations. Therefore, based on the biological brain neuron mechanism, a deep convolutional neural network accelerator is proposed which can provide not only multiple clustering methods for brain-like neurons and link organization among brain-like neurons towards different channel sizes, but also three mapping methods for different convolution kernel sizes. The accelerator implements efficient reuse of local memory data, which greatly reduces the amount of data movement and improves the computing performance. Tested by the object classification network and object detection network, the accelerator's computational performance is 498.6 GOPS and 571.3 GOPS, respectively; the energy efficiency is 582.0 GOPS/W and 651.7 GOPS/W, respectively.

    Design of an ADC with the submicron process for micromechanical accelerometers
    YU Jianhai,YIN Liang
    Journal of Xidian University. 2019, 46(3):  140-147.  doi:10.19665/j.issn1001-2400.2019.03.021
    Abstract ( 314 )   HTML ( 11 )   PDF (2765KB) ( 91 )   Save
    Figures and Tables | References | Related Articles | Metrics

    A 16 bits high-order ∑Δ analog-to-digital converter is proposed based on the submicron process to meet the application requirements for the digital output of high-performance micromechanical accelerometers. The fifth-order feedforward single bit quantization topology is adopted to achieve the low-distortion analog-to-digital converter output. The front-stage integrator adopts the gain-enhanced folded-cascode operational amplifier structure to improve the low-frequency gain and reduce the influence of gain nonlinearity on analog-to-digital converter distortion. The optimization of the integrator output swing and the application of the switched-capacitor common mode feedback circuit reduce the overall power consumption. Test results show that the distortion is lower than 90dB when the sampling frequency is 8MHz and a little higher than 90dB when the sampling frequency is reduced to 4MHz for the low power dissipation mode. This high integration and large dynamic range fifth-order feedforward sigma-delta analog-to-digital converter topology achieves 16 bits resolution, and it can be applied for digitizing the output signal of micromechanical accelerometers.

    Face image super-resolution with an attention mechanism
    CHEN Xiaofan,SHEN Haijie,BIAN Qian,WANG Zhenduo,TIAN Xinzhi
    Journal of Xidian University. 2019, 46(3):  148-153.  doi:10.19665/j.issn1001-2400.2019.03.022
    Abstract ( 495 )   HTML ( 84 )   PDF (1453KB) ( 122 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Because of the limitation of the imaging equipment, the face images captured by it usually have the problem of low resolution and low quality. This paper proposes a method based on the generative adversarial network and attention mechanism for the multi-scale super-resolution of face images. In this paper, the deep residual network and the deep convolutional neural network (VGG-net) are used as the generator and the discriminator, respectively. The attention modules are combined with the residual blocks in the deep residual network to reconstruct face images which are highly similar to the high-resolution images and difficult for the discriminator to distinguish. Experimental results demonstrate the effectiveness of the proposed method in multi-scale face image super-resolution and the important role of the attention mechanism in image detail reconstruction.

    Matrix optimization synthesis method for the cross-coupled filter with frequency dependent couplings
    LI Gang
    Journal of Xidian University. 2019, 46(3):  154-159.  doi:10.19665/j.issn1001-2400.2019.03.023
    Abstract ( 432 )   HTML ( 18 )   PDF (1353KB) ( 131 )   Save
    Figures and Tables | References | Related Articles | Metrics

    The traditional coupling coefficients in the cross-coupled filter model do not accurately characterize the frequency characteristics of the coupled structure under the broadband condition. To solve this problem, a matrix optimization synthesis method for the N+2 cross-coupled filter with frequency dependent coupling coefficients is proposed. First, the N+2 frequency dependent coupling matrix of a given topology is transformed into a frequency independent coupling matrix by matrix scaling and similarity transformation. Then, the objective function is constructed by approaching the eigenvalues of the N+2 canonical coupling matrix. Finally, the N+2 frequency dependent coupling matrix with a specified topology can be obtained by the gradient optimization algorithm. Numerical synthetical results of different topologies prove that the proposed method can efficiently solve the synthesis problem of filters with complex frequency dependent couplings.

    Design of a 52 GHz balanced frequency doubler
    YU Wenmin,LU Yumin
    Journal of Xidian University. 2019, 46(3):  160-166.  doi:10.19665/j.issn1001-2400.2019.03.024
    Abstract ( 415 )   HTML ( 13 )   PDF (1755KB) ( 155 )   Save
    Figures and Tables | References | Related Articles | Metrics

    In order to generate a high frequency signal source, a 52 GHz balanced frequency doubler with high efficiency and good fundamental rejection is designed. The doubler is fabricated in a 0.13 μm SiGe Bipolar junction transistor by the Complementary Metal Oxide Semiconductor (BiCMOS) technology. A balun is used to split the single-ended signal into differential signals. A second harmonic reflector reduces the effect of the feedback signal of the second harmonic on the output signal and improves the output power. The measurement results based on the probe station demonstrate that the insertion loss of the balun is about 1 dB from 20 GHz to 26.5 GHz. With an input power of 0.5 dBm, the doubler delivers an output second harmonic power of 2.3 dBm with 34 dBc of fundamental rejection. The doubler consumes a dc power of about 21.8 mW with the corresponding power-added efficiency (PAE) of 2.5%.

    Improved spectral clustering community detection algorithm by combining the probability matrix
    ZHANG Shubo,REN Shuxia,WU Tao
    Journal of Xidian University. 2019, 46(3):  167-172.  doi:10.19665/j.issn1001-2400.2019.03.025
    Abstract ( 333 )   HTML ( 13 )   PDF (1369KB) ( 93 )   Save
    Figures and Tables | References | Related Articles | Metrics

    Due to the fact that the similarity graphs of most spectral clustering algorithms carry lots of wrong community information, a probability matrix and a novel improved spectral clustering algorithm for community detection are proposed. First, the Markov process is used to calculate the transition probability between nodes, and the probability matrix of a complex network is constructed by the transition probability. Then the similarity graph is reconstructed with the mean probability matrix. Finally, the community detection is achieved by optimizing the normalized cuts function. The proposed algorithm is compared with other classical algorithms on artificial networks and real networks. The results show that our algorithm can cluster the community more accurately and has a better clustering performance.

    Design of the data path of the high speed arbitrary waveform generator
    XUE Dekuan,LI Guoyang,PAN Xue,FAN Wei,LI Xuechun,ZHU Jianqiang
    Journal of Xidian University. 2019, 46(3):  173-179.  doi:10.19665/j.issn1001-2400.2019.03.026
    Abstract ( 285 )   HTML ( 14 )   PDF (2256KB) ( 113 )   Save
    Figures and Tables | References | Related Articles | Metrics

    It is difficult to increase the output bandwidth and memory depth of an arbitrary waveform generator. A scheme for the data path of the high speed arbitrary waveform generator based on the Field Programmable Gate Array (FPGA) has been developed. In this scheme, the multi-chip synchronous dynamic random access memory synchronous output and parallel-to-serial conversion technology are used to improve the output bandwidth and memory depth of the data path. The data path implements data writing, reading, parallel-to-serial conversion, framing, 8bit/10bit encoding, and serialization based on the Vivado platform. The processed waveform data is serially outputted through FPGA's transceiver according to the JESD204B transmission protocol. Simulation results show that the output waveform data is exactly the same as the processed waveform data, which verifies the correctness of the data path. Experimental results show that the data path achieves a 12 GHz sampling rate, a 16 bit vertical resolution, and a 4 Gsa waveform memory. The data path of the arbitrary waveform generator is effective and reliable.

    Passive localization of the signal source based on RSS and TDOA combination in the non-line-of-sight environment
    YAN Qianli,WAN Pengwu,LU Guangyue,HUANG Qiongdan,WANG Jin,LI Yixiao
    Journal of Xidian University. 2019, 46(3):  180-188.  doi:10.19665/j.issn1001-2400.2019.03.027
    Abstract ( 309 )   HTML ( 14 )   PDF (1491KB) ( 108 )   Save
    Figures and Tables | References | Related Articles | Metrics

    This paper proposes a signal source passive localization algorithm based on the measurements of the energy and time domain in non-line-of-sight(NLOS) environment to address the decline in localization accuracy. By utilizing the information of the received signal strength (RSS) and time difference of arrival(TDOA), the non-convex localization problem is converted to a generalized trust domain subproblem(GTRS) by introducing the range square(RS) and the weighted least squares(WLS) method, with the position obtained by a bisection procedure. The iterative method is used to estimate the NLOS deviation and refine the position accuracy. Finally, Cramer Rao Lower Bound(CRLB) and computational complexity have been analyzed. Simulation results demonstrate that the proposed algorithm is robust and will be close to CRLB in NLOS environment.