Spectrum sensing is one of the main functions in cognitive radio networks. To improve the sensing performance and increase spectrum efficiency, a number of cooperative spectrum sensing methods have been proposed. However, most of these methods focused on a single-channel environment. In this letter, we present a novel cooperative spectrum sensing method based on cooperator selection in a multi-channel cognitive radio network. Using reinforcement learning, a cognitive radio user can select reliable and robust cooperators, without any a priori knowledge. Using the proposed method, a cognitive radio user can achieve better sensing capability and overcome performance degradation problems due to malicious users or erratic user behavior. Numerical results show that the proposed method can achieve excellent performance.
Yongwon JEONG Sangjun LIM Young Kuk KIM Hyung Soon KIM
We present an acoustic model adaptation method where the transformation matrix for a new speaker is given by the product of bases and a weight matrix. The bases are built from the parallel factor analysis 2 (PARAFAC2) of training speakers' transformation matrices. We perform continuous speech recognition experiments using the WSJ0 corpus.
This letter introduces innovative VAD based on horizontal spectral entropy with long-span of time (HSELT) feature sets to improve mobile ASR performance in low signal-to-noise ratio (SNR) conditions. Since the signal characteristics of nonstationary noise change with time, we need long-term information of the noisy speech signal to define a more robust decision rule yielding high accuracy. We find that HSELT measures can horizontally enhance the transition between speech and non-speech segments. Based on this finding, we use the HSELT measures to achieve high accuracy for detecting speech signal form various stationary and nonstationary noises.
Bongsub SONG Kyunghoon KIM Junan LEE Kwangsoo KIM Younglok KIM Jinwook BURM
A complete 4-level pulse amplitude modulation (4-PAM) serial link transceiver including a wide frequency range clock generator and clock data recovery (CDR) is proposed in this paper. A dual-loop architecture, consisting of a frequency locked loop (FLL) and a phase locked loop (PLL), is employed for the wide frequency range clocks. The generated clocks from the FLL (clock generator) and the PLL (CDR) are utilized for a transmitter clock and a receiver clock, respectively. Both FLL and PLL employ the identical voltage controlled oscillators consisting of ring-type delay-cells. To improve the frequency tuning range of the VCO, deep triode PMOS loads are utilized for each delay-cell, since the turn-on resistance of the deep triode PMOS varies substantially by the gate-voltage. As a result, fabricated in a 0.13-µm CMOS process, the proposed 4-PAM transceiver operates from 1.5 Gb/s to 9.7 Gb/s with a bit error rate of 10-12. At the maximum data-rate, the entire power dissipation of the transceiver is 254 mW, and the measured jitter of the recovered clock is 1.61 psrms.
Hilman PARDEDE Koji IWANO Koichi SHINODA
Spectral subtraction (SS) is an additive noise removal method which is derived in an extensive framework. In spectral subtraction, it is assumed that speech and noise spectra follow Gaussian distributions and are independent with each other. Hence, noisy speech also follows a Gaussian distribution. Spectral subtraction formula is obtained by maximizing the likelihood of noisy speech distribution with respect to its variance. However, it is well known that noisy speech observed in real situations often follows a heavy-tailed distribution, not a Gaussian distribution. In this paper, we introduce a q-Gaussian distribution in the non-extensive statistics to represent the distribution of noisy speech and derive a new spectral subtraction method based on it. We found that the q-Gaussian distribution fits the noisy speech distribution better than the Gaussian distribution does. Our speech recognition experiments using the Aurora-2 database showed that the proposed method, q-spectral subtraction (q-SS), outperformed the conventional SS method.
Biling ZHANG Kai CHEN Jung-lang YU Shiduan CHENG
In cognitive radio networks, the primary user (PU) can lease a fraction of its licensed spectrum to the secondary users (SUs) in exchange for their cooperative transmission if it has a minimum transmission rate requirement and is experiencing a bad channel condition. However, due to the selfish nature of the SUs, they may not cooperate to meet the PU's Quality of Service (QoS) requirement. On the other hand, the SUs may not exploit efficiently the benefit from cooperation if they compete with each other and collaborate with the PU independently. Therefore, when SUs belong to the same organization and can work as a group, how to stimulate them to cooperate with the PU and thus guarantee the PU's QoS requirement, and how to coordinate the usage of rewarded spectrum among these SUs after cooperation are critical challenges. In this paper, we propose a two-level bargaining framework to address the aforementioned problems. In the proposed framework, the interactions between the PU and the SUs are modeled as the upper level bargaining game while the lower level bargaining game is used to formulate the SUs' decision making process on spectrum sharing. We analyze the optimal actions of the users and derive the theoretic results for the one-PU one-SU scenario. To find the solutions for the one-PU multi-SU scenario, we put forward a revised numerical searching algorithm and prove its convergence. Finally, we demonstrate the effectiveness and efficiency of the proposed scheme through simulations.
Daesung JUNG Youngjun YOO Yujin JANG Sangchul WON
We propose a motor speed ripple elimination method using a state dependent disturbance observer (SDDOB). The SDDOB eliminates the state dependent disturbance in the system regardless of the operation frequency, input time delay and output time delay. The SDDOB and a main proportional integral (PI) controller constitute a robust motor speed controller. Experimental results show the effectiveness of the proposed method.
Yinqiang ZHENG Shigeki SUGIMOTO Masatoshi OKUTOMI
We propose an accurate and scalable solution to the perspective-n-point problem, referred to as ASPnP. Our main idea is to estimate the orientation and position parameters by directly minimizing a properly defined algebraic error. By using a novel quaternion representation of the rotation, our solution is immune to any parametrization degeneracy. To obtain the global optimum, we use the Grobner basis technique to solve the polynomial system derived from the first-order optimality condition. The main advantages of our proposed solution lie in accuracy and scalability. Extensive experiment results, with both synthetic and real data, demonstrate that our proposed solution has better accuracy than the state-of-the-art noniterative solutions. More importantly, by exploiting vectorization operations, the computational cost of our ASPnP solution is almost constant, independent of the number of point correspondences n in the wide range from 4 to 1000. In our experiment settings, the ASPnP solution takes about 4 milliseconds, thus best suited for real-time applications with a drastically varying number of 3D-to-2D point correspondences.
Tai-Ming CHANG Yi-Ming SHIU Pao-Chi CHANG
This work presents a four-channel headset achieving a 5.1-channel-like hearing experience using a low-complexity head-related transfer function (HRTF) model and a simplified reverberator. The proposed down-mixing architecture enhances the sound localization capability of a headset using the HRTF and by simulating multiple sound reflections in a room using Moorer's reverberator. Since the HRTF has large memory and computation requirements, the common-acoustical-pole and zero (CAPZ) model can be used to reshape the lower-order HRTF model. From a power consumption viewpoint, the CAPZ model reduces computation complexity by approximately 40%. The subjective listening tests in this study shows that the proposed four-channel headset performs much better than stereo headphones. On the other hand, the four-channel headset that can be implemented by off-the-shelf components preserves the privacy with low cost.
Masanori FURUTA Ippei AKITA Junya MATSUNO Tetsuro ITAKURA
This paper presents a 7-bit 1.5-GS/s time-interleaved (TI) SAR ADC. The scheme achieves better isolation between sub-ADCs thanks to embedding a track-and-hold (T/H) amplifier and reference voltage buffer in each sub-ADC. The proposed dynamic T/H circuit enables high-speed, low-power operation. The prototype is fabricated in a 65-nm CMOS technology. The total active area is 0.14,mm2 and the ADC consumes 36 mW from a 1.2-V supply. The measured results show the peak spurious-free dynamic range (SFDR) and signal-to-noise-and-distortion ratio (SNDR) are 52.4 dB and 39.6 dB, respectively, and an figure of Merit (FoM) of 300 fJ/conv. is achieved.
Shinsuke SAKAI Tatsuya KAWAHARA
Corpus-based concatenative speech synthesis has been widely investigated and deployed in recent years since it provides a highly natural synthesized speech quality. The amount of computation required in the run time, however, can often be quite large. In this paper, we propose early stopping schemes for Viterbi beam search in the unit selection, with which we can stop early in the local Viterbi minimization for each unit as well as in the exploration of candidate units for a given target. It takes advantage of the fact that the space of the acoustic parameters of the database units is fixed and certain lower bounds of the concatenation costs can be precomputed. The proposed method for early stopping is admissible in that it does not change the result of the Viterbi beam search. Experiments using probability-based concatenation costs as well as distance-based costs show that the proposed methods of admissible stopping effectively reduce the amount of computation required in the Viterbi beam search while keeping its result unchanged. Furthermore, the reduction effect of computation turned out to be much larger if the available lower bound for concatenation costs is tighter.
Dynamic spectrum leasing (DSL) is regarded as a promising dynamic spectrum sharing (DSS) scheme both to improve the spectrum revenue of primary users (PUs) and to guarantee the QoS of secondary users (SUs). A pricing-based DSL termed PBDSL is formulated as a Stackelberg DSL game model, where PUs as players entering the interacting game with multiple SUs. The strategic design contains both optimal spectrum pricing schemes (including unit spectrum/interference price and interference sensitivity distributed adjustments) of PUs for the specific shared/leased spectrum and optimal transmission strategies (e.g., transmit power and bandwidth) of SUs. To capture two types of competition relationships among multiple SUs and between SUs and PUs, we investigate two intra-game models of multiple PUs and SUs, respectively, which interact with each other to constitute the final Stackelberg DSL game. The existence and uniqueness of Stackelberg equilibrium solution (SES) are analyzed and proved for presented games, based on which a joint multi-stage PBDSL algorithm is presented to approximate the optimal equilibrium strategies. Numerical results demonstrate the convergence property of the interactive decision-making process, and verify the effectiveness of the proposed algorithm, in a comparison with the Nash equilibrium solution (NES)-based approach.
Xing LIU Daiyuan PENG Xianhua NIU Fang LIU
In order to evaluate the goodness of frequency hopping (FH) sequence design, the periodic Hamming correlation function is used as an important measure. But aperiodic Hamming correlation of FH sequences matters in real applications, while it received little attraction in the literature compared with periodic Hamming correlation. In this paper, the new aperiodic Hamming correlation lower bounds for FH sequences, with respect to the size of the frequency slot set, the sequence length, the family size, the maximum aperiodic Hamming autocorrelation and the maximum aperiodic Hamming crosscorrelation are established. The new aperiodic bounds are tighter than the Peng-Fan bounds. In addition, the new bounds include the second powers of the maximum aperiodic Hamming autocorrelation and the maximum aperiodic Hamming crosscorrelation but the Peng-Fan bounds do not include them. For the given sequence length, the family size and the frequency slot set size, the values of the maximum aperiodic Hamming autocorrelation and the maximum aperiodic Hamming crosscorrelation are inside of an ellipse which is given by the new aperiodic bounds.
Linfeng LIANG Jun WANG Jian SONG
An improved spectrum sensing method based on PN autocorrelation (PNAC) for Digital Terrestrial Television Multimedia Broadcasting (DTMB) system is proposed in this paper. The low bound of miss-detection probability and the decision threshold for a given false alarm probability are studied. The performances of proposed method and existing methods are compared through computer simulations under both non-time dispersive channel and time dispersive channel. Simulation results show that the proposed method has better performance than the original PNAC-based method, and is more robust to both carrier frequency offset (CFO) and time dispersion of the channel than the existing method based on PN cross-correlation (PNCC).
I propose an acoustic model adaptation method using bases constructed through the sparse principal component analysis (SPCA) of acoustic models trained in a clean environment. I perform experiments on adaptation to a new speaker and noise. The SPCA-based method outperforms the PCA-based method in the presence of babble noise.
Peng HAN Hua TIAN Zhensong ZHANG Wei XIE
A wireless emergency communication network with a fixed allocation of spectrum resources cannot meet the tremendous demand for spectrum access when a crisis occurs. It is necessary to develop an effective spectrum access scheme to improve the performance of emergency communication systems. In this paper, we study a new emergency communication system combines cognitive radio technology and an emergency communication network. Emergency users can utility resources in a general network when traffic becomes congested in an emergency network. Non-reciprocal spectrum access scheme (NRA) and reciprocal spectrum access scheme (RA) for two heterogeneous cognitive networks, namely emergency network and general network are proposed to compare with traditional spectrum access scheme (TA). User behavior with each scheme is modeled by continuous-time Markov chains. Moreover, the blocking and dropping probabilities of users in two heterogeneous cognitive networks are derived as the performance metrics. In addition, the throughput and the spectrum utilization rate of the system are evaluated. Finally, we compare the performance of three dynamic spectrum access schemes. The simulation results show that the RA scheme is an effective scheme to enhance the performance of emergency systems.
Truc Thanh TRAN Alagan S. ANPALAGAN Hyung Yun KONG
In this article, we propose a method to reduce the impact of primary traffic on spectrum sensing performance. In practice, the sensing performance is degraded by noise-only sample in the spectrum sensing time. Therefore, we employ a time of primary user (PU) signal arrival detector in order to remove the noise-only portion. Then, we employ equal-weight-based energy detection (EWED) to provide the detection decision. The analysis and simulation results show that there exists an optimal early time of arrival (ToA) false alarm which provides better performance compared to the use of a single EWED scheme.
Takashi KAWAMOTO Masato SUZUKI Takayuki NOTO
A technique that enables a SSCG to fine-tune an output signal frequency and a spread ratio is presented. Proposed SSCG achieves the output signal frequency from 1.2 GHz to 3.0 GHz and the spread ratio from 0 to 30000 ppm. The fine-tuning technique achieves 30 ppm adjustment of the output signal frequency and 200 ppm adjustment of the spread ratio. This technique is achieved by controlling a triangular modulation signal characteristics generated by a proposed digital controlled wave generator. A proposed multi-modulus divider can have a divide ratio of 4/5 and 8/9. This SSCG has been fabricated in a 0.13-µm CMOS process. The output signal frequency-range and the spread ratio are achieved fluently from 0.1 to 3.0 GHz and from 0 to 30000 ppm, respectively. EMI noise is suppressed at less than 17.1 dB at the output signal frequency of 3.0 GHz and spread ratio of 30000 ppm.
A novel and energy-efficient algorithm with Quality-of-Service (QoS) guarantee is proposed for cooperative spectrum sensing (CSS) with soft information fusion and hard information fusion. By weighting the sensing performance and the consumption of system resources in a utility function that is maximized with respect to the number of secondary users (SUs), it is shown that the optimal number of SUs is related to the price of these QoS requirements.
Azril HANIZ Minseok KIM Md. Abdur RAHMAN Jun-ichi TAKADA
Automatic modulation classification (AMC) is an important function of radio surveillance systems in order to identify unknown signals. Many previous works on AMC have utilized signal cyclostationarity, particularly spectral correlation density (SCD), but many of them fail to address several implementation issues, such as the assumption of perfect knowledge of the symbol rate. In this paper, we discuss several practical issues, e.g. cyclic frequency mismatch, which may affect the SCD, and propose compensation techniques to overcome those issues. We also propose a novel feature extraction technique from the SCD, which utilizes the SCD of not only the original received signal, but also the squared received signal. A symbol rate estimation technique which complements the feature extraction is also proposed. Finally, the classification performance of the system is evaluated through Monte Carlo simulations using a wide variety of modulated signals, and simulation results show that the proposed technique can estimate the symbol rate and classify modulation with a probability of above 0.9 down to SNRs of 5 dB.