Kento TERAI Daisuke ANZAI Kyesan LEE Kentaro YANAGIHARA Shinsuke HARA
In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.
By using a quadratic compensation slope, a CMOS current-mode buck DC-DC converter with constant frequency characteristics over wide input and output voltage ranges has been developed. The use of a quadratic slope instead of a conventional linear slope makes both the damping factor in the transfer function and the frequency bandwidth of the current feedback loop independent of the converter's output voltage settings. When the coefficient of the quadratic slope is chosen to be dependent on the input voltage settings, the damping factor in the transfer function and the frequency bandwidth of the current feedback loop both become independent of the input voltage settings. Thus, both the input and output voltage dependences in the current feedback loop are eliminated, the frequency characteristics become constant, and the frequency bandwidth is maximized. To verify the effectiveness of a quadratic compensation slope with a coefficient that is dependent on the input voltage in a buck DC-DC converter, we fabricated a test chip using a 0.18 µm high-voltage CMOS process. The evaluation results show that the frequency characteristics of both the total feedback loop and the current feedback loop are constant even when the input and output voltages are changed from 2.5 V to 7 V and from 0.5 V to 5.6 V, respectively, using a 3 MHz clock.
Jinmyoung KIM Toru NAKURA Hidehiro TAKATA Koichiro ISHIBASHI Makoto IKEDA Kunihiro ASADA
Switched parasitic capacitors of sleep blocks with a tri-mode power gating structure are implemented to reduce on-chip resonant supply noise in 1.2 V, 65 nm standard CMOS process. The tri-mode power gating structure makes it possible to store charge into the parasitic capacitance of the power gated blocks. The proposed method achieves 53.1% and 57.9% noise reduction for wake-up noise and 130 MHz periodic supply noise, respectively. It also realizes noise cancelling without discharging time before using parasitic capacitors of sleep blocks, and shows 8.4x boost of the effective capacitance value with 2.1% chip area overhead. The proposed method can save the chip area for reducing resonant supply noise more effectively.
Shouyi YIN Yang HU Zhen ZHANG Leibo LIU Shaojun WEI
Hybrid wired/wireless on-chip network is a promising communication architecture for multi-/many-core SoC. For application-specific SoC design, it is important to design a dedicated on-chip network architecture according to the application-specific nature. In this paper, we propose a heuristic wireless link allocation algorithm for creating hybrid on-chip network architecture. The algorithm can eliminate the performance bottleneck by replacing multi-hop wired paths by high-bandwidth single-hop long-range wireless links. The simulation results show that the hybrid on-chip network designed by our algorithm improves the performance in terms of both communication delay and energy consumption significantly.
Takayuki YAMADA Doohwan LEE Hiroyuki SHIBA Yo YAMAGUCHI Kazunori AKABANE Kazuhiro UEHARA
We previously proposed a unified wireless system called “Flexible Wireless System”. Comprising of flexible access points and a flexible signal processing unit, it collectively receives a wideband spectrum that includes multiple signals from various wireless systems. In cases of simultaneous multiple signal reception, however, reception performance degrades due to the interference among multiple signals. To address this problem, we propose a new signal separation and reconstruction method for spectrally overlapped signals. The method analyzes spectral information obtained by the short-time Fourier transform to extract amplitude and phase values at each center frequency of overlapped signals at a flexible signal processing unit. Using these values enables signals from received radio wave data to be separated and reconstructed for simultaneous multi-system reception. In this paper, the BER performance of the proposed method is evaluated using computer simulations. Also, the performance of the interference suppression is evaluated by analyzing the probability density distribution of the amplitude of the overlapped interference on a symbol of the received signal. Simulation results confirmed the effectiveness of the proposed method.
Yibo FAN Jialiang LIU Dexue ZHANG Xiaoyang ZENG Xinhua CHEN
Fidelity Range Extension (FRExt) (i.e. High Profile) was added to the H.264/AVC recommendation in the second version. One of the features included in FRExt is the Adaptive Block-size Transform (ABT). In order to conform to the FRExt, a Fractional Motion Estimation (FME) architecture is proposed to support the 88/44 adaptive Hadamard Transform (88/44 AHT). The 88/44 AHT circuit contributes to higher throughput and encoding performance. In order to increase the utilization of SATD (Sum of Absolute Transformed Difference) Generator (SG) in unit time, the proposed architecture employs two 8-pel interpolators (IP) to time-share one SG. These two IPs can work in turn to provide the available data continuously to the SG, which increases the data throughput and significantly reduces the cycles that are needed to process one Macroblock. Furthermore, this architecture also exploits the linear feature of Hadamard Transform to generate the quarter-pel SATD. This method could help to shorten the long datapath in the second-step of two-iteration FME algorithm. Finally, experimental results show that this architecture could be used in the applications requiring different performances by adjusting the supported modes and operation frequency. It can support the real-time encoding of the seven-mode 4 K2 K@24 fps or six-mode 4 K2 K@30 fps video sequences.
Alex VALDIVIELSO CHIAN Toshiyuki MIYAMOTO
In this letter, we present the evaluation of an option-based learning algorithm, developed to perform a conflict-free allocation of calls among cars in a multi-car elevator system. We evaluate its performance in terms of the service time, its flexibility in the task-allocation, and the load balancing.
Yun Kyoung HAN Jin-Ho CHUNG Kyeongcheol YANG
No nontrivial optimal sets of frequency-hopping sequences (FHSs) of period 2(2n-1) for a positive integer n ≥ 2 have been found so far, when their frequency set sizes are less than their periods. In this paper, systematic doubling methods to construct new FHS sets are presented under the constraint that the set of frequencies has size less than or equal to 2n. First, optimal FHS sets with respect to the Peng-Fan bound are constructed when frequency set size is either 2n-1 or 2n. And then, near-optimal FHS sets with frequency set size 2n-1 are designed by applying the Chinese Remainder Theorem to Sidel'nikov sequences, whose FHSs are optimal with respect to the Lempel-Greenberger bound. Finally, a general construction is given for near-optimal FHS sets whose frequency set size is less than 2n-1. Our constructions give new parameters not covered in the literature, which are summarized in Table1.
Masaaki NAGAHARA Takahiro MATSUDA Kazunori HAYASHI
In remote control, efficient compression or representation of control signals is essential to send them through rate-limited channels. For this purpose, we propose an approach of sparse control signal representation using the compressive sampling technique. The problem of obtaining sparse representation is formulated by cardinality-constrained
This paper proposes a direction-of-arrival (DOA) estimation method of multiple speech sources from a stereophonic mixture in an underdetermined case where the number of sources exceeds the number of sensors. The method relies on the sparseness of speech signals in time-frequency (T-F) domain representation which means multiple independent speakers have a small overlap. At first, a selection of T-F cells bearing reliable spatial information is proposed by an introduced reliability index which is defined by the estimated interaural phase difference at each T-F cell. Then, a statistical error propagation model between the phase difference at T-F cell and its consequent DOA is introduced. By employing this model and the sparseness in T-F domain the DOA estimation problem is altered to obtaining local peaks of probability density function of DOA. Finally the kernel density estimator approach based on the proposed statistical model is applied. The performance of the proposed method is assessed by conducted experiments. Our method outperforms others both in accuracy for real observed data and in robustness for simulation with additional diffused noise.
Bin SHENG Pengcheng ZHU Xiaohu YOU Lan CHEN
In this letter, a novel resource allocation method is proposed for Discrete Fourier Transform Spread Orthogonal Frequency Division Multiple Access (DFT-s-OFDMA) systems in Long Term Evolution (LTE). The proposed method is developed based on a minimal metric loss criterion and performs better than the commonly used Recursive Maximum Expansion (RME) method.
Kazuo ONO Yoshimitsu YANAGAWA Akira KOTABE Riichiro TAKEMURA Tatsuo NAKAGAWA Tomio IWASAKI Takayuki KAWAHARA
A charge-integration read scheme has been developed for a solid-nanopore DNA-sequencer that determines a genome by direct and electrical measurements of transverse tunneling current in single-stranded DNA. The magnitude of the current was simulated with a first-principles molecular dynamics method. It was found that the magnitude is as small as in the sub-pico ampere range, and signals from four bases represent wide distributions with overlaps between each base. The distribution is believed to originate with translational and rotational motion of DNA in a nanopore with a frequency of over 105 Hz. A sequence scheme is presented to distinguish the distributed signals. The scheme makes widely distributed signals time-integrated convergent by cumulating charge at the capacitance of a nanopore device and read circuits. We estimated that an integration time of 1.4 ms is sufficient to obtain a signal difference of over 10 mV for distinguishing between each DNA base. Moreover, the time is shortened if paired bases, such as A-T and C-G in double-stranded DNA, can be measured simultaneously with two nanopores. Circuit simulations, which included the capacitance of a nanopore calculated with a device simulator, successfully distinguished between DNA bases in less than 2.0 ms. The speed is roughly six orders faster than that of a conventional DNA sequencer. It is possible to determine the human genome in one day if 100-nanopores are operated in parallel.
Sombut FOITONG Ouen PINNGERN Boonwat ATTACHOO
Feature selection (FS) plays an important role in pattern recognition and machine learning. FS is applied to dimensionality reduction and its purpose is to select a subset of the original features of a data set which is rich in the most useful information. Most existing FS methods based on rough set theory focus on dependency function, which is based on lower approximation as for evaluating the goodness of a feature subset. However, by determining only information from a positive region but neglecting a boundary region, most relevant information could be invisible. This paper, the maximal lower approximation (Max-Certainty) – minimal boundary region (Min-Uncertainty) criterion, focuses on feature selection methods based on rough set and mutual information which use different values among the lower approximation information and the information contained in the boundary region. The use of this idea can result in higher predictive accuracy than those obtained using the measure based on the positive region (certainty region) alone. This demonstrates that much valuable information can be extracted by using this idea. Experimental results are illustrated for discrete, continuous, and microarray data and compared with other FS methods in terms of subset size and classification accuracy.
Jun SHIBAYAMA Keisuke WATANABE Ryoji ANDO Junji YAMAUCHI Hisamatsu NAKANO
A Drude-critical points (D-CP) model for considering metal dispersion is newly incorporated into the frequency-dependent FDTD method using the simple trapezoidal recursive convolution (TRC) technique. Numerical accuracy is investigated through the analysis of pulse propagation in a metal (aluminum) cladding waveguide. The TRC technique with a single convolution integral is found to provide higher accuracy, when compared with the recursive convolution counterpart. The methodology is also extended to the unconditionally stable FDTD based on the locally one-dimensional scheme for efficient frequency-dependent calculations.
Namzilp LERTWIRAM Gia Khanh TRAN Keiichi MIZUTANI Kei SAKAGUCHI Kiyomichi ARAKI
Setting relays can address the shadowing problem between a transmitter (Tx) and a receiver (Rx). Moreover, the Multiple-Input Multiple-Output (MIMO) technique has been introduced to improve wireless link capacity. The MIMO technique can be applied in relay network to enhance system performance. However, the efficiency of relaying schemes and relay placement have not been well investigated with experiment-based study. This paper provides a propagation measurement campaign of a MIMO two-hop relay network in 5 GHz band in an L-shaped corridor environment with various relay locations. Furthermore, this paper proposes a Relay Placement Estimation (RPE) scheme to identify the optimum relay location, i.e. the point at which the network performance is highest. Analysis results of channel capacity show that relaying technique is beneficial over direct transmission in strong shadowing environment while it is ineffective in non-shadowing environment. In addition, the optimum relay location estimated with the RPE scheme also agrees with the location where the network achieves the highest performance as identified by network capacity. Finally, the capacity analysis shows that two-way MIMO relay employing network coding has the best performance while cooperative relaying scheme is not effective due to shadowing effect weakening the signal strength of the direct link.
In this paper, we study the problem of distributed spectrum allocation under a vertical spectrum sharing scenario in a cognitive radio network. The secondary users share the spectrum licensed to the primary user by observing the activity statistics of the primary users, and regulate their transmission strategy in order to abide by the spectrum sharing etiquette. When the primary user is inactive in a subset of the available frequency bands, from the perspective of the secondary users the problem reduces to a distributed horizontal spectrum sharing. For a specific class of networks, the latter problem is addressed by the recently proposed GADIA algorithm [1]. In this paper, we present analytical and numerical results on the performance of the GADIA algorithm in conjunction with the above-mentioned vertical spectrum sharing scenario. These results reveal near-optimal performance guarantees for the overall vertical spectrum sharing scenario.
Takuya KUSAKA Ryuhei YOKOYAMA Toru FUJIWARA
A recursive and efficient method for generating binary vectors in non-increasing order of their likelihood for a set of all binary vectors is proposed. Numerical results on experiments show the effectiveness of this method. Efficient decoding algorithms with simulation results are also proposed as applications of the method.
Qihui WU Yuhua XU Zhiyong DU Jinlong WANG Alagan ANPALAGAN
This letter proposes a novel connected dominanting set based decentralized cooperative spectrum sensing algorithm for cognitive radio networks. It is analytically shown that the proposed algorithm distributively converges to the average consensus as that of traditional distributed consensus algorithm, while reducing both the convergence time and message complexity significantly.
In recent wireless communication systems, security is ensured mainly in the upper-layer techniques such as a password or a cryptography processing. However, security needs not be restricted to the upper-layer and the addition of physical-layer security also would yield a much more robust system. Therefore, in this paper, we exploit chaos communication and propose a chaos multiple-input multiple-output (MIMO) transmission scheme which achieves physical-layer security and additional channel-coding gain. A chaotic modulation symbol is multiplied to the data to be transmitted at each MIMO antenna to exploit the MIMO antenna diversity, and at the receiver, the joint MIMO detection and chaos decoding is done by maximum likelihood decoding (MLD). The conventional chaos modulation suffers from bit error rate (BER) performance degradation, while the coding gain is obtained in the proposed scheme by the chaos modulation in MIMO. We evaluate the performances of the proposed scheme by an analysis and computer simulations.
Reliable detection of the licensed user signal is a pre-requirement for avoiding interference to the licensed user in a CR network. Cooperative spectrum sensing (CSS) is able to offer improved sensing performance compared to individual sensing. In this paper, we propose a robust soft combination rule based on the Kullback-Leibler divergence (KL-divergence) for CSS. The proposed scheme is able to obtain a similar sensing performance compared to that of maximum gain combination (MGC) without requiring signal to noise ratio (SNR) information. In addition, the proposed scheme protects the sensing process against common types of malicious users without a malicious user identification step. The simulation results demonstrate the effectiveness of the proposed scheme.