Takashi NOGUCHI Toyoaki SUZUKI Tomonori TAMURA
We have developed a process for the fabrication of high-quality Nb/AlOx/Nb tunnel junctions with small area and high current densities for the heterodyne mixers at millimeter and submillimeter wavelengths. Their dc I-V curves are numerically studied, including the broadening of quasiparticle density of states resulting from the existence of an imaginary part of the gap energy of Nb. We have found both experimentally and numerically that the subgap current is strongly dependent on bias voltage at temperatures below 4.2 K unlike the prediction of the BCS tunneling theory. It is shown that calculated dc I-V curves taking into account the complex number of the gap energy agree well with those of Nb/AlOx/Nb junctions measured at temperatures from 0.4 to 4.2 K. We have successfully built receivers at millimeter and submillimeter wavelengths with the noise temperature as low as 4 times the quantum photon noise, employing those high-quality Nb/AlOx/Nb junctions. Those low-noise receivers are to be installed in the ALMA (Atacama Large Millimeter/Submillimeter Array) telescope and they are going into series production now.
Hirotake YAMAMORI Takahiro YAMADA Hitoshi SASAKI Satoshi KOHJIRO
524,288 NbN-based Josephson junctions were integrated to produce a programmable Josephson voltage standard (PJVS) on a die of 15 mm 15 mm, and the PJVS circuit was cooled to 10 K using a cryocooler and operated with a current margin of about 1.0 mA. Although an output voltage of 10 V was required for a voltage standard, the circuit was designed to generate the maximum output voltage of 17 V because it was difficult to avoid a reduction of the output voltage due to defects. Although a perfect chip without any defect was rarely fabricated, the high voltage chip that generated at least 10 V was fabricated with the fabrication yield of larger than 30%. The fabrication yield was also improved by optimizing the film growth conditions to reduce the film stress and the number of particles. Applications for a secondary voltage standard and an ac Josephson voltage standard are also described.
Kensuke SASAKI Yukihisa SUZUKI
A Mur type analytical absorbing boundary condition (A-ABC), which is based on the one-dimensional one-way wave equation, is proposed for multidimensional wave analysis by introducing the directional splitting technique. This new absorbing boundary condition is expansion of the first-order Mur. The absorbing ability, required memory, and calculation speed of the Mur type A-ABC are evaluated by comparison with those of conventional ABCs. The result indicated that absorbing ability of the proposed ABC is higher than the first-order Mur and lower than the second-order Mur at large incident angle. While, our proposed ABC has advantage in both required memory and calculation speed by comparison with the second-order Mur. Thus, effectivity of the proposed Mur type A-ABC is shown.
Masatoshi NAKAMURA Masato INAGI Kazuya TANIGAWA Tetsuo HIRONAKA Masayuki SATO Takashi ISHIGURO
In this paper, we propose a placement and routing method for a new memory-based programmable logic device (MPLD) and confirm its capability by placing and routing benchmark circuits. An MPLD consists of multiple-output look-up tables (MLUTs) that can be used as logic and/or routing elements, whereas field programmable gate arrays (FPGAs) consist of LUTs (logic elements) and switch blocks (routing elements). MPLDs contain logic circuits more efficiently than FPGAs because of their flexibility and area efficiency. However, directly applying the existing placement and routing algorithms of FPGAs to MPLDs overcrowds the placed logic cells and causes a shortage of routing domains between logic cells. Our simulated annealing-based method considers the detailed wire congestion and nearness between logic cells based on the cost function and reserves the area for routing. In the experiments, our method reduced wire congestion and successfully placed and routed 27 out of 31 circuits, 13 of which could not be placed or routed using the versatile place and route tool (VPR), a well-known method for FPGAs.
Antoine TROUVE Kazuaki MURAKAMI
This article introduces some improvements to the already proposed custom instruction candidates selection for the automatic ISA customisation problem targeting reconfigurable processors. It introduces new opportunities to prune the search space, and a technique based on dynamic programming to check the independence between groups. The proposed new algorithm yields one order less measured number of convexity checks than the related work for the same inputs and outputs.
Kyoung-Young SONG Jaehong KIM Jong-Seon NO Habong CHUNG
In this paper, we analyze the best relay selection scheme for the soft-decision-and-forward (SDF) cooperative networks with multiple relays. The term `best relay selection' implies that the relay having the largest end-to-end signal-to-noise ratio is selected to transmit in the second phase transmission. The approximate performances in terms of pairwise error probability (PEP) and bit error rate (BER) are analyzed and compared with the conventional multiple-relay transmission scheme where all the relays participate in the second phase transmission. Using the asymptotics of the Fox's H-function, the diversity orders of the best relay selection and conventional relay scheme for the SDF cooperative networks are derived. It is shown that both have the same full diversity order. The numerical results show that the best relay selection scheme outperforms the conventional one in terms of bit error rate.
Ning WANG Julian CHENG Chintha TELLAMBURA
To assess the performance of maximum-likelihood (ML) based Nakagami m parameter estimators, current methods rely on Monte Carlo simulation. In order to enable the analytical performance evaluation of ML-based m parameter estimators, we study the statistical properties of a parameter Δ, which is defined as the log-ratio of the arithmetic mean to the geometric mean for Nakagami-m fading power. Closed-form expressions are derived for the probability density function (PDF) of Δ. It is found that for large sample size, the PDF of Δ can be well approximated by a two-parameter Gamma PDF.
Jun-ichi ABE Fumihiro YAMASHITA Katsuya NAKAHIRA Kiyoshi KOBAYASHI
This paper proposes Direct Spectrum Division Transmission with spectrum editing technique. The transmitter divides the single carrier modulated signal into multiple “sub-spectra” in the frequency domain and arranges each sub-spectrum so as to more fully utilize the unused frequency resources. In the receiver, the divided sub-spectra are combined in the frequency domain and demodulated. By editing the divided spectrum in the frequency domain, the total bandwidth occupied by the multiple “sub-spectra” is less than that of the modulated signal. The proposed technique allows the unused frequency resources scattered across the bands to be better utilized. Simulations show that the proposed technique makes the bit error rate negligible.
Chenbo SHI Guijin WANG Xiaokang PEI Bei HE Xinggang LIN
This paper addresses stereo matching under scenarios of smooth region and obviously slant plane. We explore the flexible handling of color disparity, spatial relation and the reliability of matching pixels in support windows. Building upon these key ingredients, a robust stereo matching algorithm using local plane fitting by Confidence-based Support Window (CSW) is presented. For each CSW, only these pixels with high confidence are employed to estimate optimal disparity plane. Considering that RANSAC has shown to be robust in suppressing the disturbance resulting from outliers, we employ it to solve local plane fitting problem. Compared with the state of the art local methods in the computer vision community, our approach achieves the better performance and time efficiency on the Middlebury benchmark.
Yusuke HIROTA Hiroaki HONDA Hideki TODE Koso MURAKAMI
In next-generation networks, ultra-high speed transfer capability will become necessary to support a variety of advanced multimedia services. The Optical Wavelength Division Multiplexing (WDM) network is seen as one of promising networks. To deal with various multimedia services, the network should support not only unicast transmission but also multicast transmission. However, IP multicast has several problems, for example, all routers must have multicast functions. IP multicast needs routers with high overheads and excessive energy consumption. Hence, optical multicasting in optical WDM networks is a promising solution for future internet services. A tree-shared multicasting concept has been proposed to support multicast transmissions in optical WDM networks. This method assembles multiple multicast traffic streams into one burst and the burst is delivered using a shared-tree. However, this method can not be applied to dynamic multicasting. This paper proposes a novel WDM multicast design method for dynamic traffic demand using multiple shared-trees, which includes shared-tree generation/selection and wavelength assignment, for the purpose of simplifying the routing process and receiving multicast traffic efficiently. We evaluate its performance from the viewpoints of the burst loss probability and the number of redundant and useless transfers whose data is discarded at the egress edge nodes.
Yong-Pyo KIM Keisuke NAKANO Kazuyuki MIYAKITA Masakazu SENGOKU Yong-Jin PARK
Delay Tolerant Network (DTN) has been emerged to support the network connectivity of the disruptive networks. A variety of routing methods have been proposed to reduce the latency for message delivery. PROPHET was proposed as a probabilistic routing that utilizes history of encounters and transitivity of nodes, which is computed as contact probability. While PROPHET improves the performance of DTN due to contact probability, contact probability is just one parameter reflecting the mobility pattern of nodes, and further study on utilizing contacting information of mobility pattern is still an important problem. Hence, in this paper, we try to improve routing for DTN by using a novel metric other than contact probability as mobility information. We propose the routing protocol to use mean residual contact time that describes the contact period for a given pair of nodes. The simulation results show that using the mean residual contact time can improve the performance of routing protocols for DTN. In addition, we also show in what situations the proposed method provides more efficient data delivery service. We characterize these situations using a parameter called Variation Metric.
Koji OBATA Kazuo MATSUKAWA Yosuke MITANI Masao TAKAYAMA Yusuke TOKUNAGA Shiro SAKIYAMA Shiro DOSHO
This paper presents a low distortion 3rd-order continuous-time delta-sigma modulator for a worldwide digital TV-receiver whose peak SNDR is 69.8 dB and SNR is 70.2 dB under 1 V power supply. To enhance SNDR performance, the mechanisms to occur harmonic distortions at feedback current-steering DAC and flash ADC have been analyzed. A low power tuning system using RC-relaxation oscillator has been developed in order to achieve high yield against PVT variations. A 3rd-order modulator with modified single opamp resonator contributes to cost reduction by realizing a very compact circuit. Reduction schemes of the distortions enabled the modulator to achieve FOM of 0.18 pJ/conv-step.
Shouyi YIN Chongyong YIN Leibo LIU Min ZHU Shaojun WEI
Coarse-grained reconfigurable architecture (CGRA) combines the performance of application-specific integrated circuits (ASICs) and the flexibility of general-purpose processors (GPPs), which is a promising solution for embedded systems. With the increasing complexity of reconfigurable resources (processing elements, routing cells, I/O blocks, etc.), the reconfiguration cost is becoming the performance bottleneck. The major reconfiguration cost comes from the frequent memory-read/write operations for transferring the configuration context from main memory to context buffer. To improve the overall performance, it is critical to reduce the amount of configuration context. In this paper, we propose a configuration context reduction method for CGRA. The proposed method exploits the structure correlation of computation tasks that are mapped onto CGRA and reduce the redundancies in configuration context. Experimental results show that the proposed method can averagely reduce the configuration context size up to 71% and speed up the execution up to 68%. The proposed method does not depend on any architectural feature and can be applied to CGRA with an arbitrary architecture.
Tatsuya KAI Kensuke BITO Takeshi SHINTANI
In this paper, we consider a stabilization problem for the cart-pendulum system based on discrete mechanics, which is known as a good discretizing method for mechanical systems and has not been really applied to control theory. First, the continuous and discrete cart-pendulum systems are explained. We next propose a transformation method that converts a discrete-time input derived from the discrete-time optimal regulator theory into a continuous-time zero-order hold input, and carry out some simulations on stabilization of the cart-pendulum system by the transformation method. Then, we apply not only our proposed method but also existing methods to an experimental laboratory of the cart-pendulum system and perform some experiments in order to verify the availability of the proposed method.
We address a problem of sampling and reconstructing periodic piecewise polynomials based on the theory for signals with a finite rate of innovation (FRI signals) from samples acquired by a sinc kernel. This problem was discussed in a previous paper. There was, however, an error in a condition about the sinc kernel. Further, even though the signal is represented by parameters, these explicit values are not obtained. Hence, in this paper, we provide a correct condition for the sinc kernel and show the procedure. The point is that, though a periodic piecewise polynomial of degree R is defined as a signal mapped to a periodic stream of differentiated Diracs by R + 1 time differentiation, the mapping is not one-to-one. Therefore, to recover the stream is not sufficient to reconstruct the original signal. To solve this problem, we use the average of the target signal, which is available because of the sinc sampling. Simulation results show the correctness of our reconstruction procedure. We also show a sampling theorem for FRI signals with derivatives of a generic known function.
Ikki FUJIWARA Kento AIDA Isao ONO
This paper proposes a combinatorial auction-based marketplace mechanism for cloud computing services, which allows users to reserve arbitrary combination of services at requested timeslots, prices and quality of service. The proposed mechanism helps enterprise users build workflow applications in a cloud computing environment, specifically on the platform-as-a-service, where the users need to compose multiple types of services at different timeslots. The proposed marketplace mechanism consists of a forward market for an advance reservation and a spot market for immediate allocation of services. Each market employs mixed integer programming to enforce a Pareto optimum allocation with maximized social economic welfare, as well as double-sided auction design to encourage both users and providers to compete for buying and selling the services. The evaluation results show that (1) the proposed forward/combinatorial mechanism outperforms other non-combinatorial and/or non-reservation (spot) mechanisms in both user-centric rationality and global efficiency, and (2) running both a forward market and a spot market improves utilization without disturbing advance reservations depending on the provider's policy.
Ann-Chen CHANG Jhih-Chung CHANG Yu-Chen HUANG
This letter realizes direction of arrival (DOA) estimation by exploiting the noise subspace based estimator. Since single subspace feature extraction fails to achieve satisfactory results under unknown noise fields, we propose a two-step subspace feature extraction technique that is effective even in these fields. When a new noise subspace is attained, the proposed estimator without prewhitening can form the maximizing orthogonality especially for unknown noise fields. Simulation results confirm the effectiveness of the proposed technique.
Lu ZHAO Qiao-yan WEN Jie ZHANG Zheng-ping JIN
The 2-adic complexity of binary periodic sequences plays an important role in cryptology. In this paper, by means of the usual Fourier transform, we give a simpler form of the upper bound for 2-adic complexity than related result before. For pn-periodic sequences, we discuss the relation between sequences and their Fourier coefficients. Furthermore, based on the relation, we get the lower bound for the number of pn-periodic sequences with given 2-adic complexity.
Marc DOMINGO-PRIETO Joan ARNEDO-MORENO
With the evolution of the P2P research field, new problems, such as those related with information security, have arisen. It is important to provide security mechanisms to P2P systems, since it has already become one of the key issues when evaluating them. However, even though many P2P systems have been adapted to provide a security baseline to their underlying applications, more advanced capabilities are becoming necessary. Specifically, privacy preservation and anonymity are deemed essential to make the information society sustainable. Unfortunately, sometimes, it may be difficult to attain anonymity unless it is included into the system's initial design. The JXTA open protocols specification is a good example of this kind of scenario. This work studies how to provide anonymity to JXTA's architecture in a feasible manner and proposes an extension which allows deployed services to process two-way messaging without disclosing the endpoints' identities to third parties.
Jae-Joon LEE Jihye LEE Jaesung LIM
When a jamming attack occurs, existing ad hoc routing protocols can experience significant throughput degradation and unnecessary control overhead due to the inclusion of unreliable links into routing paths. In this work, we identify which factors hinder establishment of reliable routing paths by the existing routing protocols in the face of jamming attacks. Our solution is Jamming-Aware Routing (JAR) based on OLSR protocol, which provides explicit route recovery procedures to counteract jamming attack. By establishing a reliable routing path, the proposed scheme achieves significant throughput gains as well as control overhead reduction.