Please wait a minute...

Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Current Issue

  • Papers

    • A Limited Feedback for Relay Networks Based Adaptive  Multicast Resource Allocation Scheme
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 1-4. DOI:10.13190/jbupt.2011s1.1.tangmw
    • Abstract ( 2124 )     HTML       
    • An adaptive subcarrier and power allocation scheme based on limited feedback for multicast relay networks is proposed. The new scheme works in three steps. Firstly, transfer mode of each multicast group is determined using a new feedback algorithm and transfer protocol. Secondly, a fair subcarrier allocation scheme is proposed to achieve a tradeoff between fairness and qualityofservice. Finally, a new cooperative power iterative scheme is introduced to allocate power effectively, where target rate on each subcarrier is computed by waterfilling algorithm in the first place and then a power iterate process is implemented to optimize power allocation. Simulations show that the new scheme significantly reduces feedback overhead. Moreover, both the required power and the multicast service outage of the scheme are much less than those of the direct scheme.

    • References | Supplementary Material | Related Articles
    • Beamforming for Cognitive Radio Networks under  Outage Probability Constraints
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 5-8. DOI:10.13190/jbupt.2011s1.5.xiexzh
    • Abstract ( 2570 )     HTML       
    • The transmit beamforming algorithm design of cognitive radio (CR) network is studied.In order to guarantee the quality of service, the optimization is formulated to minimize the CR network transmit power under the constraint of outage probability at the CR users and primary users. Simulations show that with the knowledge of assumed statistical distribution of channel covariance error at the transmitter, this scheme can effectively minimize the transmit power of each CR user, enhance the CR network performance and decrease the interference to primary user.

    • References | Supplementary Material | Related Articles
    • A New Queuing Model Design for GPON Estimated Bandwidth Allocation Schemes
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 9-13. DOI:10.13190/jbupt.2011s1.9.zhenggn
    • Abstract ( 2084 )     HTML       
    • A new S/G/m/FCFS queuing model for GPON system is proposed to analyze the access delay for dynamic bandwidth allocation algorithms. An evaluation for both Static Estimation Bandwidth allocation (SEBA) and Dynamic Estimation Bandwidth allocation (DEBA) are carried out based on the proposed queuing model. To save bandwidth resource and improve network performance, the estimation factor of DEBA can be adjusted dynamically according to the traffic load. Simulations verify that DEBA is superior to SEBA for obtaining lower access delay and mitigating congestion effectively.

    • References | Supplementary Material | Related Articles
    • A Method of MultiFeature Particle Filter Tracking Based on Video Sequences
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 14-18. DOI:10.13190/jbupt.2011s1.14.liuyh
    • Abstract ( 1710 )     HTML       
    • Used in video sequences, an algorithm for multifeature particle filter (PF) is put forward with resampling. The new CamShift is applied to each particle in order to make all particles reach a stable position nearby. Likelihood function for each particle is computed by color and edge Bhattacharyya coefficients. The method exploits the CamShift characteristic of low computational complexity, which makes PF realize target tracking by less particles than before. Analysis shows that the method is robust to occlusion.

    • References | Supplementary Material | Related Articles
    • Energy Probability Distribution of Cooperative Spectrum Sensing in Cognitive Radios
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 19-22. DOI:10.13190/jbupt.2011s1.19.lijj
    • Abstract ( 2371 )     HTML       
    • Cooperative spectrum sensing based on energy probability distribution (EPD) is proposed to improve the sensing performance of the cognitive radios. Instead of averaging the energy in the traditional energy detection scheme, each cooperative secondary user in the EPD scheme records the number of the received samples, its energy is over a given threshold. Correlation between the sum of the recorded numbers and the EPD of the noise is used at the data fusion center to reach a final decision. Gaussian approximation is used to analyze the performance of the proposed EPD spectrum sensing method. Simulation demonstrates that with the increase of cooperative users, the proposed scheme is of better performance than the traditional cooperative onebit hard spectrum sensing. No prior information is required in the proposed scheme.

    • References | Supplementary Material | Related Articles
    • Embedded SpaceFrequency Block Codes
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 27-30. DOI:10.13190/jbupt.2011s1.27.206
    • Abstract ( 1737 )     HTML       
    • Tradeoff between diversity and rate in space frequency block codes (SFBC) is adopted, and embedded SFBC is proposed. The information is divided into the based stream and the enhanced stream. The based stream is received in bad channel, but the based and enhanced are received simultaneity in good channel. The transmission rate can be improved, and it is ensure that the based information stream is received reliably. Meanwhile, the peak average ratio formulation of our proposed codes is derived in two transmission antennas. Simulations show that the based information of embedded SFBC could have higher diversity order than Alamouti SFBC in lower signal to noise ratio. Compared with the opportunistic space time block codes, the proposed space frequency codes is of lower bit error ratio of system when used 2 transmission antennas under high Doppler shift conditions.

    • References | Supplementary Material | Related Articles
    • A New Optimal Transfer Matrix Algorithm Designed for  MIMO AF Relay System with Precoding
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 41-45. DOI:10.13190/jbupt.2011s1.41.205
    • Abstract ( 2444 )     HTML       
    • Based on minimum mean square error of detected signal at destination node, a new transfer matrix design algorithm is proposed to improve the performance of multiple input multiple output (MIMO) relay communication systems. A major purpose of this algorithm is to solve AX+XB=Ftype matrix equation. Through singular value decomposition method, the final optimal transfer matrix can be got at last. Linear precoding and linear detection based on zero forcing criterion is adopted owing to simplicity. Through algorithm analysis and simulation comparison, the ergodic capacity improvement margin is about 2 bit •s-1•Hz-1, better than the unitary matrix method under same simulation configuration.

    • References | Supplementary Material | Related Articles
    • An Optimized UserBehavior Clustering Analysis Based Service  Fault Detection Mechanism for Mobile Device
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 46-50. DOI:10.13190/jbupt.2011s1.46.guoshy
    • Abstract ( 1869 )     HTML       
    • In order to detect, diagnose and exclude potential or occurred faults on mobile devices, a useroriented detection mechanism is proposed. In the mechanism. A new UserBehavior Analysis model based on fuzzy math theory is firstly proposed to weigh the dependence degree of each service. Secondly, a UserBehavior Clustering Analysis model is introduced to divide mobile users into several clusters. Thirdly, integrations are made for the dependence degree of each service, the network status and failure rate of service into building a priority detectionservice set selection model. So the optimized sets for PreDetection of the service faults on mobile devices could be selected. Meanwhile, a UserBehavior Clustering Analysis Based Service Fault Detection Optimization Mechanism is implemented on a prototype system, and the optimal number of userclusters is validated judging by the average normal use ratio under three PreDetection scenarios.

    • References | Supplementary Material | Related Articles
    • An Audio Blind Watermarking Scheme Based on DWTDCTSVD
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 51-54. DOI:10.13190/jbupt.2011s1.51.leim
    • Abstract ( 2151 )     HTML       
    • A new audio blind watermarking scheme based on discrete wavelet transform  discrete cosine transform singular value decomposition (DWTDCTSVD) is proposed. In this algorithm, the audio is split as blocks, and each block is decomposed on twodimensional DWT, then the approximate subband coefficients are decomposed on DCT, and the first quarter of the DCT coefficients are decomposed on SVD transform and get a diagonal matrix. At last, the watermarking information is embedded into the diagonal matrix. The watermark embedding capacity is 2756 bit/s. Experiments show that the algorithm can get better balance between transparency and robustness of watermark, and it has strong robustness against the common audio signal processing such as MP3 compression, requantization, resampling, lowpass filter, cutting replacement and additive white Gaussian noise.

    • References | Supplementary Material | Related Articles
    • Clustering User Goals Based on Hierarchical Dirichlet Process Topic Model
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 55-58. DOI:10.13190/jbupt.2011s1.55.duanrx
    • Abstract ( 3790 )     HTML       
    • In order to understand users’goals in web searching better, an approach which makes use of hierarchical dirichlet process (HDP) model to cluster the verbs of users’goals is proposed. Verbs are good indications of users’goal, and good verb clustering therefore causes good clustering of users’goals. Verbs of users’goals are represented by cooccurrence nouns and nouns that have dependency relations with the verb. Experiments show that HDP has better performance in verbs clustering than latent Dirichlet allocation and dirichlet process mixture model.

    • References | Supplementary Material | Related Articles
    • An Improved Scheme of Distributed SpaceTime Coding Based on GABBA Codes
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 59-62. DOI:10.13190/jbupt.2011s1.59.huzw
    • Abstract ( 1817 )     HTML       
    • Aim at the problem that the channel state information (CSI) is not taken full advantage in traditional distributed generalized ABBA (GABBA) spacetime codes in amplifyandforward relay networks, an improved scheme is proposed. In this scheme, the receiver calculates and sends out the current feedback information according to the CSI. After receiving the feedback information at one of the relay nodes, some preprocess is used on the original signal of this branch. The scheme can alleviate the interference brought by channel dependence, and improve reliability of the system. Analysis and simulation result suggest that the proposed scheme can significantly decrease the system bit error rate in contrast with the former scheme at the cost of one bit feedback information.

    • References | Supplementary Material | Related Articles
    • Autonomic Management Architecture and Its Application in Mobile SelfOrganizing Network
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 63-67. DOI:10.13190/jbupt.2011s1.63.ruill
    • Abstract ( 2227 )     HTML       
    • In order to improve intelligence and self management capability of network, an autonomic management architecture for mobile selforganizing network is proposed. Their components and functions are analyzed in detail. The communication technology and load balance mechanism of management network are analyzed. And the autonomic management services are defined as well. They will enhance cooperation capability between management nodes from network level and business level. The feasibility of architecture and autonomic management services are also verified by typical selforganizing scenarios that a new added mobile network node is selfconfigured.

    • References | Supplementary Material | Related Articles
    • A New Adaptive InterCell Interference Coordination Scheme
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 68-72. DOI:10.13190/jbupt.2011s1.68.luzhm
    • Abstract ( 2375 )     HTML       
    • An adaptive distributed power allocation (DPPA) algorithm based on potential games is proposed. Subband capacity with penalty factor is raised as the utility function. A global optimization could be transformed into a local optimization problem with iteration. By means of gradient projection, the power could be adaptively allocated, and the intercell interference is restrained. As a result, the intercell interference coordination and reduction of time price are achieved. It is shown that the algorithm reduced the capacity loss effectively, while increasing the throughputs for celledge users.

    • References | Supplementary Material | Related Articles
    • A Traffic Splitting Method for Single Service on Multiple Bearers
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 73-76. DOI:10.13190/jbupt.2011s1.73.yuanj
    • Abstract ( 1738 )     HTML       
    • A hybrid method for traffic splitting is proposed. It consists of calculating split ratio according to the ideal model and selecting optimal subnet of available links based on fuzzy multiple attributes decision making theory. The error between the split ratio is compared, and calculated by using ideal model and the transmission capabilities of all the links. A suitable method is adopted according to the comparative result. Simulation shows that the proposed can reduce reordering delay effectively for quality of service guarantee.

    • References | Supplementary Material | Related Articles
    • InterGroup FairnessBased Resource Allocation  for MultiAntenna Multicast Systems
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 77-80. DOI:10.13190/jbupt.2011s1.77.lis
    • Abstract ( 2132 )     HTML       
    • Considering intergroup fairness specifically, the problem of resource allocation for multiantenna multicast systems is studied, we formulate an optimization problem to maximize the system throughput given a set of available resources (power and subcarriers). A threestep algorithm is proposed, in which the multicast precoding process, subcarrier assignment and power allocation are operated separately to reduce the computational complexity. Simulation results also show that the system throughput is significantly improved by using the proposed algorithms both in multicast system and in unicast system.

    • References | Supplementary Material | Related Articles
    • Resource Allocations in Clustered DFTsOFDM Systems
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 81-84. DOI:10.13190/jbupt.2011s1.81.207
    • Abstract ( 1974 )     HTML       
    • Based on common used recursive maximum expansion method, a resource allocation method is proposed for clustered discrete Fourier transform spread orthogonal frequency division multiplexing (DFTsOFDM) systems in 3rd generation partnership project long term evolution (3GPP LTE).Simulations show that, if the number of clusters for each user can be increased without considering the impact of peaktoaverage power ratio, the flexibility of resource allocation is increased, it will lead to a higher spectral efficiency of system.

    • References | Supplementary Material | Related Articles
    • Joint Optimization for SubCarrier Pair and Power in  OFDMBased TwoWay Relaying
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 85-89. DOI:10.13190/jbupt.2011s1.85.tangl
    • Abstract ( 2167 )     HTML       
    • In order to improve the sumcapacity of amplifyandforward scheme for twoway relaying over orthogonal frequency division multiple (OFDM), a subcarrier pairing method based on sorting the channel coefficients (SPSCC) with low complexity is proposed. And for jointing subcarrier pairing and its optimal power allocation, a resource allocation strategy is presented. The subcarrier pairing by applying SPSCC with equal power allocation among each subcarrier pair is firstly considered; and a dual decomposition for power allocation among each subcarrier pair with total power constraint is employed. Finally, the power of each subcarrier pair is allocated to each node,i.e. the optimal power allocation of each node is obtained. Numerical analysis shows that the proposed resource allocation strategy can improve the sumcapacity.

    • References | Supplementary Material | Related Articles
    • Network Virus Propagation of 2D Asynchronous Cellular Automata
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 90-94. DOI:10.13190/jbupt.2011s1.90.chenx
    • Abstract ( 2214 )     HTML       
    • Network virus propagation is studied for 2D asynchronous cellular automata, and a network virus propagation model with time delay is proposed. The model effectively overwhelms the drawbacks of synchronous automata, and allows researchers to emulate virus propagation in networks on various congestion levels by simply adjusting the factor. It is shown that a hysteresis phenomenon occurs in the process of virus propagation due to time delay, with the overall trend unchanged.

    • References | Supplementary Material | Related Articles

    Reports

    • ContextAdaptive Mode Decision Algorithm for Scalable  Video Coding with Quality Scalability
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 95-99. DOI:10.13190/jbupt.2011s1.95.changk
    • Abstract ( 1721 )     HTML       
    • To reduce the computational complexity of quality scalable video coding (SVC), a three steps included fast mode decision algorithm is proposed. In the first step, skip modes which require little computational complexity are checked; afterwards, candidate modes are selectively searched according to the interlayer correlation; finally, the rest unchecked modes are calculated. If the minimal RateDistortion (RD) cost obtained in the first or the second step is smaller than the predefined threshold, early termination is trigged. Experiment demonstrate that, compared with the exhaustive search method, 459%808% encoding time can be saved by the proposed algorithm. The Peak Signal to Noise Ratio (PSNR) reduction is 025dB at most and the bit rate increment is 062% at most.

    • References | Supplementary Material | Related Articles
    • A Method of Image Retrievals Based on Texture Probability Statistics  and Global Dominant Color
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 100-103. DOI:10.13190/jbupt.2011s1.100.chenht
    • Abstract ( 1704 )     HTML       
    • Extracting texture features of images with probability statistics models is a significant method of contentbased image retrieval. In order to overcome the shortcomings of lack of color information and improve probability statistics retrieval performance, an approach that combines the global dominant color and probability statistics is proposed. The combinative features including texture and color are utilized for second retrieval after linear weighting. Experiments based on the 2600 images database shows superior performance of our proposed method compared with the single feature image retrieval and the probability statistics retrieval, recall rates and average normalized modified retrieval rank have been raised by 30% and 22% respectively.

    • References | Supplementary Material | Related Articles
    • Network Dividing for Mapping Problem of Large Scale Emulation Network
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 104-108. DOI:10.13190/jbupt.2011s1.104.huangmh
    • Abstract ( 1858 )     HTML       
    • Mapping of the large scale emulation network topology to the physical devices of network testbed automatically is an nondeterministic polynomial hard problem because the best solution of network dividing is unresolvable. With high capability and similarity of the physical devices, which can for working out the approximate optimal solution of network dividing by improving the annealing algorithm, a method is presented. Besides, with the help of the information of network topology structure, this method can simplify the complexity of large scale emulation network topology on different network level by preprocessing. Experiment verifies that this method could improve the efficiency of network dividing and mapping.

    • References | Supplementary Material | Related Articles
    • A Joint Code Design and Power Allocation for Time Varying  Cooperative Communication
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 109-113. DOI:10.13190/jbupt.2011s1.109.shiych
    • Abstract ( 2046 )     HTML       
    • Considering the channel time variant property in cooperative communication networks, a new system scheme is designed based on the system error probability. According to the encoding function, the error correct code with optimal hamming distance is chose for different channel in order to minimize the system error probability. Furthermore, the time variant power allocation algorithm is used to allocate the transmit power between the source node and relay node. Analysis and simulate show that the proposed scheme can obtain 07 dB improvement in frame error rate.

    • References | Supplementary Material | Related Articles
    • A BGP Vulnerability on Supporting 4Octet AS Number Space
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 114-118. DOI:10.13190/jbupt.2011s1.114.zhongjx
    • Abstract ( 1905 )     HTML       
    • A new border gateway protocol (BGP) security problem, multiexitdiscriminator (MED) vulnerability, has been discovered, which could be abused in data hijacking. For the reason that BGP devices may not operate as expected with the extension of 4octet autonomous system (AS) number, data streams could be diverted to other Internet service providers unconsciously and bring serious threat to the global network. In addition the weakness is simulated under the environment of Cisco routers, and a kind of maninthemiddle data hijack based on the MED flaw is implemented and verified through the experiment.

    • References | Supplementary Material | Related Articles
    • Performance of Nonbinary LDPC Codes over Noise Burst Channels
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 119-122. DOI:10.13190/jbupt.2011s1.119.208
    • Abstract ( 2038 )     HTML       
    • The performances of nonbinary lowdensity paritycheck (LDPC) codes are studied and simulated on the presented noise burst channel model. Compared to binary LDPC codes, the nonbinary LDPC codes have a better antibursterror performance. The reason is given by analyzing the process of decoding. The transformation between binary soft information and nonbinary initial soft information is also presented. Simulations show that nonbinary LDPC codes have advantages of error performance and iterative characteristics with different parameters for noise burst channels.

    • References | Supplementary Material | Related Articles
    • A Simple SemiBlind Equalization Method for Precoding Single Carrier Systems
    • Journal of Beijing University of Posts and Telecommunications. 2011, 34(s1): 127-131. DOI:10.13190/jbupt.2011s1.127.jumy
    • Abstract ( 2239 )     HTML       
    • Blind equalization is of advantage of high efficient data transmission rate and disadvantages such as complicated algorithms, complicated computations and slow convergences. Considering precoding single carrier systems with frequency domain equalization, a semiblind equalization method based on Bussgang algorithm is proposed. The error signal of this method is skillfully designed so that the similar Bussgang algorithm can be used. At the same time, its convergence speed becomes faster due to selecting initialization. The method can be implemented easily because it does not need complex inversion computation compared with the existing related method. Simulation shows that the proposed method outperforms the existing algorithm.

    • References | Supplementary Material | Related Articles