Current Issue

• • 2020, Vol. 43 No. 4 Published date:28 August 2020 Last issue Next issue

  PAPERS

  • Robot Assembly Technology Based on Compliance Control
  • YU Yang, WANG Yao-bing, WEI Shi-min, MA Ru-qi, TANG Ling
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 1-6. DOI:10.13190/j.jbupt.2019-227
  • Abstract ( 1054 )     HTML     　　
  • Aiming at the problem that the difficulty of compliant assembly of robot in complex contact environments,a compliant assembly method based on accurate acquisition of force information and improved hybrid force/position control algorithm is presented.In the method,after bias and load gravity compensation are performed on the robot end force sensor,the real contact force of the robot end-effector at the assembly contact point is calculated in real time by matrix transformation,and the motion of the robot follows velocity-force relationship of the hyperbolic tangent during force control.Experiments show that the robot did not shake significantly during the assembly process,and the proposed algorithm has a good compliant assembly effect.
  • References | Supplementary Material | Related Articles

  • An Optimization Method for Urban Underground Parking Lots Allocation Based on Polygon Decomposition
  • HUANG Yi-bin, YANG He, ZHOU Zhong-bing, LIU Xiao
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 7-14. DOI:10.13190/j.jbupt.2019-212
  • Abstract ( 866 )     HTML     　　
  • To assist designers in designing large-scale urban underground parking lots characterized by irregular contour,large area and various obstacles,a mixed integer linear program model based on polygon decomposition is proposed to optimize the allocation of parking lots and roads together in the same direction within local irregular contours.This model not only considers the optimization of parking angles and position,but also has the ability to deal with the designing of parking lots and roads in contours of arbitrary shape.A decomposition method based on particle swarm optimization algorithm is presented to solve the model and engineering drawings were used to validate its efficiency.It is shown that the proposed method can arrange local irregular contours efficiently and help designers to find the optimal design of parking lots.Via visualization and human-computer interaction,the designers' development efficiency can be largely improved.
  • References | Supplementary Material | Related Articles

  • A Dynamic Self-Corrected Minimum Sum Decoding Algorithm for LDPC Codes
  • CHEN Rong, CHEN Lan
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 15-20. DOI:10.13190/j.jbupt.2019-222
  • Abstract ( 594 )     HTML     　　
  • Aiming at the trade-off between the decoding complexity and the decoding performance of low-density parity check (LDPC) codes, and improving the reliability and applicability of the decoding algorithm, a dynamic self-corrected minimum sum(DSCMS)algorithm is proposed based on the self-corrected minimum sum(SCMS)algorithm. In the process of iterative decoding, the algorithm sets the threshold according to the variable node message, clarifies the judgement of the message reliability in SCMS, and improves the error characteristics and convergence characteristics of the algorithm. Simulation results show that the error performance and convergence performance of DSCMS are better than those of SCMS. When the coding rate is 1/2, the number of iterations of DSCMS can be reduced by up to 7.15% compared with SCMS.
  • References | Supplementary Material | Related Articles

  • Quaternion-Based Particle Swarm Optimization Algorithms for Mobile Communication Network Coverage
  • QIN Yun-hui, HUANGFU Wei, LONG Ke-ping
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 21-26. DOI:10.13190/j.jbupt.2019-260
  • Abstract ( 550 )     HTML     　　
  • Aiming at the inherent correlation of azimuths and tilts of the antennas installed on the base stations, a quaternion-based particle swarm optimization algorithms is proposed to optimize the coverage performance for mobile networks, in which the quaternions represents the antenna orientations, and the rotations formed by the multiplication in the quaternion field ensures that the feasible solutions, that is the particles, update along the shortest paths. Moreover, the author considers the process to perform infinitesimal movements towards different directions in turn and thus introduced a blending quaternion-based particle swarm optimization algorithm to overcome the problems that the destination of the particle movement depends upon the order of directions including along the inertial velocity, towards the individual historical optimal solution and towards the global optimal solution, which is indeed caused by the anti-commutative law of quaternions. Simulations show that the proposed algorithms, especially the latter, perform better than the canonical particle swarm algorithm, firefly algorithm and genetic algorithm both in the convergence efficiency and the final optimized coverage.
  • References | Supplementary Material | Related Articles

  • Design of Dual-Band Band-Pass Filter Based on Unequal Length Cross Resonator
  • LA Dong-sheng, GUAN Xin, LI Yu-ying, LI Hong-cheng, GUO Jing-wei
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 27-31. DOI:10.13190/j.jbupt.2019-268
  • Abstract ( 601 )     HTML     　　
  • A simple dual-band band-pass filter is proposed. It is composed of an unequal-length cross-shaped resonator and parallel coupled lines feed structures. Due to the symmetry of the filter distribution circuit, the transmission zero and transmission pole are analyzed using the even-odd mode analysis method. The designed filter has 3 transmission zeros and 4 transmission poles. The positions of the transmission zeros do not change with the changing of the impedance parameters. Among 4 transmission poles, the first even-mode transmission pole and the first odd-mode transmission pole constitute the first passband, and the remaining two transmission poles constitute the second passband. Compared with the equal-length cross-shaped filter, this structure has one extra transmission pole. The passband bandwidth can be adjusted by adjusting the position of the transmission poles. Then the physical parameters of the designed filter are given. The simulated results of the designed filter are obtained. Finally, the designed filter is fabricated and measured. Simulations are basically consistent with the measured ones, which verify the correctness of the design theory.
  • References | Supplementary Material | Related Articles

  • Parameter Estimation of the 3D-GTD Model Based on a Modified 3D-ESPRIT Algorithm
  • ZHENG Shu-yu, ZHANG Xiao-kuan, ZONG Bin-feng, XU Jia-hua
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 32-38. DOI:10.13190/j.jbupt.2019-261
  • Abstract ( 611 )     HTML     　　
  • The noise robustness and parameter estimation performance of the classical three-dimensional estimating signal parameter via rotational invariance techniques (3D-ESPRIT) algorithm are poor when estimating parameters of the three dimensional geometric theory of diffraction(3D-GTD) model at low signal-to-noise ratio (SNR). To solve this problem, a modified algorithm is proposed. The modified algorithm improves the parameter estimation accuracy by constructing conjugated matrix of the original back-scattered data, averaging the covariance matrices and performing quadratic power on the total covariance matrix to get another novel covariance matrix. The modified algorithm can broaden the differences between the eigenvalues of noises and signals, which is equivalent to increase SNR. Based on the parameters estimated by different algorithms, root-mean-square-errors of different parameters can be compared. Simulations verify that the parameter estimation performance and noise robustness of the modified algorithm are better than the classical 3D-ESPRIT algorithm and the improved algorithm without pair.
  • References | Supplementary Material | Related Articles

  • Travel Recognition Method for Fixed-Point Trajectory Data
  • ZHANG Kuan, ZHAO Zhuo-feng, GUO Wei-qiang
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 39-47. DOI:10.13190/j.jbupt.2019-216
  • Abstract ( 581 )     HTML     　　
  • To satisfy the requirements of long-periodic fixed-point trajectory travel recognition,a dynamic threshold travel recognition method for fixed point trajectory data is proposed. At first,use hierarchical clustering to determine the spatial-temporal multiple granularity parameters which relate to the threshold. Then count historical records according to parameters to calculate the threshold corresponding to each parameter. Last,execute trajectory segmentation process with spatial-temporal threshold to get the precise travel recognition result. Experiment based on fixed-point trajectory data from real world city shows that using spatial-temporal dynamic threshold method to recognize travel in fixed point trajectory data is superior to the traditional stable and single threshold method on accuracy and coverage.
  • References | Supplementary Material | Related Articles

  • An Edge-Based Differential Method for Data Protection in Sensor-Cloud
  • MEI Ya-xin, SHEN Xue-wei, ZHAO Dan, WANG Tian
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 48-53,75. DOI:10.13190/j.jbupt.2019-208
  • Abstract ( 487 )     HTML     　　
  • To improve the storage mechanism to provide a general privacy protection service, a data protection model based on edge computing is presented. The original data collected by wireless sensor networks is differentiated by privacy computing algorithm on edge servers. A small amount of core data is stored on edge servers and local servers,while other data is transferred to the cloud for storage. Based on the model,even if the data stored in the cloud is leaked,the original data cannot be recovered,so the privacy of the data can be ensured. The differential storage method reduces the data sent to the cloud and decreases the communication cost and storage cost. Both theoretical analyses and a large number of experiments have proved the effectiveness of the proposed method.
  • References | Supplementary Material | Related Articles

  • Multi-Slot Energy Harvesting Wireless Communication over Nakagami-m Channel Fading
  • WANG Ming-wei, LI Hui-zhen
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 54-60. DOI:10.13190/j.jbupt.2019-214
  • Abstract ( 599 )     HTML     　　
  • Due to the fading of the channel,the energy harvester converts the harvested electromagnetic wave energy into a power source for transmitting wireless signals again,and its power has random dynamic characteristics. Aiming at the wireless communication environment with Nakagami-m channel fading,linear radio frequency energy harvesters combining with multi-slot "harvest-storage-use" and "harvest-use" schemes to realize EH are proposed. The effective throughput of the "harvest-storage-use" EH scheme and the average bit error rate of binary digital coherent and incoherent demodulation of the "harvest-use" EH scheme are studied and analyzed. The simulation results show that the wireless communication adopting the "harvest-storage-use" strategy has the optimal number of time slots to achieve the best effective throughput,while the wireless communication adopting the "harvest-use" EH scheme should use a small number of time slots to balance the bit error rate and communication delay.
  • References | Supplementary Material | Related Articles

  • Performance Trade-off Method for Energy Efficiency and Spectral Efficiency in Massive-MIMO System
  • LI Min-zheng, DING Jian, LIU Ning, WANG Hao
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 61-67. DOI:10.13190/j.jbupt.2019-163
  • Abstract ( 759 )     HTML     　　
  • In massive-multiple input multiple output (massive-MIMO) multi-user system, the existing energy efficiency (EE) and spectral efficiency (SE) trade-off performance methods cannot adapt to the changing scenarios for single objective optimization, and thus cannot effectively track the optimization objectives. To solve this problem, a trade-off method of energy efficiency and spectral efficiency is proposed, which can adapt to the changing scenarios. By constructing a trade-off optimization function between them, the non-convex multi-objective optimization problem is transformed into a single-objective convex optimization problem, and solved by Lagrange multiplier method. The theoretical analysis and simulation results show that the proposed trade-off method can change the system energy efficiency or spectral efficiency by setting a trade-off factor under the power consumption limitation of the system circuit, and simultaneously obtain the optimal performance trade-off of energy efficiency and spectral efficiency.
  • References | Supplementary Material | Related Articles

  • Joint Prediction of Multi-Workload Sequences Based on Temporal Correlation in the Cloud
  • ZHANG Zhi-hua, WANG Meng-qing, MAO Wen-tao, LIU Chun-hong, CHENG Bo
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 68-75. DOI:10.13190/j.jbupt.2019-244
  • Abstract ( 493 )     HTML     　　
  • A novel approach,joint prediction of multi-workload sequences,was proposed based on temporal correlation. Firstly,long short-term memory was used to extract the temporal feature among workload sequences for obtaining the similar workload sequences,while hierarchical clustering algorithm was used to obtain workload sequences clusters. Then,construct multi-task learning model respectively for each obtained sequence clusters,capture and utilize the shared domain knowledge among multiple workload sequences,so as to achieve joint prediction of multiple workload sequences as well as improve generalization ability and prediction accuracy of the model. Results of experiment on dataset of Google cluster trace 2011 demonstrates that the temporal feature clustering can effectively extract and utilize the global temporal feature of workload sequences,reduce the noise of original sequences and get workload sequences clusters with similar characteristics. Proposed method performs better in prediction accuracy than the state-of-the-art methods.
  • References | Supplementary Material | Related Articles

  REPORTS

  • An Algorithm for Differential Gene Analysis of Breast Cancer Based on PPI Network
  • WANG Xiao-yu, FENG Yang
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 76-82. DOI:10.13190/j.jbupt.2019-174
  • Abstract ( 716 )     HTML     　　
  • In order to improve the accuracy of screening differential genes for breast cancer,the differential expression genes of breast cancer was analyzed from the molecular level,combined with the characteristics of copy number and gene expression,studied the pathogenesis of breast cancer and provided new research ideas for the diagnosis and treatment of breast cancer. The cancer genome atlas database was used to download copy number and gene expression data of breast cancer, chi square test was used to extract copy number difference genes of breast cancer. Through R software, edgeR differential gene analysis algorithm was used to screen differentially expressed genes in breast cancer, ks test was used to correlate two differentially expressed genes to analyze the relationship between CNV variation and gene expression, string database was used to construct protein interaction network to screen core genes, the accuracy of the results was verified by survival analysis and go enrichment analysis. According to the standard of FDR greater than 1, p value less than 0.05,10 579 genes were screened,7 543 genes were up-regulated and 3 036 genes were down-regulated. It was found that eight genes such as ATAD2B were closely related to the occurrence and development of breast cancer.
  • References | Supplementary Material | Related Articles

  • A Threshold Public Key Encryption via Dual Regev Scheme
  • LI Zeng-peng, WANG Jiu-ru, ZHANG Wen-yin, MA Chun-guang
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 83-87. DOI:10.13190/j.jbupt.2019-239
  • Abstract ( 888 )     HTML     　　
  • Aiming at the problem that Regev scheme cannot effectively resist key recovery attack, a threshold public key encryption scheme is proposed based on Gentry-Peikert-Vaikuntanathan (GPV) scheme. The scheme is mainly composed of a distributed key generation protocol and an effective non-interactive decryption protocol. It combines Shamir's secret sharing algorithm and Lagrangian algorithm, which make it resistant to static and passive adversary buying attacks. The correctness of the proposed scheme is proved through theoretical analysis. Moreover, under the universal composable framework, the security is verified.
  • References | Supplementary Material | Related Articles

  • Design of Double-Chain Three-Route Time-to-Digital Converter Based on FPGA
  • DAI Qing-da, YE Mao
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 88-94. DOI:10.13190/j.jbupt.2019-235
  • Abstract ( 1043 )     HTML     　　
  • The ranging accuracy and image sharpness of radar system are directly related to parameters of time-to-digital converter(TDC), including measurement resolution, linearity, temperature adaptability and so on. A double-chain three-route TDC with high-resolution is designed based on Xilinx 28 nm Artix-7 field programmable gate array(FPGA), which could break the resolution limitation of the single delay tap and effectively subdivide the wide tap. The structure offers significant advantages of low cost and high resolution. The pipeline encoders are designed to economize logic cells. The code density scheme is used to determine the exact value of the bin width one by one and the equivalent resolution. The chip temperature is determined according to the xilinx analog to digital converter module in the FPGA and the temperature calibration coefficient could be obtained to correct the measurement value. Parameter indexes of the TDCs included 5.63 ps equivalent bin width and 11.7 ps root mean square resolution under normal temperature. The compensation is finished in the circuit in the range from 5 ℃ to 85 ℃. Compared with the six-chain delay line TDC, the double-chain three-route TDC has the similar index, which reduces the utilization of logic resources of the FPGA by up to 43.1% and cuts power consumption by up to 36.8% respectively.
  • References | Supplementary Material | Related Articles

  • A Fingerprint Localization Method Based on Shapelet Algorithm
  • CHANG Zi-ying, WANG Wen-han, LI Tao, LIU Fen, CHEN Peng-peng
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 95-100. DOI:10.13190/j.jbupt.2019-223
  • Abstract ( 559 )     HTML     　　
  • Due to large influence of time and space on channel state information (CSI),the existing CSI-based indoor positioning technology is poor in robustness.Aiming at this problem,a fingerprint positioning method based on Shapelet algorithm is proposed.In the training phase,CSI is taken as the original location data,and the original data is processed and corrected by the 3-σ anomaly value processing method and the Kalman filter;then the fingerprint of each location is extracted and the fingerprint database is established by using the Shapelet algorithm;Finally,the fingerprint database is used to construct the Shapelet decision tree,and the decision tree classification is used to achieve more accurate positioning.Compared with the principal components analysis algorithm and,k-nearest neighbor algorithm,It is shown that the method has higher positioning accuracy and stable performance at different times,and the training set is smaller.
  • References | Supplementary Material | Related Articles

  • A New Algorithm of QoS Constrained Routing for Node Energy Optimization of Edge Computing
  • ZHANG De-gan, CHEN Lu, CHEN Chen, ZHANG Ting, CUI Yu-ya
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 101-105. DOI:10.13190/j.jbupt.2019-203
  • Abstract ( 551 )     HTML     　　
  • Based on satisfying the requirements of end-to-end delay and reliable service among nodes,to solve the problem of high energy consumption of existing multi-path routing protocols,a quality of multi-service(QoS) constrained route algorithm for edge computing and node energy optimization(MQEN) was proposed. The QoS constraints of end-to-end delay,reliability,and energy expenditure were considered. The related technologies of edge computing and machine learning were utilized to create a sensor network model of multi-constrained majorization path,introducing a wake-up strategy of energy-aware node as well as reward and punishment mechanism based on learning automaton. This algorithm combined edge computing to preprocess the original data of the node,speeding up effective data transmission and treatment. The automata-environment interaction approach was adopted to accelerate algorithm convergence. The technique of sleep activation of control node was employed to optimize network power consumption and extend the network life cycle. Experiments indicate that the MQEN algorithm reduces network power expenditure and corresponds to the demands of multiple QoS constraints for the end-to-end delay and credible services.
  • References | Supplementary Material | Related Articles

  • Localization Algorithm Based on Penalty Function and Water Wave Optimization for WSN
  • YU Xiu-wu, ZHANG Ke, LIU Yong
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 106-112. DOI:10.13190/j.jbupt.2019-193
  • Abstract ( 470 )     HTML     　　
  • In order to improve the search efficiency and localization accuracy of the heuristic localization algorithm, a localization algorithm base on penalty function and water wave optimization for wireless sensor network (WSN) is proposed. Firstly, the proposed algorithm uses the bounding-box method to construct the penalty function, which improves the water wave optimization algorithm's searching efficiency. Then the dynamic learning strategy is used to improve the propagation stage of the traditional water wave optimization algorithm, which encourages the individual to learn from the surrounding excellent individuals. And the dynamic wave height is introduced to enhance the individual's local search probability in late stage. Simulations show that the penalty function strategy and the improved water wave optimization algorithm can improve the search efficiency and positioning accuracy. The proposed algorithm has good feasibility and effectiveness in WSN node location.
  • References | Supplementary Material | Related Articles

  • A Failure Recovery Algorithm for Inter-Domain Routing System Based on Degree-Constrained Minimum Spanning Tree
  • WANG Yu, ZHANG Lian-cheng, ZHANG Hong-tao, GUO Yi
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 113-119. DOI:10.13190/j.jbupt.2019-198
  • Abstract ( 376 )     HTML     　　
  • In view of the threat of low-rate denial of service attacks on inter-domain routing system,the existing failure recovery methods fail to solve problems including high time complexity and node aggregation control. A failure-recovery algorithm based on degree-constrained minimum spanning tree named degree-constrained minimum spanning tree based failure recovery (DR) is proposed. By designing the Fundamental Transfer sub-algorithm and the complex transfer sub-algorithm,a new recovery topology can be constructed according to the survival topology of the attacked routing system under the condition of given degree constraint. For the above two types of transfer sub-algorithms,two selection sub-algorithms are respectively advanced for the determination and calculation of key nodes. Theoretical analysis and simulation experiments verify that the recovery topology generated by DR has better performance while effectively controlling the node degree.
  • References | Supplementary Material | Related Articles

  • Detection and Performance Analysis Based on Quadrature Index Modulation Multiple Access
  • JIN Xiao-ping, WU Qing, JIN Ning, CHEN Dong-xiao, WANG Jia-tian
  • Journal of Beijing University of Posts and Telecommunications. 2020, 43(4): 120-126. DOI:10.13190/j.jbupt.2019-197
  • Abstract ( 413 )     HTML     　　
  • To reduce the computation complexity of quadrature index modulation multiple access(QIMMA) detection, two low-complexity detection schemes based on receiver sphere decoding and sorting-based sphere decoding are presented. By weighting the combination of time slots, the detection accuracy is enhanced, the number of searches is reduced, and the effect of reducing complexity is achieved. Compared with the maximum likelihood detector, the new scheme can reduce the detection complexity by more than one-third without any performance loss. In addition, analysis of the average bit error rate is derived according to the characteristics of QIMMA system. It ids shown that it coincides very well with their theoretical counterparts in the range of middle and high signal-to-noise ratio.
  • References | Supplementary Material | Related Articles