Katsuya NAKAHIRA Takatoshi SUGIYAMA Hiroki NISHIYAMA Nei KATO
This paper proposes a novel satellite channel allocation algorithm for a demand assigned multiple access (DAMA) controller. In satellite communication systems, the channels' total bandwidth and total power are limited by the satellite's transponder bandwidth and transmission power (satellite resources). Our algorithm is based on multi-carrier transmission and adaptive modulation methods. It optimizes channel elements such as the number of sub-carriers, modulation level, and forward error correction (FEC) coding rate. As a result, the satellite's transponder bandwidth and transmission power can be simultaneously used to the maximum and the overall system capacity, i.e., total transmission bit rate, will increase. Simulation results show that our algorithm increases the overall system capacity by 1.3 times compared with the conventional fixed modulation algorithm.
Xuesong MAO Daisuke INOUE Hiroyuki MATSUBARA Manabu KAGAMI
The power of laser radar received echoes varies over a large range due to many factors such as target distance, size, reflection ratio, etc, which leads to the difficulty of decoding codes from the received noise buried signals for spectrum code modulated laser radar. Firstly, a pseudo-random noise (PN) code modulated laser radar model is given, and the problem to be addressed is discussed. Then, a novel method based on Inter Symbol Interference (ISI) is proposed for resolving the problem, providing that only Additive White Gaussian Noise (AWGN) exists. The ISI effect is introduced by using a high pass filter (HPF). The results show that ISI improves laser radar receiver decoding ratio, thus the peak of the correlation function of decoded codes and modulation codes. Finally, the effect of proposed method is verified by a simple experiment.
Akihito MATSUO Hiroyuki ASAHARA Takuji KOUSAKA
This paper clarifies the bifurcation structure of the chaotic attractor in an interrupted circuit with switching delay from theoretical and experimental view points. First, we introduce the circuit model and its dynamics. Next, we define the return map in order to investigate the bifurcation structure of the chaotic attractor. Finally, we discuss the dynamical effect of switching delay in the existence region of the chaotic attractor compared with that of a circuit with ideal switching.
Jung Hee CHEON Stanislaw JARECKI Jae Hong SEO
Secure computation of the set intersection functionality allows n parties to find the intersection between their datasets without revealing anything else about them. An efficient protocol for such a task could have multiple potential applications in commerce, health care, and security. However, all currently known secure set intersection protocols for n > 2 parties have computational costs that are quadratic in the (maximum) number of entries in the dataset contributed by each party, making secure computation of the set intersection only practical for small datasets. In this paper, we describe the first multi-party protocol for securely computing the set intersection functionality with both the communication and the computation costs that are quasi-linear in the size of the datasets. For a fixed security parameter, our protocols require O(n2k) bits of communication and Õ(n2k) group multiplications per player in the malicious adversary setting, where k is the size of each dataset. Our protocol follows the basic idea of the protocol proposed by Kissner and Song, but we gain efficiency by using different representations of the polynomials associated with users' datasets and careful employment of algorithms that interpolate or evaluate polynomials on multiple points more efficiently. Moreover, the proposed protocol is robust. This means that the protocol outputs the desired result even if some corrupted players leave during the execution of the protocol.
Yosuke SUGIURA Arata KAWAMURA Youji IIGUNI
This paper proposes a comb filter design method which utilizes two linear phase FIR filters for flexibly adjusting the comb filter's frequency response. The first FIR filter is used to individually adjust the notch gains, which denote the local minimum gains of the comb filter's frequency response. The second FIR filter is used to design the elimination bandwidths for individual notch gains. We also derive an efficient comb filter by incorporating these two FIR filters with an all-pass filter which is used in a conventional comb filter to accurately align the nulls with the undesired harmonic frequencies. Several design examples of the derived comb filter show the effectiveness of the proposed comb filter design method.
Tadayoshi DEGUCHI Hideshi TOMITA Atsushi KAMADA Manabu ARAI Kimiyoshi YAMASAKI Takashi EGAWA
Current collapse of AlGaN/GaN heterostructure field-effect transistors (HFETs) formed on qualified epitaxial layers on Si substrates was successfully suppressed using graded field-plate (FP) structures. To improve the reproducibility of the FP structure manufacturing process, a simple process for linearly graded SiO2 profile formation was developed. An HFET with a graded FP structure exhibited a significant decrease in an on-resistance increase ratio of 1.16 even after application of a drain bias of 600 V.
Hao XIAO Tsuyoshi ISSHIKI Arif Ullah KHAN Dongju LI Hiroaki KUNIEDA Yuko NAKASE Sadahiro KIMURA
Ultra-wideband (UWB) technology has attracted much attention recently due to its high data rate and low emission power. Its media access control (MAC) protocol, WiMedia MAC, promises a lot of facilities for high-speed and high-quality wireless communication. However, these benefits in turn involve a large amount of computational load, which challenges the traditional uniprocessor architecture based implementation method to provide the required performance. However, the constrained cost and power budget, on the other hand, makes using commercial multiprocessor solutions unrealistic. In this paper, a low-cost and energy-efficient multiprocessor system-on-chip (MPSoC), which tackles at once the aspects of system design, software migration and hardware architecture, is presented for the implementation of UWB MAC layer. Experimental results show that the proposed MPSoC, based on four simple RISC processors and shared-memory infrastructure, achieves up to 45% performance improvement and 65% power saving, but takes 15% less area than the uniprocessor implementation.
Eiji MIYAZAKI Shigeru KISHIMOTO Takashi MIZUTANI
We performed the (NH4)2S surface treatments before Al2O3 deposition to improve the Al2O3/III-Nitride interface quality in Al2O3/AlGaN/GaN metal-oxide-semiconductor heterostructure field-effect transistors (MOSHFETs). Interface state density at the Al2O3/GaN interface was decreased by the (NH4)2S treatment. The hysteresis width in ID-VGS and gm-VGS characteristics of the Al2O3/AlGaN MOSHFETs with the (NH4)2S treatment was smaller than that without the (NH4)2S treatment. In addition, transconductance (gm) decrease at a large gate voltage was relaxed by the (NH4)2S treatment. We also performed ultraviolet (UV) illumination during the (NH4)2S treatment for further improvement of the Al2O3/III-Nitride interface quality. Interface state density of the Al2O3/GaN MOS diodes with the UV illumination was smaller than that without the UV illumination.
Jianping WU Ming LING Yang ZHANG Chen MEI Huan WANG
This paper proposes a novel dynamic Scratch-pad Memory allocation strategy to optimize the energy consumption of the memory sub-system. Firstly, the whole program execution process is sliced into several time slots according to the temporal dimension; thereafter, a Time-Slotted Cache Conflict Graph (TSCCG) is introduced to model the behavior of Data Cache (D-Cache) conflicts within each time slot. Then, Integer Nonlinear Programming (INP) is implemented, which can avoid time-consuming linearization process, to select the most profitable data pages. Virtual Memory System (VMS) is adopted to remap those data pages, which will cause severe Cache conflicts within a time slot, to SPM. In order to minimize the swapping overhead of dynamic SPM allocation, a novel SPM controller with a tightly coupled DMA is introduced to issue the swapping operations without CPU's intervention. Last but not the least, this paper discusses the fluctuation of system energy profit based on different MMU page size as well as the Time Slot duration quantitatively. According to our design space exploration, the proposed method can optimize all of the data segments, including global data, heap and stack data in general, and reduce the total energy consumption by 27.28% on average, up to 55.22% with a marginal performance promotion. And comparing to the conventional static CCG (Cache Conflicts Graph), our approach can obtain 24.7% energy profit on average, up to 30.5% with a sight boost in performance.
Daisuke KANEMOTO Toru IDO Kenji TANIGUCHI
A low power and high performance with third order delta-sigma modulator for audio applications, fabricated in a 0.18 µm CMOS process, is presented. The modulator utilizes a third order noise shaping with only one opamp by using an opamp sharing technique. The opamp sharing among three integrator stages is achieved through the optimal operation timing, which makes use of the load capacitance differences between the three integrator stages. The designed modulator achieves 101.1 dB signal-to-noise ratio (A-weighted) and 101.5 dB dynamic range (A-weighted) with 7.5 mW power consumption from a 3.3 V supply. The die area is 1.27 mm2. The fabricated delta-sigma modulator achieves the highest figure-of-merit among published high performance low power audio delta-sigma modulators.
Sho TSUGAWA Hiroyuki OHSAKI Makoto IMASE
In the literature, two connectivity-based distributed clustering schemes exist: CDC (Connectivity-based Distributed node Clustering scheme) and SDC (SCM-based Distributed Clustering). While CDC and SDC have mechanisms for maintaining clusters against nodes joining and leaving, neither method assumes that frequent changes occur in the network topology. In this paper, we propose a lightweight distributed clustering method that we term SBDC (Schelling-Based Distributed Clustering) since this scheme is derived from Schelling's model – a popular segregation model in sociology. We evaluate the effectiveness of the proposed SBDC in an environment where frequent changes arise in the network topology. Our simulation results show that SBDC outperforms CDC and SDC under frequent changes in network topology caused by high node mobility.
Makoto YAMADA Akisumi TOMOE Takahiro KINOSHITA Osanori KOYAMA Yutaka KATUYAMA Takashi SHIBUYA
We investigate in detail the scattering properties and heating characteristics in various commercially available optical fibers and fiber cables when a bubble train forms in the middle of the fiber as a result of the fiber fuse phenomenon that occurs when a high power signal is launched into the fiber. We found theoretically and experimentally that almost all the optical light is scattered at the top of the bubble train. The scattered light heats UV coated fiber, nylon jacketed silica fiber, fire-retardant jacketed fiber (PVC or FRPE jacketed fiber) and fire-retardant fiber cable (PVC or FRPE fiber cable), to around 100, over 200 and over 600, respectively, and finally the fiber burns and is destroyed at a launched optical power of 3 W. Furthermore, it is confirmed that the combustion does not spread when we use fire retardant jacketed fibers.
Cloud data center services, such as video on demand (VoD) and sensor data monitoring, have become popular. The quality of service (QoS) between a client and a cloud data center should be assured by satisfying each service's required bandwidth and delay. Multipath traffic engineering is effective for dispersing traffic flows on a network; therefore, an improved k-shortest paths first (k-SPF) algorithm is applied to these cloud data center services to satisfy their required QoS. k-SPF can create a set of multipaths between a cloud data center and all edge routers, to which client nodes are connected, within one algorithm process. Thus, k-SPF can produce k shortest simple paths between a cloud data center and every access router faster than with conventional Yen's algorithm. By using a parameter in the algorithm, k-SPF can also impartially use links on a network and shorten the average hop-count and number of necessary MPLS labels for multiple paths that comprise a multipath.
Yukio OGAWA Go HASEGAWA Masayuki MURATA
When computing resources are consolidated in a few huge data centers, a massive amount of data is transferred to each data center over a wide area network (WAN). This results in increased power consumption in the WAN. A distributed computing network (DCN), such as a content delivery network, can reduce the traffic from/to the data center, thereby decreasing the power consumed in the WAN. In this paper, we focus on the energy-saving aspect of the DCN and evaluate its effectiveness, especially considering traffic locality, i.e., the amount of traffic related to the geographical vicinity. We first formulate the problem of optimizing the DCN power consumption and describe the DCN in detail. Then, numerical evaluations show that, when there is strong traffic locality and the router has ideal energy proportionality, the system's power consumption is reduced to about 50% of the power consumed in the case where a DCN is not used; moreover, this advantage becomes even larger (up to about 30%) when the data center is located farthest from the center of the network topology.
In this letter, a post-detection signal to noise ratio (SNR) is considered for transmit antenna selection, when a sorted QR decomposition (SQRD) algorithm is used for signal detection in spatial multiplexing (SM) ultra-wideband (UWB) multiple input multiple output systems. The post-detection SNR expression is obtained using a QR factorization algorithm based on a sorted Gram-Schmidt process. The employed antenna selection criterion is to utilize the largest minimum post-detection SNR value. It is shown via simulations that the antenna selection significantly enhances the BER performance of the SQRD-based SM UWB systems on a log-normal multipath fading channel.
This paper presents the basic characteristics of a beam tilting slot antenna element whose forced resonance is realized by reactance loading; its structure complements that of a dipole antenna element. The radiation pattern is tilted using a properly determined driving point position; a single loading reactance is used to obtain the forced resonance without great changes in the tilt angle. Numerical results show that the reactance element needs to be loaded near the driving point in order to obtain the forced resonance of the antenna and the minimum changes in the beam tilt angle at the same time. When the proposed forced resonant beam tilting slot antenna with a 0.8 λ length is driven at -0.2 λ from the center, the main beam tilt angle of 57.7 degrees and the highest power gain of 3.8 dB are obtained. This slot element has a broad bandwidth, unlike the complementary dipole element.
Maiko HATANO Norimasa YAFUNE Hirokuni TOKUDA Yoshiyuki YAMAMOTO Shin HASHIMOTO Katsushi AKITA Masaaki KUZUHARA
This paper describes high-temperature electron transport properties of AlGaN-channel HEMT fabricated on a free-standing AlN substrate, estimated at temperatures between 25 and 300. The AlGaN-channel HEMT exhibited significantly reduced temperature dependence in DC and RF device characteristics, as compared to those for the conventional AlGaN/GaN HEMT, resulting in larger values in both saturated drain current and current gain cutoff frequency at 300. Delay time analyses suggested that the temperature dependence of the AlGaN-channel HEMT was primarily dominated by the effective electron velocity in the AlGaN channel. These results indicate that an AlGaN-channel HEMT fabricated on an AlN substrate is promising for high-performance device applications at high temperatures.
Guangchun LUO Jinsheng REN Ke QIN
A new training algorithm for the chaotic Adachi Neural Network (AdNN) is investigated. The classical training algorithm for the AdNN and it's variants is usually a “one-shot” learning, for example, the Outer Product Rule (OPR) is the most used. Although the OPR is effective for conventional neural networks, its effectiveness and adequateness for Chaotic Neural Networks (CNNs) have not been discussed formally. As a complementary and tentative work in this field, we modified the AdNN's weights by enforcing an unsupervised Hebbian rule. Experimental analysis shows that the new weighted AdNN yields even stronger dynamical associative memory and pattern recognition phenomena for different settings than the primitive AdNN.
Zhu LI Kojiro TOMOTSUNE Yoichi TOMIOKA Hitoshi KITAZAWA
Template matching for image sequences captured with a moving camera is very important for several applications such as Robot Vision, SLAM, ITS, and video surveillance systems. However, it is difficult to realize accurate template matching using only visual feature information such as HSV histograms, edge histograms, HOG histograms, and SIFT features, because it is affected by several phenomena such as illumination change, viewpoint change, size change, and noise. In order to realize robust tracking, structure information such as the relative position of each part of the object should be considered. In this paper, we propose a method that considers both visual feature information and structure information. Experiments show that the proposed method realizes robust tracking and determine the relationships between object parts in the scenes and those in the template.
Jang Woon BAEK Young Jin NAM Dae-Wha SEO
This paper proposes a novel routing algorithm that constructs position-based k-disjoint paths to realize greater resiliency to patterned failure. The proposed algorithm constructs k-disjoint paths that are spatially distributed by using the hop-count based positioning system. Simulation results reveal that the proposed algorithm is more resilient to patterned failure than other routing algorithms, while it has low power consumption and small delay.