Current Issue

• • 2017, Vol. 40 No. 5 Published date:28 October 2017 Last issue Next issue

  Review

  • The Research of SCBSS Technology:Survey and Prospect
  • FU Wei-hong, ZHOU Xin-biao, NONG Bin
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 1-11. DOI:10.13190/j.jbupt.2017-001
  • Abstract ( 805 )     HTML     　　
  • As a case of ill-conditioned signal mixing, the single channel blind source separation (SCBSS) is an important research field which has been widely given attention and has broad application prospects. The mathematical model of SCBSS and the evaluation index of separation effect are described firstly. Secondly, on the basis of an in-depth investigation into latest development of SCBSS,some kinds of existing theories and methods are then emphatically discussed and summarized, then the applications of the methods presented are systematically explained. Finally the challenges and prospects for further development in the area are listed.
  • References | Supplementary Material | Related Articles

  Papers

  • Reputation Based Point-to-Point Resource Sharing Mechanism and Implementation
  • YUAN Jian, ZHAO Yang, ZHANG Yao-dong, WANG Yue
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 12-17. DOI:10.13190/j.jbupt.2017-006
  • Abstract ( 352 )     HTML     　　
  • The performance of information resource sharing depends on users' sharing motivations and shared information quality. In the mobile Internet scenario, to encourage users to share high-quality resources, a reputation based resource sharing mechanism was designed, including a reputation based resource and user matching algorithm for precisely satisfying users' information demand and user reputation update algorithm for dynamically evaluating users' reputation. A point-to-point information resource sharing platform was established, and the proposed reputation based resource sharing mechanism was achieved. Extensive simulations and experiments in real scenarios demonstrate that such mechanism can improve the users' resource sharing ratio and shared resource quality.
  • References | Supplementary Material | Related Articles

  • A Broadcast Transmission Scheme for DTMSN Based on Intra-flow and Inter-flow Network Coding
  • YAO Jian-sheng, MA Chun-guang, YUAN Qi, LI Zeng-peng
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 18-23. DOI:10.13190/j.jbupt.2016-276
  • Abstract ( 392 )     HTML     　　
  • An efficient broadcast transmission scheme based on intra-flow and inter-flow network coding in delay tolerant mobile sensor networks (DTMSN) was proposed. In the scheme, the sink nodes transform the original broadcast data into coded packets by utilizing random linear network coding, and then forward them to sensor nodes. Sensor nodes exchange the coded packets by employing an optimized opportunistic network coding algorithm. Once receiving enough independent coded packets, the sensor nodes can decode them and obtain the original broadcast data from the sink node. Analysis and simulation show that the scheme can further reduce broadcast delay and network cost than those schemes only based on random linear network coding.
  • References | Supplementary Material | Related Articles

  • Performance Modeling and Analysis of Multi-Hop Ad Hoc Network under Delay Constraint
  • LIU Ying, ZHU Si-yan, SUN Chen-hua, LI Guo-yan
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 24-29. DOI:10.13190/j.jbupt.2017-062
  • Abstract ( 379 )     HTML     　　
  • Wireless multi-hop ad Hoc network has been widely used in military battlefield, emergency communication and so on. However, due to the complicate characteristics of wireless channel, it is difficult to obtain reliable protection and real-time reliability in practice. A design strategy on protocol parameters for centralized multi-hop ad Hoc network was proposed to maximize the bandwidth utilization under delay constraint. Based on centralized wireless multi-hop ad Hoc network communication mechanism, an end-to-end delay model and a bandwidth utilization model were established, which fully consider the impacts of four aspects of parameters, network, traffic, protocol and channel. It is shown that the centralized scheduling mechanism is more suitable for the smaller network. Finally, an optimization strategy was given to properly design protocol parameters in different network scenarios under delay constraint.
  • References | Supplementary Material | Related Articles

  • A Subjectivity and Time-Varying Reputation-Oriented Trust Management Method in Cloud Services
  • XU Jiu-yun, GUAN Chao, JIANG Dan
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 30-35. DOI:10.13190/j.jbupt.2016-178
  • Abstract ( 365 )     HTML     　　
  • Currently, most of cloud service requesters select cloud services (cloud storage, cloud platforms, etc. according to the evaluation by the evaluators. This evaluation is based an objective criterion which is neglected with the difference of preferences between the requester and the evaluators. However, the issues of the evaluation with individual's preferences, which is the value of evaluation with the requester's subjective sense and the value of evaluations wearing off with time going, are in normal sense. Taking the subjectivity and time-varying of evaluations into consideration, a decision tree and time decay to assess trust model was proposed. In detail, the reputation value of cloud services no longer regards the quality of service as an objective value, but the difference of the cloud services users' subjective consciousness. Experiments was conducted based on the proposed model. It is shown that this model can provide more accurate reputation values based on the cloud customers' feedbacks than the existing reputation evaluation model.
  • References | Supplementary Material | Related Articles

  • Automatic Design Pattern Detection on the Consideration of Multiple Characteristic Factors
  • WANG Lei, WANG Zhi-guang
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 36-42. DOI:10.13190/j.jbupt.2017-076
  • Abstract ( 414 )     HTML     　　
  • Most of the existing methods for automatic design pattern detection only consider structural characteristics of design patterns, so the detection accuracy rate is not high enough. Therefore, a method for automatic design pattern detection on the consideration of multiple characteristic factors was proposed. First, a formal description method for system under study and design patterns based on characteristic matrix was proposed. Then the basic flow of automatic design pattern detection was given, and the design pattern detection algorithm considering multiple characteristic factors was discussed in detail. Finally, a support tool for this method is implemented, and design patterns in an open source project were detected by using this tool. The experimental results show that compared with the design pattern detection methods which only consider structural characteristics, detection accuracy rate of this method is higher. For design patterns whose structural characteristics are not obvious or who have similar structure characteristics with other design patterns, accuracy rate is improved obviously.
  • References | Supplementary Material | Related Articles

  • Dynamic Group Public Auditing Scheme for Shared Data on Attribute-Based Threshold Signature
  • ZHA Ya-xing, LUO Shou-shan, LI Wei, BIAN Jian-chao
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 43-49. DOI:10.13190/j.jbupt.2017-003
  • Abstract ( 465 )     HTML     　　
  • A privacy-preserving public auditing scheme for dynamic group shared data based on attribute-based threshold signature was proposed, the identity information parameter was introduced into the attribute keys for preventing collusion attacker who wants to forge signature through the combination of these keys. The proposed scheme supports authority revocation of group user and data dynamic operation with attribute-based authorization strategy. Analysis shows that the proposed scheme with the characteristics of unforgeability and resistance collusion attack based on the random oracle model, and with better efficiency and security.
  • References | Supplementary Material | Related Articles

  • Equal Gain Combining Technique for Massive MIMO Uplink Systems
  • JIN Si-nian, GAO Xin-xin, YUE Dian-wu
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 50-54. DOI:10.13190/j.jbupt.2017-073
  • Abstract ( 488 )     HTML     　　
  • The uplink scenario of multi-cell massive maltiple input maltiple output with perfect and imperfect channel state information (CSI) is analyzed. The achievable rate of equal gain combining (EGC) scheme is deduced and compared with that of maximal-ratio combining (MRC) scheme. Simulation results show that the deduced EGC closed-form expression agrees well with Monte Carlo simulation results. In the two cases of imperfect CSI with the power scaling factor of 0.5 and perfect CSI with the power scaling factor of 1, as the number of antennas increases, the spectral efficiency of EGC scheme increases and gradually approaches to a fixed value. This implies that the EGC scheme in massive MIMO also has such a characteristic of efficient saving energy like the MRC scheme.
  • References | Supplementary Material | Related Articles

  • Low-Complexity Soft-Output Signal Detection Based on Jacobi Iterative Method for Uplink Large-Scale MIMO Systems
  • SHEN Bin, ZHAO Shu-feng, HUANG Long-yang
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 55-60. DOI:10.13190/j.jbupt.2017-009
  • Abstract ( 488 )     HTML     　　
  • Based on Jacobi iterative method, a low-complexity detection algorithm which can circumvent the matrix inverse operation was proposed. The proposed algorithm was proved to be convergent when it is applied in the MMSE detection scheme, and it can achieve the same performance of the classical Neumann series expansion. Unlike conventional Neumann method with the number of iterations exceeding three (i ≥ 3), whose computational complexity is increasing to O(K³), the proposed algorithm can keep it consistently at O(K²) with arbitrary number of iterations. In order to employ that in soft decision, an approximated method was adopted to compute log-likelihood ratios for soft channel decoding. Simulations verify that the proposed algorithm can converge rapidly and achieve its performance quite close to that of the MMSE algorithm with only a small number of iterations.
  • References | Supplementary Material | Related Articles

  • An Improved Artificial Bee Colony Algorithm with Memory
  • DU Zhen-xin, LIU Guang-zhong, HAN De-zhi
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 61-66. DOI:10.13190/j.jbupt.2017-037
  • Abstract ( 351 )     HTML     　　
  • Artificial bee colony algorithm with memory (ABCM) memorizes successful coefficients and neighbors to guide the further foraging of the artiflcial bees. ABCM consumes many function evaluations to converge to the attractors and use the same rejection coefficients as last time, which easily results in slow convergence, low population diversity and falling into the local minima. In the improved ABCM (IABCM), the candidates converge to the attractors consuming only one function evaluation, and the candidate will replace the current solution if the former is better than the latter. Otherwise, the memory will be deleted directly. By doing so, IABCM can get the most profit at a minimum cost. When the rejection coefficients are used, the numeric parts will be regenerated randomly to enhance the diversity and randomness, which is beneficial to help the algorithm to escape the local minima. Experiments on 22 functions with different characteristics demonstrate that the IABCM is significantly better than ABC and ABCM in terms of solution quality and convergence speed.
  • References | Supplementary Material | Related Articles

  • Modeling Test Case Fault-detecting Capacity Based on Fault Detection Difficulty Level
  • TAN Li-li, WANG Ya-wen, XING Ying, WAN Qian
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 67-74. DOI:10.13190/j.jbupt.2016-284
  • Abstract ( 401 )     HTML     　　
  • The credibility of mutation score is questioned because it is computed without regard to fault detection difficulty level. A fault-detecting capacity evaluation model about test suit considering fault detection difficulty level is suggested. Based on logistic regression, the quantitative relation between the fault recognition probability and fault detection difficulty level is expressed. With the area under this relation curve, the mutation score is redefined. The new defined mutation score is not affected by fault detection difficulty level and avoid inaccuracy of classical mutation score because of the appearance of equivalent mutants.
  • References | Supplementary Material | Related Articles

  • Polynomial Model with Feedback for Digital Predistortion of Power Amplifiers
  • ZHAO Xia, LI Zhan-ning
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 75-81. DOI:10.13190/j.jbupt.2017-054
  • Abstract ( 458 )     HTML     　　
  • The digital predistortion is a cost-effective way to the linearize power amplifiers. Memory polynomial is one of the most popular DPD models. However, these models cannot get a good compromise between accuracy and complexity. The author proposes a feedback-based model to characterize DPD. The model not only uses the input information, but also uses the past output information. Simulations show that the model can linearize the magnitude and phase nonlinearity of power amplifiers more effectively.
  • References | Supplementary Material | Related Articles

  • Motion Compensation Algorithm of Synthetic Aperture Sonar Based on Multisensor Data Fusion
  • ZHANG Yu, LI Geng-xiang, ZHANG Peng-fei, WEI Lin-zhe, LIU Ji-yuan
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 82-86. DOI:10.13190/j.jbupt.2017-061
  • Abstract ( 441 )     HTML     　　
  • The data from the motion measuring system is the basis to estimate the motion errors in synthetic aperture sonar. By taking advantage of the centralized Kalman filter, the optimal estimation can be realized after multisensor data fusion, which is more accurate than any raw data. The experiment results show that motion compensation with multisensor data fused can make the image radiation performance improved, energy centralized and the target focused well.
  • References | Supplementary Material | Related Articles

  • Multi-Source Optical Multicast Routing with Least Number of Optical Network Coding Links
  • WEI Cheng-ying, WU Lan, LIU Huan-lin, CHEN Yong
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 87-91. DOI:10.13190/j.jbupt.2016-249
  • Abstract ( 399 )     HTML     　　
  • Network coding can improve the bandwidth utilization for multi-source optical multicast, but it increases optical storage and computation overhead in wavelengeh division multi-plexing networks. An improved adaptive genetic algorithm (IAGA) is proposed to minimize the number of optical network coding links for multicast. By designing the maximization difference crossover operation, IAGA can guarantee the diversity of population and avoid from falling into a local optimal. By adaptive adjusting the crossover probability, IAGA makes the population diverse at the beginning stages and makes the excellent individuals remain in a stable condition. Compared with other algorithms, the simulation results show that the proposed algorithm has fastest convergence speed, which means that it takes the shortest time to find the minimum numbers of optical coding link solutions.
  • References | Supplementary Material | Related Articles

  Reports

  • V2X Resource Allocation Scheme Based on D2D Communication
  • ZHANG Hai-bo, XIANG Yu, LIU Kai-jian, CHEN Shan-xue
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 92-97. DOI:10.13190/j.jbupt.2017-039
  • Abstract ( 410 )     HTML     　　
  • Large amount of interference, due to share the cellular network resources, exists in device-to-device (D2D) based vehicular communication system with heavy load. A heuristic algorithm is proposed to maximize the total throughput of cellular-users (C-UEs) while meeting the minimum security communication requirements of vehicular-users (V-UEs) at the same time. Firstly, the vehicles without interference are divided into the same cluster by principle of graph coloring. Secondly, according to the clustering results, the improved Hungarian assignment algorithm is used to allocate the channel. Finally, the power is adjusted to maximize total throughput of C-UEs. Simulations show that the proposed algorithm can effectively solve the vehicle-to-everything (V2X) co-layer and cross-layer interference problem, and improve the spectrum utilization so as to ensure the reliability of V-UEs communication.
  • References | Supplementary Material | Related Articles

  • Palm Vein Recognition Method Based on Directional Multi-Scale Sparse Coding
  • MA Xin, JING Xiao-jun
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 98-105. DOI:10.13190/j.jbupt.2017-077
  • Abstract ( 329 )     HTML     　　
  • A palm vein recognition method based on the directional multi-scale sparse coding (DMSC) was proposed to promote the recognition accuracy and operation efficiency. Firstly, the global and local orientation information were calculated from the palm vein region of interest area. Then, the directional multi-scale Gabor filter were convolved in every sub-region independently. Finally, a feature extraction mechanism based on spare coding was implemented, and the feature matrices were formed by appearance-based method. The similarity of two feature matrices were measured by normalized Hamming distance. Experiments show that the proposed DMSC method achieves higher recognition accuracy and operation efficiency than other palm vein recognition methods.
  • References | Supplementary Material | Related Articles

  • Time Delay Estimation Algorithm for Weak Narrowband Signals Based on Sparse Reconstructive
  • ZHAO Pei-yan, QIN Ji-dong, PENG Hua-feng, OU Hai
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 106-109. DOI:10.13190/j.jbupt.2016-248
  • Abstract ( 420 )     HTML     　　
  • A new time delay estimation algorithm for weak narrowband signals based on sparse reconstructive was presented. Firstly, the data matrix was constructed by the cross-correlation spectrum of signals, secondly, the over-complete dictionary for time delay was established, finally, the high precision time delay was estimated in the signal subspace by using orthogonal matching pursuit (OMP) algorithm, and the subspace is obtained by singular value decomposition (SVD) of the data matrix. Analysis and simulation verify the correctness and effectiveness of the algorithm. Compared with conventional time delay estimation algorithm, the presented algorithm can improve the estimation accuracy by about 1 time.
  • References | Supplementary Material | Related Articles

  • Achievable Rate of Multi-user Gaussian Z Interference Channel
  • TONG Yan-chun, ZHANG Bo, YUAN Wen-fang
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 110-116. DOI:10.13190/j.jbupt.2016-155
  • Abstract ( 471 )     HTML     　　
  • In order to further study the communication scheme of Han-Kobayashi (HK) on cascade Gaussian Z interference channel, a method of one inner bound and two outer bounds was proposed under weak and medium interference. In the scheme, as the transmitted information of both users split into common information and private information, a achieve rate R_HK is obtained by optimizing the ratio between common and private information. An inner bound is proposed by adding a constraint on this channel which is less than R_HK. Based on two genie-aided programs of two-user interference channel, two outer bounds were proposed by genie-aided which great than R_HK. By analyzing the distance between the inner bound and outer bounds, HK type scheme can be achieved within a single bit per second per hertz (bit·s^-1·Hz^-1) of the capacity under medium interference and approach to a single bit per second per hertz (bit·s^-1·Hz^-1) of the capacity under weak interference as total number increasing.
  • References | Supplementary Material | Related Articles

  • Acoustical Crack Feature Extraction of Turbine Blades under Complex Background Noise
  • ZHAO Juan, CHEN Bin, LI Yong-zhan, GAO Bao-cheng
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 117-122. DOI:10.13190/j.jbupt.2017-063
  • Abstract ( 440 )     HTML     　　
  • To solve the problem of crack detection of large turbine blades, the author proposed a non-contact online acoustic health monitoring system and studied in-depth on the adaptive crack feature extraction method. Firstly, a preprocessing algorithm is well designed to remove the complex background noise. Then 1/6 octave technique is used to reveal the spectrum change of acoustic signal roughly, and concluded that the octave energy ratios are extracted as input feature vector of the support vector machine classifier. Finally, the principal component analysis is introduced to optimize the high dimensional feature space adaptively. The measured data from wind field validates the effectiveness of proposed method.
  • References | Supplementary Material | Related Articles

  • Chinese Textual Entailment Recognition Via Ordered Word Mover Distance
  • TAN Yong-mei, WANG Min-da, NIU Shao-zhang
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 123-128. DOI:10.13190/j.jbupt.2016-221
  • Abstract ( 364 )     HTML     　　
  • Chinese textual entailment recognition method based on ordered word mover distance was proposed. The ordered word mover distance was computed based on word2vec. The ordered word mover distance feature, grammar feature, and semantic feature were used to generate classification module based support vector machine (SVM). With use of classification module, the entailment result was obtained. An experiment was conducted in the CS data of RITE-VAL evaluation task in 2014, the MacroF1 of the experiment is 0.629, outperforming optimal value (BUPTTeam,0.615), which illustrates the effectiveness of the method to lifting the performance of Chinese textual entailment.
  • References | Supplementary Material | Related Articles

  • A Semi-Structure Model of SWF Based on E-OEM
  • ZHAO Hai-ying, TAN Xin, WANG Liang-liang
  • Journal of Beijing University of Posts and Telecommunications. 2017, 40(5): 129-134. DOI:10.13190/j.jbupt.2016-252
  • Abstract ( 333 )     HTML     　　
  • It's difficult to reveal hidden relationships of the shockwave flash (SWF). The article proposed an enhancement object exchange model (E-OEM) based on object exchange model (OEM). This model can describe and store SWF file format. First, SWF file format is described though OEM. Then, OEM descriptive model is improved with classifying the head and the end, clustering the body. E-OEM could realize the function of description and storage through Huffman coding. Also, 100 different source files are used to build semi-structure model. It is shown that E-OEM has a good impact on the relationship dominance, and can implement effective retrieval of high tag repetitive rate, and the storage rate is improved. It is shown that the model is valid.
  • References | Supplementary Material | Related Articles