Kazuya TAKAHASHI Tatsuya MORI Yusuke HIROTA Hideki TODE Koso MURAKAMI
In recent years, real-time streaming has become widespread as a major service on the Internet. However, real-time streaming has a strict playback deadline. Application level multicasts using multiple distribution trees, which are known as forests, are an effective approach for reducing delay and jitter. However, the failure or departure of nodes during forest-based multicast transfer can severely affect the performance of other nodes. Thus, the multimedia data quality is degraded until the distribution trees are repaired. This means that increasing the speed of recovery from isolation is very important, especially in real-time streaming services. In this paper, we propose three methods for resolving this problem. The first method is a random-based proactive method that achieves rapid recovery from isolation and gives efficient “Randomized Forwarding” via cooperation among distribution trees. Each node forwards the data it receives to child nodes in its tree, and then, the node randomly transferring it to other trees with a predetermined probability. The second method is a reactive method, which provides a reliable isolation recovery method with low overheads. In this method, an isolated node requests “Continuous Forwarding” from other nodes if it detects a problem with a parent node. Forwarding to the nearest nodes in the IP network ensures that this method is efficient. The third method is a hybrid method that combines these two methods to achieve further performance improvements. We evaluated the performances of these proposed methods using computer simulations. The simulation results demonstrated that our proposed methods delivered isolation recovery and that the hybrid method was the most suitable for real-time streaming.
Ryo YAMAGUCHI Shouhei KIDERA Tetsuo KIRIMOTO
Ultra-wideband pulse radar is a promising technology for the imaging sensors of rescue robots operating in disaster scenarios, where optical sensors are not applicable because of thick smog or high-density gas. For the above application, while one promising ultra-wideband radar imaging algorithm for a target with arbitrary motion has already been proposed with a compact observation model, it is based on an ellipsoidal approximation of the target boundary, and is difficult to apply to complex target shapes. To tackle the above problem, this paper proposes a non-parametric and robust imaging algorithm for a target with arbitrary motion including rotation and translation being observed by multi-static radar, which is based on the matching of target boundary points obtained by the range points migration (RPM) algorithm extended to the multi-static radar model. To enhance the imaging accuracy in situations having lower signal-to-noise ratios, the proposed method also adopts an integration scheme for the obtained range points, the antenna location part of which is correctly compensated for the estimated target motion. Results from numerical simulations show that the proposed method accurately extracts the surface of a moving target, and estimates the motion of the target, without any target or motion model.
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.
Atsushi KANDA Akira OHKI Takeshi KUROSAKI Hiroaki SANJOH Kota ASAKA Ryoko YOSHIMURA Toshio ITO Makoto NAKAMURA Masafumi NOGAWA Yusuke OHTOMO Mikio YONEYAMA
The 10-gigabit Ethernet passive optical network (10G-EPON) is a promising candidate for the next generation of fiber-to-the-home access systems. In the symmetric 10G-EPON system, the gigabit Ethernet passive optical network (GE-PON) and 10G-EPON will have to co-exist on the same optical network. For this purpose, an optical triplexer (10G-transmitter, 1G-transmitter, and 10G/1G-receiver) for optical line terminal (OLT) transceivers in 10G/1G co-existing EPON systems has been developed. Reducing the size and cost of the optical triplexer has been one of the largest issues in the effort to deploy 10G-EPON systems for practical use. In this paper, we describe a novel small and low-cost dual-rate optical triplexer for use in 10G-EPON applications. By reducing the optical path length by means of a light collection system with a low-magnification long-focus coupling lens, we have successfully miniaturized the optical triplexer for use in 10G-EPON OLT 10-gigabit small form factor pluggable (XFP) transceivers and decreased the number of lenses. A low-cost design of sub-assemblies also contributes to cost reduction. The triplexer's performance complies with IEEE 802.3av specifications.
Wissarut YUTTACHAI Poompat SAENGUDOMLERT Wuttipong KUMWILAISAK
We consider the problem of detecting and localizing of link quality degradations in transparent wavelength division multiplexing (WDM) networks. In particular, we consider the degradation of the optical signal-to-noise ratio (OSNR), which is a key parameter for link quality monitoring in WDM networks. With transparency in WDM networks, transmission lightpaths can bypass electronic processing at intermediate nodes. Accordingly, links cannot always be monitored by receivers at their end nodes. This paper proposes the use of optical multicast probes to monitor OSNR degradations on optical links. The proposed monitoring scheme consists of two steps. The first step is an off-line process to set up monitoring trees using integer linear programming (ILP). The set of monitoring trees is selected to guarantee that significant OSNR degradations can be identified on any link or links in the network. The second step uses optical performance monitors that are placed at the receivers identified in the first step. The information from these monitors is collected and input to the estimation algorithm to localize the degraded links. Numerical results indicate that the proposed monitoring algorithm is able to detect link degradations that cause significant OSNR changes. In addition, we demonstrate how the information obtained from monitoring can be used to detect a significant end-to-end OSNR degradation even though there is no significant OSNR degradation on individual links.
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.
Naoya OKADA Yuichi NAKAMURA Shinji KIMURA
Nonvolatile flip-flop enables leakage power reduction in logic circuits and quick return from standby mode. However, it has limited write endurance, and its power consumption for writing is larger than that of conventional D flip-flop (DFF). For this reason, it is important to reduce the number of write operations. The write operations can be reduced by stopping the clock signal to synchronous flip-flops because write operations are executed only when the clock is applied to the flip-flops. In such clock gating, a method using Exclusive OR (XOR) of the current value and the new value as the control signal is well known. The XOR based method is effective, but there are several cases where the write operations can be reduced even if the current value and the new value are different. The paper proposes a method to detect such unnecessary write operations based on state transition analysis, and proposes a write control method to save power consumption of nonvolatile flip-flops. In the method, redundant bits are detected to reduce the number of write operations. If the next state and the outputs do not depend on some current bit, the bit is redundant and not necessary to write. The method is based on Binary Decision Diagram (BDD) calculation. We construct write control circuits to stop the clock signal by converting BDDs representing a set of states where write operations are unnecessary. Proposed method can be combined with the XOR based method and reduce the total write operations. We apply combined method to some benchmark circuits and estimate the power consumption with Synopsys NanoSim. On average, 15.0% power consumption can be reduced compared with only the XOR based method.
SangKwon MOON Jong-Woon YOO Jaesub KIM Kyu-Ho PARK
In the sensor networks for surveillance, the requirements of providing energy efficiency and service differentiation, which is to deliver high-priority packets preferentially, while maintaining high goodput, which is to deliver many packets within their deadline are increasing. However, previous works have difficulties in satisfying the requirements simultaneously. Thus, we propose GES-MAC, which satisfies the requirements simultaneously. GES-MAC reduces idle listening energy consumption by using a duty cycle, periodic listen (i.e., turn on radio module) and sleep (i.e. turn off radio module) of sensor nodes. Cluster-based multi-hop scheduling provides high goodput in a duty-cycled environment by scheduling clusters of nodes in the listen period and opportunistically forwarding data packets in the sleep period. Priority-aware schedule switching makes more high-priority packets reach the sink node by letting high-priority packets preempt the schedules of low-priority packets. In experiments with MICA2 based sensor nodes and in simulations, the energy consumption of the radio module is reduced by 70% compared to the approaches without a duty cycle, while providing 80% 100% goodput of the approaches that provide high goodput. Service differentiation is also supported with little overhead.
Shuang QIN Gang FENG Wenyi QIN Yu GE Jaya Shankar PATHMASUNTHARAM
In maritime networks, the communication links are characterized as high dynamics due to ship mobility and fluctuation of the sea surface. The performance of traditional transmission protocols is poor in maritime networks. Thus, some researchers have considered using Delay Tolerant Network (DTN) to improve the performance of data transmission in maritime environment. Most existing work on maritime DTNs uses simulation to evaluate the transmission performance in maritime DTNs. In this paper, we develop a theoretical model to analyze the performance of data transmission in maritime DTNs. We first construct a model to describe the ship encounter probability. Then, we use this model to analyze the data delivery ratio from ships in the seaway to the base station (BS) on the coast. Based on the data of tracing the ships navigating in a realistic seaway, we develop a simulator and validate the theoretical models. In addition, by comparing the performance of DTN transmission protocol and traditional end-to-end transmission protocol, we confirm that DTN protocol can effectively improve the performance of data transmission in maritime networks.
This paper presents an efficient algorithm for reporting all intersections among n given segments in the plane using work space of arbitrarily given size. More exactly, given a parameter s which is between Ω(1) and O(n) specifying the size of work space, the algorithm reports all the segment intersections in roughly O(n2/+ K) time using O(s) words of O(log n) bits, where K is the total number of intersecting pairs. The time complexity can be improved to O((n2/s) log s + K) when input segments have only some number of different slopes.
Takahiro SUZUKI Takeshi IKENAGA
Scale-Invariant Feature Transform (SIFT) has lately attracted attention in computer vision as a robust keypoint detection algorithm which is invariant for scale, rotation and illumination changes. However, its computational complexity is too high to apply in practical real-time applications. This paper proposes a low complexity keypoint extraction algorithm based on SIFT descriptor and utilization of the database, and its real-time hardware implementation for Full-HD resolution video. The proposed algorithm computes SIFT descriptor on the keypoint obtained by corner detection and selects a scale from the database. It is possible to parallelize the keypoint detection and descriptor computation modules in the hardware. These modules do not depend on each other in the proposed algorithm in contrast with SIFT that computes a scale. The processing time of descriptor computation in this hardware is independent of the number of keypoints because its descriptor generation is pipelining structure of pixel. Evaluation results show that the proposed algorithm on software is 12 times faster than SIFT. Moreover, the proposed hardware on FPGA is 427 times faster than SIFT and 61 times faster than the proposed algorithm on software. The proposed hardware performs keypoint extraction and matching at 60 fps for Full-HD video.
Masashi FUSHIKI Noriaki MIYAZAKI Xiaoqiu WANG Satoshi KONISHI
In order to support the increasing amount of mobile data traffic, Third Generation Partnership Project (3GPP) is actively discusses cell range expansion (CRE) and time domain multiplexing – inter-cell interference coordination (TDM-ICIC). They have shown to be attractive techniques for heterogeneous network (HetNet) deployment where pico base stations (BSs) overlay macro BSs. There are two control schemes of the TDM-ICIC. One, named ZP-scheme, stops radio resource assignments for data traffic in predetermined radio resources in the time domain (subframes). The other, named RP-scheme, maintains the resource assignment whereas it reduces the transmission power at macro BSs at predetermined subframes. In this paper, we clarify the effective ranges of both ZP-scheme and RP-scheme by conducting the system level simulations. Moreover, the appropriate power reduction value at predetermined subframes is also clarified from the difference in the effective range of various power reduction values. The comprehensive evaluation results show that both ZP-scheme and RP-scheme are not effective when the CRE bias value is 0 dB or less. If the CRE bias value is larger than 0 dB, they are effective when the ratio of predetermined subframes in all subframes is set to appropriate values. These values depend on the CRE bias value and power reduction in the predetermined subframes. The effective range is expanded when the power reduction in the predetermined subframes changes with the CRE bias value. Therefore, the effective range of RP-scheme is larger than that of ZP-scheme by setting an appropriate power reduction in the predetermined subframes.
Keisuke KATO Fumitaka ABE Kazuyuki WAKABAYASHI Chuan GAO Takafumi YAMADA Haruo KOBAYASHI Osamu KOBAYASHI Kiichi NIITSU
This paper describes algorithms for generating low intermodulation-distortion (IMD) two-tone sinewaves, for such as communication application ADC testing, using an arbitrary waveform generator (AWG) or a multi-bit ΣΔ DAC inside an SoC. The nonlinearity of the DAC generates distortion components, and we propose here eight methods to precompensate for the IMD using DSP algorithms and produce low-IMD two-tone signals. Theoretical analysis, simulation, and experimental results all demonstrate the effectiveness of our approach.
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).
Satoshi TAOKA Daisuke TAKAFUJI Toshimasa WATANABE
A vertex cover of a given graph G = (V,E) is a subset N of V such that N contains either u or v for any edge (u,v) of E. The minimum weight vertex cover problem (MWVC for short) is the problem of finding a vertex cover N of any given graph G = (V,E), with weight w(v) for each vertex v of V, such that the sum w(N) of w(v) over all v of N is minimum. In this paper, we consider MWVC with w(v) of any v of V being a positive integer. We propose simple procedures as postprocessing of algorithms for MWVC. Furthremore, five existing approximation algorithms with/without the proposed procedures incorporated are implemented, and they are evaluated through computing experiment.
Masao TAKAYAMA Shiro DOSHO Noriaki TAKEDA Masaya MIYAHARA Akira MATSUZAWA
In this paper, we describe a new method to deal with analog signal in time domain. The method converts voltage signal to time-interleaved phase modulation signal of clock edge. After being amplified by a new time amplifier (TA), phases of the signal are converted to digital codes by successive approximation time-to-digital converter (SA-TDC). The test chip includes 8 interleaved 4 bit SA-TDCs with short latency. The chip operates up to 4.4 GHz. The measured ENOB is 3.51 bit and FOM is 0.49 pJ/conv.
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.
Chittaphone PHONHARATH Kenji HASHIMOTO Hiroyuki SEKI
We study a static analysis problem on k-secrecy, which is a metric for the security against inference attacks on XML databases. Intuitively, k-secrecy means that the number of candidates of sensitive data of a given database instance or the result of unauthorized query cannot be narrowed down to k-1 by using available information such as authorized queries and their results. In this paper, we investigate the decidability of the schema k-secrecy problem defined as follows: for a given XML database schema, an authorized query and an unauthorized query, decide whether every database instance conforming to the given schema is k-secret. We first show that the schema k-secrecy problem is undecidable for any finite k>1 even when queries are represented by a simple subclass of linear deterministic top-down tree transducers (LDTT). We next show that the schema ∞-secrecy problem is decidable for queries represented by LDTT. We give an algorithm for deciding the schema ∞-secrecy problem and analyze its time complexity. We show the schema ∞-secrecy problem is EXPTIME-complete for LDTT. Moreover, we show similar results LDTT with regular look-ahead.
Hyunduk KIM Sang-Heon LEE Myoung-Kyu SOHN Dong-Ju KIM Byungmin KIM
Super resolution (SR) reconstruction is the process of fusing a sequence of low-resolution images into one high-resolution image. Many researchers have introduced various SR reconstruction methods. However, these traditional methods are limited in the extent to which they allow recovery of high-frequency information. Moreover, due to the self-similarity of face images, most of the facial SR algorithms are machine learning based. In this paper, we introduce a facial SR algorithm that combines learning-based and regularized SR image reconstruction algorithms. Our conception involves two main ideas. First, we employ separated frequency components to reconstruct high-resolution images. In addition, we separate the region of the training face image. These approaches can help to recover high-frequency information. In our experiments, we demonstrate the effectiveness of these ideas.
Hyunui LEE Masaya MIYAHARA Akira MATSUZAWA
This paper describes the design of an interpolated pipeline analog-to-digital converter (ADC). By introducing the interpolation technique into the conventional pipeline topology, it becomes possible to realize a more than 10-bits resolution and several hundred MS/s ADC using low-gain open-loop amplifiers without any multiplying digital-to-analog converter (MDAC) calibration. In this paper, linearity requirement of the amplifier is analyzed with the relation of reference range and stage resolution first. Noise characteristic is also discussed with amplifier's noise bandwidth and load capacitance. After that, sampling speed and SNR characteristic are examined with various amplifier currents. Next, the resolution optimization of the pipeline stage is discussed based on the power consumption. Through the analysis, reasonable parameters for the amplifier can be defined, such as transconductance, source degeneration resistance and load capacitance. Also, optimized operating speed and stage resolution for interpolated pipelined ADC is shown. The analysis in this paper is valuable to both the design of interpolated pipeline ADCs and other circuits which incorporate interpolation and amplifiers.