Due to the reuse factor reduction, the attendant increase in co-channel interference (CCI) becomes the limiting factor in the performance of the orthogonal frequency division multiplexing (OFDM) based cellular systems. In the previous work, we proposed the least mean square-blind joint maximum likelihood sequence estimation (LMS-BJMLSE) algorithm, which is effective for CCI cancellation in OFDM systems with only one receive antenna. However, LMS-BJMLSE requires a long training sequence (TS) for channel estimation, which reduces the transmission efficiency. In this paper, we propose a subcarrier identification and interpolation algorithm, in which the subcarriers are divided into groups based on the coherence bandwidth, and the slowest converging subcarrier in each group is identified by exploiting the correlation between the mean-square error (MSE) produced by LMS and the mean-square deviation (MSD) of the desired channel estimate. The identified poor channel estimate is replaced by the interpolation result using the adjacent subcarriers' channel estimates. Simulation results demonstrate that the proposed algorithm can reduce the required training sequence dramatically for both the cases of single interference and dual interference. We also generalize LMS-BJMLSE from single antenna to receiver diversity, which is shown to provide a huge improvement.
Bo GU Cheng ZHANG Kyoko YAMORI Zhenyu ZHOU Song LIU Yoshiaki TANAKA
This paper studies the impact of integrating pricing with connection admission control (CAC) on the congestion management practices in contention-based wireless random access networks. Notably, when the network is free of charge, each self-interested user tries to occupy the channel as much as possible, resulting in the inefficient utilization of network resources. Pricing is therefore adopted as incentive mechanism to encourage users to choose their access probabilities considering the real-time network congestion level. A Stackelberg leader-follower game is formulated to analyze the competitive interaction between the service provider and the users. In particular, each user chooses the access probability that optimizes its payoff, while the self-interested service provider decides whether to admit or to reject the user's connection request in order to optimize its revenue. The stability of the Stackelberg leader-follower game in terms of convergence to the Nash equilibrium is established. The proposed CAC scheme is completely distributed and can be implemented by individual access points using only local information. Compared to the existing schemes, the proposed scheme achieves higher revenue gain, higher user payoff, and higher QoS performance.
Yao YU Yu ZHOU Kanglian ZHAO Sidan DU
A novel routing protocol, named candidate-based routing, for mobile ad hoc networks is presented. Instead of flooding over the whole network, it improves and rebuilds routing paths among a limited number of candidate nodes, which are dynamically elected without incurring or exchanging any additional information. Experimental results show that the proposed protocol performs well in terms of overhead and improvement in route efficiency, especially in the high mobility speed environments.
Yu ZHOU Junfeng LI Yanqing SUN Jianping ZHANG Yonghong YAN Masato AKAGI
In this paper, we present a hybrid speech emotion recognition system exploiting both spectral and prosodic features in speech. For capturing the emotional information in the spectral domain, we propose a new spectral feature extraction method by applying a novel non-uniform subband processing, instead of the mel-frequency subbands used in Mel-Frequency Cepstral Coefficients (MFCC). For prosodic features, a set of features that are closely correlated with speech emotional states are selected. In the proposed hybrid emotion recognition system, due to the inherently different characteristics of these two kinds of features (e.g., data size), the newly extracted spectral features are modeled by Gaussian Mixture Model (GMM) and the selected prosodic features are modeled by Support Vector Machine (SVM). The final result of the proposed emotion recognition system is obtained by combining the results from these two subsystems. Experimental results show that (1) the proposed non-uniform spectral features are more effective than the traditional MFCC features for emotion recognition; (2) the proposed hybrid emotion recognition system using both spectral and prosodic features yields the relative recognition error reduction rate of 17.0% over the traditional recognition systems using only the spectral features, and 62.3% over those using only the prosodic features.
Primitive linear recurring sequences over rings are important in modern communication technology, and character sums of such sequences are used to analyze their statistical properties. We obtain a new upper bound for the character sum of primitive sequences of order n over the residue ring modulo a square-free odd integer m, and thereby improve previously known bound mn/2.