Takeshi AMISHIMA Toshio WAKAYAMA
Our goal is to use a single passive moving sensor to determine the locations of multiple radio stations. The conventional method uses only direction-of-arrival (DOA) measurements, and its performance is poor when emitters are located closely in the lateral direction, even if they are not close in the range direction, or in the far field from the moving sensor, resulting in similar DOAs for several emitters. This paper proposes a new method that uses the power of the received signals as well as DOA. The received signal power is a function of the inverse of the squared distance between an emitter and the moving sensor. This has the advantage of providing additional information in the range direction; therefore, it can be used for data association as additional information when emitter ranges are different from each other. Simulations showed that the success rate of the conventional method is 73%, whereas that of the proposed method is 97%, an overall 24-percentage-point improvement. The localization error of the proposed method is also reduced to half that of the conventional method. We further investigated its performance with different emitter and sensor configurations. In all cases, the proposed method proved superior to the conventional method.
We consider device-to-device (D2D) direct communication underlying cellular networks where the D2D link reuses the frequency resources of the cellular downlink. In this paper, we propose a linear precoder design scheme for a base station (BS) and D2D transmitter using the weighted sum-rate of the cellular downlink and D2D link as a cost function. Because the weighted sum-rate maximization problem is not convex on the precoding matrices of BS and D2D transmitters, an equivalent mean-squared error (MSE) minimization problem which is convex on the precoding matrices is proposed by introducing auxiliary matrices. We show that the two optimization problems have the same optimal solution for the precoding matrices. Then, an iterative algorithm for solving the equivalent MSE minimization problem is presented. Through a computer simulation, we show that the proposed scheme offers better weighted sum-rate performance that a conventional scheme.
Yande XIANG Jiahui LUO Taotao ZHU Sheng WANG Xiaoyan XIANG Jianyi MENG
Arrhythmia classification based on electrocardiogram (ECG) is crucial in automatic cardiovascular disease diagnosis. The classification methods used in the current practice largely depend on hand-crafted manual features. However, extracting hand-crafted manual features may introduce significant computational complexity, especially in the transform domains. In this study, an accurate method for patient-specific ECG beat classification is proposed, which adopts morphological features and timing information. As to the morphological features of heartbeat, an attention-based two-level 1-D CNN is incorporated in the proposed method to extract different grained features automatically by focusing on various parts of a heartbeat. As to the timing information, the difference between previous and post RR intervels is computed as a dynamic feature. Both the extracted morphological features and the interval difference are used by multi-layer perceptron (MLP) for classifing ECG signals. In addition, to reduce memory storage of ECG data and denoise to some extent, an adaptive heartbeat normalization technique is adopted which includes amplitude unification, resolution modification, and signal difference. Based on the MIT-BIH arrhythmia database, the proposed classification method achieved sensitivity Sen=93.4% and positive predictivity Ppr=94.9% in ventricular ectopic beat (VEB) detection, sensitivity Sen=86.3% and positive predictivity Ppr=80.0% in supraventricular ectopic beat (SVEB) detection, and overall accuracy OA=97.8% under 6-bit ECG signal resolution. Compared with the state-of-the-art automatic ECG classification methods, these results show that the proposed method acquires comparable accuracy of heartbeat classification though ECG signals are represented by lower resolution.
Juan YU Peizhong LU Jianmin HAN Jianfeng LU
Traffic signal phase and timing (TSPaT) information is valuable for various applications, such as velocity advisory systems, navigation systems, collision warning systems, and so forth. In this paper, we focus on learning baseline timing cycle lengths for fixed-time traffic signals. The cycle length is the most important parameter among all timing parameters, such as green lengths. We formulate the cycle length learning problem as a period estimation problem using a sparse set of noisy observations, and propose the most frequent approximate greatest common divisor (MFAGCD) algorithms to solve the problem. The accuracy performance of our proposed algorithms is experimentally evaluated on both simulation data and the real taxi GPS trajectory data collected in Shanghai, China. Experimental results show that the MFAGCD algorithms have better sparsity and outliers tolerant capabilities than existing cycle length estimation algorithms.
Masahiro KANO Toru NAKURA Tetsuya IIZUKA Kunihiro ASADA
This paper proposes a triangular active charge injection method to reduce resonant power supply noise by injecting the adequate amount of charge into the supply line of the LSI in response to the current consumption of the core circuit. The proposed circuit is composed of three key components, a voltage drop detector, an injection controller circuit and a canceling capacitor circuit. In addition to the theoretical analysis of the proposed method, the measurement results indicate that our proposed method with active capacitor can realize about 14% noise reduction compared with the original noise amplitude. The proposed circuit consumes 25.2 mW in steady state and occupies 0.182 mm2.
Chaowei DUAN Yafeng ZHAN Hao LIANG
Stochastic resonance can improve the signal-to-noise ratio of digital baseband signals. However, the output of SR system needs some time for evolution to achieve global steady-state. This paper first analyzes the evolution time of SR systems, which is an important factor for digital baseband signal processing based on SR. This investigation shows that the sampling number per symbol should be rather large, and the minimum sampling number per symbol is deduced according to the evolution time of SR system.
Carlos Cesar CORTES TORRES Hayate OKUHARA Nobuyuki YAMASAKI Hideharu AMANO
In the past decade, real-time systems (RTSs), which must maintain time constraints to avoid catastrophic consequences, have been widely introduced into various embedded systems and Internet of Things (IoTs). The RTSs are required to be energy efficient as they are used in embedded devices in which battery life is important. In this study, we investigated the RTS energy efficiency by analyzing the ability of body bias (BB) in providing a satisfying tradeoff between performance and energy. We propose a practical and realistic model that includes the BB energy and timing overhead in addition to idle region analysis. This study was conducted using accurate parameters extracted from a real chip using silicon on thin box (SOTB) technology. By using the BB control based on the proposed model, about 34% energy reduction was achieved.
Heemang SONG Seunghoon CHO Kyung-Jin YOU Hyun-Chool SHIN
In this paper, we propose an automotive radar sensor compensation method improving direction of arrival (DOA) and preventing target split tracking. Amplitude and phase mismatching and mutual coupling between radar sensor arrays cause an inaccuracy problem in DOA estimation. By quantifying amplitude and phase distortion levels for each angle, we compensate the sensor distortion. Applying the proposed method to Bartlett, Capon and multiple signal classification (MUSIC) algorithms, we experimentally demonstrate the performance improvement using both experimental data from the chamber and real data obtained in actual road.
Ryohei SASAKI Katsumi KONISHI Tomohiro TAKAHASHI Toshihiro FURUKAWA
This letter deals with an audio declipping problem and proposes a multiple matrix rank minimization approach. We assume that short-time audio signals satisfy the autoregressive (AR) model and formulate the declipping problem as a multiple matrix rank minimization problem. To solve this problem, an iterative algorithm is provided based on the iterative partial matrix shrinkage (IPMS) algorithm. Numerical examples show its efficiency.
Hiroki ASANO Tetsuya HIROSE Taro MIYOSHI Keishi TSUBAKI Toshihiro OZAKI Nobutaka KUROKI Masahiro NUMA
This paper presents a fully integrated 32-MHz relaxation oscillator (ROSC) capable of sub-1-µs start-up time operation for low-power intermittent VLSI systems. The proposed ROSC employs current mode architecture that is different from conventional voltage mode architecture. This enables compact and fast switching speed to be achieved. By designing transistor sizes equally between one in a bias circuit and another in a voltage to current converter, the effect of process variation can be minimized. A prototype chip in a 0.18-µm CMOS demonstrated that the ROSC generates a stable clock frequency of 32.6 MHz within 1-µs start-up time. Measured line regulation and temperature coefficient were ±0.69% and ±0.38%, respectively.
This paper shows an optimal spreading sequence in the Weyl sequence class, which is similar to the set of the Oppermann sequences for asynchronous CDMA systems. Sequences in Weyl sequence class have the desired property that the order of cross-correlation is low. Therefore, sequences in the Weyl sequence class are expected to minimize the inter-symbol interference. We evaluate the upper bound of cross-correlation and odd cross-correlation of spreading sequences in the Weyl sequence class and construct the optimization problem: minimize the upper bound of the absolute values of cross-correlation and odd cross-correlation. Since our optimization problem is convex, we can derive the optimal spreading sequences as the global solution of the problem. We show their signal to interference plus noise ratio (SINR) in a special case. From this result, we propose how the initial elements are assigned, that is, how spreading sequences are assigned to each users. In an asynchronous CDMA system, we also numerically compare our spreading sequences with other ones, the Gold codes, the Oppermann sequences, the optimal Chebyshev spreading sequences and the SP sequences in Bit Error Rate. Our spreading sequence, which yields the global solution, has the highest performance among the other spreading sequences tested.
Ming-Shing CHEN Wen-Ding LI Bo-Yuan PENG Bo-Yin YANG Chen-Mou CHENG
Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. In 2009, it was shown that hardware advances do not favor just “traditional” alternatives such as ECC and RSA, but also makes MPKCs faster and keeps them competitive at 80-bit security when properly implemented. These techniques became outdated due to emergence of new instruction sets and higher requirements on security. In this paper, we review how MPKC signatures changes from 2009 including new parameters (from a newer security level at 128-bit), crypto-safe implementations, and the impact of new AVX2 and AESNI instructions. We also present new techniques on evaluating multivariate polynomials, multiplications of large finite fields by additive Fast Fourier Transforms, and constant time linear solvers.
Rajesh RAMANATHAN Partha Sharathi MALLICK Thiruvengadam SUNDARAJAN JAYARAMAN
In this letter, we propose a generalized quadrature spatial modulation technique (GQSM) which offers additional bits per channel use (bpcu) gains and a low complexity greedy detector algorithm, structured orthogonal matching pursuit (S-OMP)- GQSM, based on compressive sensing (CS) framework. Simulation results show that the bit error rate (BER) performance of the proposed greedy detector is very close to maximum likelihood (ML) and near optimal detectors based on convex programming.
Yangyu FAN Rui DU Jianshu WANG
Identification of urban road targets using radar systems is usually heavily dependent on the aspect angle between the target velocity and line of sight of the radar. To improve the performance of the classification result when the target is in a cross range position relative to the radar, a method based on range micro Doppler signature is proposed in this paper. Joint time-frequency analysis is applied in every range cell to extract the time Doppler signature. The spectrograms from all of the target range cells are combined to form the range micro Doppler signature to allow further identification. Experiments were conducted to investigate the performance of the proposed method, and the results proved the effectiveness of the method presented.
In this paper, we consider to develop a recovery algorithm of a sparse signal for a compressed sensing (CS) framework over finite fields. A basic framework of CS for discrete signals rather than continuous signals is established from the linear measurement step to the reconstruction. With predetermined priori distribution of a sparse signal, we reconstruct it by using a message passing algorithm, and evaluate the performance obtained from simulation. We compare our simulation results with the theoretic bounds obtained from probability analysis.
Koichi TAKIGUCHI Takaaki NAKAGAWA Takaaki MIWA
We propose and demonstrate a method that can demultiplex an optical OFDM signal with various capacity based on time lens-based optical Fourier transform. The proposed tunable optical OFDM signal demultiplexer is composed of a phase modulator and a tunable chromatic dispersion emulator. The spectrum of the variable capacity OFDM signal is transformed into Nyquist time-division multiplexing pulses with the optical Fourier transform, and the OFDM sub-carrier channels are dumultiplexed in the time-domain. We also propose a simple method for approximating and generating quadratic waveform to drive the phase modulator. After explaining the operating principle of the method and the design of some parameters in detail, we show successful demultiplexing of 4×8 and 4×10 Gbit/s optical OFDM signals with our proposed method as the preliminary investigation results.
Jasper Meynard P. ARANA Rothna PEC Yong Soo CHO
An efficient handover measurement technique is proposed for millimeter-wave (mm-wave) cellular systems with directional antenna beams. As the beam synchronization signal (BSS) carries the cell ID and the beam ID in a hierarchal manner, handover events (interbeam handover and intercell handover) are distinguished at the physical layer. The proposed signal metrics are shown to be effective in detecting the beam boundaries and cell boundaries in mm-wave cellular systems, which allows to distinguish interbeam handover from intercell handover. The proposed handover measurement technique is shown to reduce the processing time significantly using the proposed signal metrics produced by the BSS.
Hiroomi HIKAWA Masayuki TAMAKI Hidetaka ITO
An FPGA-based hardware hand sign recognition system was proposed in our previous work. The hand sign recognition system consisted of a preprocessing and a self-organizing map (SOM)-Hebb classifier. The training of the SOM-Hebb classifier was carried out by an off-chip computer using training vectors given by the system. The recognition performance was reportedly improved by adding perturbation to the training data. The perturbation was added manually during the process of image capture. This paper proposes a new off-chip training method with automatic performance improvement. To improve the system's recognition performance, the off-chip training system adds artificially generated perturbation to the training feature vectors. Advantage of the proposed method compared to additive scale perturbation to image is its low computational cost because the number of feature vector elements is much less than that of pixels contained in image. The feasibility of the proposed off-chip training was tested in simulations and experiments using American sign language (ASL). Simulation results showed that the proposed perturbation computation alters the feature vector so that it is same as the one obtained by a scaled image. Experimental results revealed that the proposed off-chip training improved the recognition accuracy from 78.9% to 94.3%.
Leiou WANG Donghui WANG Chengpeng HAO
SUMPLE, one of important signal combining approaches, its combining loss increases when a sensor in an array fails. A novel failure detection circuit for SUMPLE is proposed by using variability index. This circuit can effectively judge whether a sensor fails or not. Simulation results validate its effectiveness with respect to the existing algorithms.
Qiang GAO Wenping MA Wei LUO Feifei ZHAO
Key predistribution schemes (KPSs) have played an important role in security of wireless sensor networks (WSNs). Due to comprehensive and simple structures, various types of combinatorial designs are used to construct KPSs. In general, compared to random KPSs, combinatorial KPSs have higher local connectivity but lower resilience against a node capture attack. In this paper, we apply two methods based on hash chains on KPSs based on transversal designs (TDs) to improve the resilience and the expressions for the metrics of the resulting schemes are derived.