Kenichiro YASHIKI Toshinori UEMURA Mitsuru KURIHARA Yasuyuki SUZUKI Masatoshi TOKUSHIMA Yasuhiko HAGIHARA Kazuhiko KURATA
Aiming to solve the input/output (I/O) bottleneck concerning next-generation interconnections, 5×5-millimeters-squared silicon-photonics-based chip-scale optical transmitters/receivers (TXs/RXs) — called “optical I/O cores” — were developed. In addition to having a compact footprint, by employing low-power-consumption integrated circuits (ICs), as well as providing multimode-fiber (MMF) transmission in the O band and a user-friendly interface, the developed optical I/O cores allow common ease of use with applications such as multi-chip modules (MCMs) and active optical cables (AOCs). The power consumption of their hybrid-integrated ICs is 5mW/Gbps. Their high-density user-friendly optical interface has a spot-size-converter (SSC) function and permits the physical contact against the outer waveguides. As a result, they provide large enough misalignment tolerance to allow use of passive alignment and visual alignment. In a performance test, they demonstrated 25-Gbps/ch error-free operation over 300-m MMF.
Yunhua LI Bin TIAN Ke-Chu YI Quan YU
In modern communication systems, it is a critical and challenging issue for existing carrier tracking techniques to achieve near-ideal carrier synchronization without the help of pilot signals in the case of symbol rate sampling and low signal-to-noise ratio (SNR). To overcome this issue, this paper proposes an effective carrier frequency and phase offset tracking scheme which has a robust confluent synchronization architecture whose main components are a digital frequency-locked loop (FLL), a digital phase-locked loop (PLL), a modified symbol hard decision block and some sampling rate conversion blocks. As received signals are sampled at symbol baud rate, this carrier tracking scheme is still able to obtain precise estimated values of carrier synchronization parameters under the condition of very low SNRs. The performance of the proposed carrier synchronization scheme is also evaluated by using Monte-Carlo method. Simulation results confirm the feasibility of this carrier tracking scheme and demonstrate that it ensures that both the rate-3/4 irregular low-density parity-code (LDPC) coded system and the military voice transmission system utilizing the direct sequence spread spectrum (DSSS) technique achieve satisfactory bit-error rate (BER) performance at correspondingly low SNRs.
Kunihiko HIRAISHI Koichi KOBAYASHI
In previous papers by the authors, a new scheme for diagnosis of stochastic discrete event systems, called sequence profiling (SP), is proposed. From given event logs, N-gram models that approximate the behavior of the target system are extracted. N-gram models are used for discovering discrepancy between observed event logs and the behavior of the system in the normal situation. However, when the target system is a distributed system consisting of several subsystems, event sequences from subsystems may be interleaved, and SP cannot separate the faulty event sequence from the interleaved sequence. In this paper, we introduce wildcard characters into event patterns. This contributes to removing the effect by subsystems which may not be related to faults.
Siriwat KASAMWATTANAROTE Yusuke UCHIDA Shin'ichi SATOH
Bag of Visual Words (BoVW) is an effective framework for image retrieval. Query expansion (QE) further boosts retrieval performance by refining a query with relevant visual words found from the geometric consistency check between the query image and highly ranked retrieved images obtained from the first round of retrieval. Since QE checks the pairwise consistency between query and highly ranked images, its performance may deteriorate when there are slight degradations in the query image. We propose Query Bootstrapping as a variant of QE to circumvent this problem by using the consistency of highly ranked images instead of pairwise consistency. In so doing, we regard frequently co-occurring visual words in highly ranked images as relevant visual words. Frequent itemset mining (FIM) is used to find such visual words efficiently. However, the FIM-based approach requires sensitive parameters to be fine-tuned, namely, support (min/max-support) and the number of top ranked images (top-k). Here, we propose an adaptive support algorithm that adaptively determines both the minimum support and maximum support by referring to the first round's retrieval list. Selecting relevant images by using a geometric consistency check further boosts retrieval performance by reducing outlier images from a mining process. An important parameter for the LO-RANSAC algorithm that is used for the geometric consistency check, namely, inlier threshold, is automatically determined by our algorithm. We further introduce tf-fi-idf on top of tf-idf in order to take into account the frequency of inliers (fi) in the retrieved images. We evaluated the performance of QB in terms of mean average precision (mAP) on three benchmark datasets and found that it gave significant performance boosts of 5.37%, 9.65%, and 8.52% over that of state-of-the-art QE on Oxford 5k, Oxford 105k, and Paris 6k, respectively.
Nan LYU Ning Mei YU He Jiu ZHANG
This letter presents a new time-digital single-slope ADC (TDSS) architecture for CMOS image sensors. In the proposed ADC, a conventional single-slope ADC is used in coarse phase and a time to digital convertor is employed in fine phase. Through second comparison of the two different slope voltages (discharge input voltage and ramp voltage), the proposed ADC achieves low bit precision compensation. Compared with multiple-ramp single-slope (MRSS) ADC, the proposed ADC not only has a simple digital judgment circuit, but also increases conversion speed without complicated structure of ramp generator. A 10-bit TDSS ADC consisting of 7-bit conventional single-slope ADC and 3-bit time to digital converter was realized in a 0.13µm CIS process. Simulations demonstrate that the conversion speed of a TDSS ADC is almost 3.5 times faster than that of a single-slope ADC.
Jin NAKAZATO Daiki OKUYAMA Yuki MORIMOTO Yoshio KARASAWA
In our previous paper, we presented a concept of “Baseband Radio” as an ideal of future wireless communication scheme. Furthermore, for enhancing the adaptability of baseband radio, the adaptive baseband radio was discussed as the ultimate communication system; it integrates the functions of cognitive radio and software-defined radio. In this paper, two transmission schemes that take advantage of adaptive baseband radio are introduced and the results of a performance evaluation are presented. The first one is a scheme based on DSFBC for realizing higher reliability; it allows the flexible use of frequency bands over a wide range of white space. The second one is a low-power-density communication scheme with spectrum-spreading by means of frequency-domain differential coding so that the secondary system does not seriously interfere with primary-user systems that have been assigned the same frequency band.
Predicting the routing paths between any given pair of Autonomous Systems (ASes) is very useful in network diagnosis, traffic engineering, and protocol analysis. Existing methods address this problem by resolving the best path with a snapshot of BGP (Border Gateway Protocol) routing tables. However, due to route deficiencies, routing policy changes, and other causes, the best path changes over time. Consequently, existing methods for path prediction fail to capture route dynamics. To predict AS-level paths in dynamic scenarios (e.g. network failures), we propose a per-neighbor path ranking model based on how long the paths have been used, and apply this routing model to extract each AS's route choice configurations for the paths observed in BGP data. With route choice configurations to multiple paths, we are able to predict the path in case of multiple network scenarios. We further build the model with strict policies to ensure our model's routing convergence; formally prove that it converges; and discuss the path prediction capturing routing dynamics by disabling links. By evaluating the consistency between our model's routing and the actually observed paths, we show that our model outperforms the state-of-the-art work [4].
A novel circularly and linearly polarized loop antenna is presented. A simple loop configuration, twisted like a cross shape, has achieved radiating wide beam circular polarization simultaneously with linear polarization in two close bands. This cross configuration brings good circular polarization to a loop antenna because it uses the transmission line mode of a folded dipole antenna. For these reasons, the antenna is named the Cross Spiral Antenna (CSA). In this paper, a basic structure and the principle of the CSA radiating circular polarization with one port feeding is explained. The prototype CSA, which is tuned to around 1.57GHz and 1.6GHz, is tested for verifying the effectiveness of the suggested antenna configuration.
Kenta UMEBAYASHI Kazuki MORIWAKI Riki MIZUCHI Hiroki IWATA Samuli TIIRO Janne J. LEHTOMÄKI Miguel LÓPEZ-BENÍTEZ Yasuo SUZUKI
This paper investigates a signal area (SA) estimation method for wideband and long time duration spectrum measurements for dynamic spectrum access. SA denotes the area (in time/frequency domain) occupied by the primary user's signal. The traditional approach, which utilizes only Fourier transform (FT) and energy detector (ED) for SA estimation, can achieve low complexity, but its estimation performance is not very high. Against this issue, we apply post-processing to improve the performance of the FT-based ED. Our proposed method, simple SA (S-SA) estimation, exploits the correlation of the spectrum states among the neighboring tiles and the fact that SA typically has a rectangular shape to estimate SA with high accuracy and relatively low complexity compared to a conventional method, contour tracing SA (CT-SA) estimation. Numerical results will show that the S-SA estimation method can achieve better detection performance. The SA estimation and processing can reduce the number of bits needed to store/transmit the observed information compared to the FT-based ED. Thus, in addition to improved detection performance it also compresses the data.
We consider a bisimilarity control problem for transition systems. For this control problem, a necessary and sufficient condition for its solvability and a method for synthesizing a state feedback controller have been presented in the literature. However, the state of the system to be controlled is not necessarily observable. In this paper, we synthesize an observer-based output feedback controller for the bisimilarity control problem under a certain condition, and show that this output feedback controller is a solution to the control problem.
Analog and digital collaborative design techniques for wireless SoCs are reviewed in this paper. In wireless SoCs, delicate analog performance such as sensitivity of the receiver is easily degraded due to interferences from digital circuit blocks. On the other hand, an analog performance such as distortion is strongly compensated by digital assist techniques with low power consumption. In this paper, a sensitivity recovery technique using the analog and digital collaborative design, and digital assist techniques to achieve low-power and high-performance analog circuits are presented. Such analog and digital collaborative design is indispensable for wireless SoCs.
Trung Anh DINH Shigeru YAMASHITA Tsung-Yi HO
Different from application-specific digital microfluidic biochips, a general-purpose design has several advantages such as dynamic reconfigurability, and fast on-line evaluation for real-time applications. To achieve such superiority, this design typically activates each electrode in the chip using an individual control pin. However, as the design complexity increases substantially, an order-of-magnitude increase in the number of control pins will significantly affect the manufacturing cost. To tackle this problem, several methods adopting a pin-sharing mechanism for general-purpose designs have been proposed. Nevertheless, these approaches sacrifice the flexibility of droplet movement, and result in an increase of bioassay completion time. In this paper, we present a novel pin-count reduction design methodology for general-purpose microfluidic biochips. Distinguished from previous approaches, the proposed methodology not only reduces the number of control pins significantly but also guarantees the full flexibility of droplet movement to ensure the minimal bioassay completion time.
Ranging is commonly used to measure the distance to a satellite, since it is one of the quickest and most effective methods of finding the position of a satellite. In general, ranging ambiguity is easily resolved using major and subsequent ambiguity-resolving tones. However, an induced unknown phase error could interfere with resolving the ranging ambiguity. This paper suggests an effective and practical method to resolve the ranging ambiguity without changing the original planned ranging tone frequencies when an unknown non-linear phase error exists. Specifically, the present study derives simple equations for finding the phase error from the physical relationship between the measured major and minor tones. Furthermore, a technique to select the optimal ambiguity integer and correct phase error is provided. A numerical analysis is performed using real measurements from a low earth orbit (LEO) satellite to show its suitability and effectiveness. It can be seen that a non-ambiguous range is acquired after compensating the unknown phase error.
Ruijin ZHU Yu-an TAN Quanxin ZHANG Fei WU Jun ZHENG Yuan XUE
Disassembly, as a principal reverse-engineering tool, is the process of recovering the equivalent assembly instructions of a program's machine code from its binary representation. However, when disassembling a firmware file, the disassembly process cannot be performed well if the image base is unknown. In this paper, we propose an innovative method to determine the image base of a firmware file with ARM/Thumb instruction set. First, based on the characteristics of the function entry table (FET) for an ARM processor, an algorithm called FIND-FET is proposed to identify the function entry tables. Second, by using the most common instructions of function prologue and FETs, the FIND-BASE algorithm is proposed to determine the candidate image base by counting the matched functions and then choose the one with maximal matched FETs as the final result. The algorithms are applied on some firmwares collected from the Internet, and results indicate that they can effectively find out the image base for the majority of example firmware files.
Takuya FUJIHASHI Shiho KODERA Shunsuke SARUWATARI Takashi WATANABE
When an access point transmits multi-view video over a wireless network with subcarriers, bit errors occur in the low quality subcarriers. The errors cause a significant degradation of video quality. The present paper proposes Significance based Multi-view Video Streaming with Subcarrier Allocation (SMVS/SA) for the maintenance of high video quality. SMVS/SA transmits a significant video frame over a high quality subcarrier to minimize the effect of the errors. SMVS/SA has two contributions. The first contribution is subcarrier-gain based multi-view rate distortion to predict each frame's significance based on the quality of subcarriers. The second contribution is heuristic algorithms to decide the sub-optimal allocation between video frames and subcarriers. The heuristic algorithms exploit the feature of multi-view video coding, which is a video frame is encoded using the previous time or camera video frame, and decides the sub-optimal allocation with low computation. To evaluate the performance of SMVS/SA in a real wireless network, we measure the quality of subcarriers using a software radio. Evaluations using MERL's benchmark test sequences and the measured subcarrier quality reveal that SMVS/SA achieves low traffic and communication delay with a slight degradation of video quality. For example, SMVS/SA improves video quality by up to 2.7 [dB] compared to the multi-view video transmission scheme without subcarrier allocation.
Kristof J. P. JACOBS Benjamin J. STEVENS Richard A. HOGG
High structural perfection, wafer uniformity, and reproducibility are key parameters for high-volume, low cost manufacture of resonant tunnelling diode (RTD) terahertz (THz) devices. Low-cost, rapid, and non-destructive techniques are required for the development of such devices. In this paper, we report photoluminescence (PL) spectroscopy as a non-destructive characterisation technique for high current densityInGaAs/AlAs/InP RTD structures grown by metal-organic vapour phase epitaxy (MOVPE) for THz applications. By using a PL line scanning technique across the edge of the sample, we identify characteristic luminescence from the quantum well (QW) and the undoped/n+ InGaAs layers. By using the Moss-Burstein effect, we are able to measure the free-electron concentration of the emitter/collector and contact layers in the RTD structure. Whilst the n+ InGaAs luminescence provides information on the doping concentration, information on the alloy composition and compositional variation is extracted from the InGaAs buffer layer. The QW luminescence provides information on the average well width and provides a monitor of the structural perfection with regard to interface and alloy disorder.
The inertia weight is the control parameter that tunes the balance between the exploration and exploitation movements in particle swarm optimization searches. Since the introduction of inertia weight, various strategies have been proposed for determining the appropriate inertia weight value. This paper presents a brief review of the various types of inertia weight strategies which are classified and discussed in four categories: static, time varying, dynamic, and adaptive. Furthermore, a novel entropy-based gain regulator (EGR) is proposed to detect the evolutionary state of particle swarm optimization in terms of the distances from particles to the current global best. And then apply proper inertia weights with respect to the corresponding distinct states. Experimental results on five widely applied benchmark functions show that the EGR produced significant improvements of particle swarm optimization.
Yang LIU Shota MORITA Masashi UNOKI
This paper proposes a method based on modulation transfer function (MTF) to restore the power envelope of noisy reverberant speech by using a Kalman filter with linear prediction (LP). Its advantage is that it can simultaneously suppress the effects of noise and reverberation by restoring the smeared MTF without measuring room impulse responses. This scheme has two processes: power envelope subtraction and power envelope inverse filtering. In the subtraction process, the statistical properties of observation noise and driving noise for power envelope are investigated for the criteria of the Kalman filter which requires noise to be white and Gaussian. Furthermore, LP coefficients drastically affect the Kalman filter performance, and a method is developed for deriving LP coefficients from noisy reverberant speech. In the dereverberation process, an inverse filtering method is applied to remove the effects of reverberation. Objective experiments were conducted under various noisy reverberant conditions to evaluate how well the proposed Kalman filtering method based on MTF improves the signal-to-error ratio (SER) and correlation between restored power envelopes compared with conventional methods. Results showed that the proposed Kalman filtering method based on MTF can improve SER and correlation more than conventional methods.
Hiroyuki KAMATA Gia Khanh TRAN Kei SAKAGUCHI Kiyomichi ARAKI
Cognitive radio (CR) is an important technology to provide high-efficiency data communication for the IoT (Internet of Things) era. Signal detection is a key technology of CR to detect communication opportunities. Energy detection (ED) is a signal detection method that does not have high computational complexity. It, however, can only estimate the presence or absence of signal(s) in the observed band. Cyclostationarity detection (CS) is an alternative signal detection method. This method detects some signal features like periodicity. It can estimate the symbol rate of a signal if present. It, however, incurs high computational complexity. In addition, it cannot estimate the symbol rate precisely in the case of single carrier signal with a low Roll-Off factor (ROF). This paper proposes a method to estimate coarsely a signal's bandwidth and carrier frequency from its power spectrum with lower computational complexity than the CS. The proposed method can estimate the bandwidth and carrier frequency of even a low ROF signal. This paper evaluates the proposed method's performance by numerical simulations. The numerical results show that in all cases the proposed coarse bandwidth and carrier frequency estimation is almost comparable to the performance of CS with lower computational complexity and even outperforms in the case of single carrier signal with a low ROF. The proposed method is generally effective for unidentified classification of the signal i.e. single carrier, OFDM etc.
Lixin WANG Yutong LU Wei ZHANG Yan LEI
One of the patterns that the design of parallel file systems has to solve stems from the difficulty of handling the metadata-intensive I/O generated by parallel applications accessing a single large directory. We demonstrate a middleware design called SFS to support existing parallel file systems for distributed and scalable directory service. SFS distributes directory entries over data servers instead of metadata servers to offer increased scalability and performance. Firstly, SFS exploits an adaptive directory partitioning based on extendible hashing to support concurrent and unsynchronized partition splitting. Secondly, SFS describes an optimization based on recursive split-ordering that emphasizes speeding up the splitting process. Thirdly, SFS applies a write-optimized index structure to convert slow, small, random metadata updates into fast, large, sequential writes. Finally, SFS gracefully tolerates stale mapping at the clients while maintaining the correctness and consistency of the system. Our performance results on a cluster of 32-servers show our implementation can deliver more than 250,000 file creations per second on average.