Hiroshi HASEGAWA Yojiro MORI Ken-ichi SATO
A novel resilient coarse granularity optical routing network architecture that adopts finely granular protection and finely granular add/drop is presented. The routing scheme defines optical pipes such that multiple optical paths can be carried by each pipe and can be dropped or added at any node on the route of a pipe. The routing scheme also makes it possible to enhance frequency utilization within pipes, by denser path packing in the frequency domain, as we recently verified. We develop a static network design algorithm that simultaneously realizes the independence of working and backup paths and pipe location optimization to efficiently carry these paths. The design algorithm first sequentially accommodates optical paths into the network, then tries to eliminate sparsely utilized fibers and iteratively optimizes frequency slot/wavelength assignment in each coarse granular pipe so as to limit the impairment caused by dropping the optical paths adjacent in the frequency domain. Numerical experiments elucidate that the number of fibers in a network can be reduced by up to 20% for 400Gbps channels without any modification in hardware.
Ing-Chao LIN Yen-Han LEE Sheng-Wei WANG
Ternary content addressable memory (TCAM), which can store 0, 1, or X in its cells, is widely used to store routing tables in network routers. Negative bias temperature instability (NBTI) and positive bias temperature instability (PBTI), which increase Vth and degrade transistor switching speed, have become major reliability challenges. This study analyzes the signal probability of routing tables. The results show that many cells retain static stress and suffer significant degradation caused by NBTI and PBTI effects. The bit flipping technique is improved and proactive power gating recovery is proposed to mitigate NBTI and PBTI effects. In order to maintain the functionality of TCAM after bit flipping, a novel TCAM cell design is proposed. Simulation results show that compared to the original architecture, the bit flipping technique improves read static noise margin (SNM) for data and mask cells by 16.84% and 29.94%, respectively, and reduces search time degradation by 12.95%. The power gating technique improves read SNM for data and mask cells by 12.31% and 20.92%, respectively, and reduces search time degradation by 17.57%. When both techniques are used, read SNM for data and mask cells is improved by 17.74% and 30.53%, respectively, and search time degradation is reduced by 21.01%.
Lian ZENG Tieyuan PAN Xin JIANG Takahiro WATANABE
As the semiconductor technology continues to develop, hundreds of cores will be deployed on a single die in the future Chip-Multiprocessors (CMPs) design. Three-Dimensional Network-on-Chips (3D NoCs) has become an attractive solution which can provide impressive high performance. An efficient and deadlock-free routing algorithm is a critical to achieve the high performance of network-on-chip. Traditional methods based on deterministic and turn model are deadlock-free, but they are unable to distribute the traffic loads over the network. In this paper, we propose an efficient, adaptive and deadlock-free algorithm (EAR) based on a novel routing selection strategy in 3D NoC, which can distribute the traffic loads not only in intra-layers but also in inter-layers according to congestion information and path diversity. Simulation results show that the proposed method achieves the significant performance improvement compared with others.
Yan CHEN Yu ZHANG Guanghui ZHANG Xunwang ZHAO ShaoHua WU Qing ZHANG XiaoPeng YANG
In this paper, a Many Integrated Core Architecture (MIC) accelerated parallel method of moment (MoM) algorithm is proposed to solve electromagnetic problems in practical applications, where MIC means a kind of coprocessor or accelerator in computer systems which is used to accelerate the computation performed by Central Processing Unit (CPU). Three critical points are introduced in this paper in detail. The first one is the design of the parallel framework, which ensures that the algorithm can run on distributed memory platform with multiple nodes. The hybrid Message Passing Interface (MPI) and Open Multi-Processing (OpenMP) programming model is designed to achieve the purposes. The second one is the out-of-core algorithm, which greatly breaks the restriction of MIC memory. The third one is the pipeline algorithm which overlaps the data movement with MIC computation. The pipeline algorithm successfully hides the communication and thus greatly enhances the performance of hybrid MIC/CPU MoM. Numerical result indicates that the proposed algorithm has good parallel efficiency and scalability, and twice faster performance when compared with the corresponding CPU algorithm.
Junbeom HUR Mengxue GUO Younsoo PARK Chan-Gun LEE Ho-Hyun PARK
The reputation-based majority-voting approach is a promising solution for detecting malicious workers in a cloud system. However, this approach has a drawback in that it can detect malicious workers only when the number of colluders make up no more than half of all workers. In this paper, we simulate the behavior of a reputation-based method and mathematically analyze its accuracy. Through the analysis, we observe that, regardless of the number of colluders and their collusion probability, if the reputation value of a group is significantly different from those of other groups, it is a completely honest group. Based on the analysis result, we propose a new method for distinguishing honest workers from colluders even when the colluders make up the majority group. The proposed method constructs groups based on their reputations. A group with the significantly highest or lowest reputation value is considered a completely honest group. Otherwise, honest workers are mixed together with colluders in a group. The proposed method accurately identifies honest workers even in a mixed group by comparing each voting result one by one. The results of a security analysis and an experiment show that our method can identify honest workers much more accurately than a traditional reputation-based approach with little additional computational overhead.
Le DONG Tianli WANG Jiao DU Shanqi PANG
We present a rebound attack on the 4-branch type-2 generalized Feistel structure with an SPS round function, which is called the type-2 GFN-SPS in this paper. Applying a non-full-active-match technique, we construct a 6-round known-key truncated differential distinguisher, and it can deduce a near-collision attack on compression functions of this structure embedding the MMO or MP modes. Extending the 6-round attack, we build a 7-round truncated differential path to get a known-key differential distinguisher with seven rounds. The results give some evidences that this structure is not stronger than the type-2 GFN with an SP round function and not weaker than that with an SPSP round function against the rebound attack.
Sang-Wan KIM Yongbin YIM Hosung PARK Ki-Dong NAM Sang-Ha KIM
Energy-efficient tracking of continuous objects such as fluids, gases, and wild fires is one of the important challenging issues in wireless sensor networks. Many studies have focused on electing fewer nodes to report the boundary information of continuous objects for energy saving. However, this approach of using few reporting packets is very sensitive to packet loss. Many applications based on continuous objects tracking require timely and precise boundary information due to the danger posed by the objects. When transmission of reporting packets fails, applications are unable to track the boundary reliably and a delay is imposed to recover. The transmission failure can fatally degrade application performance. Thus, it is necessary to consider just-in-time recovery for reliable continuous object tracking. Nevertheless, most schemes did not consider the reliable tracking to handle the situation that packet loss happen. Recently, a scheme called I-COD with retransmission was proposed to recover lost packets but it leads to increasing both the energy consumption and the tracking latency owing to the retransmission. Thus, we propose a reliable tracking scheme that uses fast recovery with the redundant boundary information to track continuous objects in real-time and energy-efficiently. In the proposed scheme, neighbor nodes of boundary nodes gather the boundary information in duplicate and report the redundant boundary information. Then the sink node can recover the lost packets fast by using the redundant boundary information. The proposed scheme provides the reliable tracking with low latency and no retransmissions. In addition, the proposed scheme saves the energy by electing fewer nodes to report the boundary information and performing the recovery without retransmissions. Our simulation results show that the proposed scheme provides the energy-efficient and reliable tracking in real-time for the continuous objects.
Shrinkage widely linear recursive least squares (SWL-RLS) and its improved version called structured shrinkage widely linear recursive least squares (SSWL-RLS) algorithms are proposed in this paper. By using the relationship between the noise-free a posterior and a priori error signals, the optimal forgetting factor can be obtained at each snapshot. In the implementation of algorithms, due to the a priori error signal known, we still need the information about the noise-free a priori error which can be estimated with a known formula. Simulation results illustrate that the proposed algorithms have faster convergence and better tracking capability than augmented RLS (A-RLS), augmented least mean square (A-LMS) and SWL-LMS algorithms.
Yi ZHANG Guoqiang ZHAO Houjun SUN Mang HE Qiang CHEN
Digital phase shifters are widely used to achieve space scanning in phased array antenna, and beam pointing accuracy depends on the bit number and resolution of the digital phase shifter. This paper proposes a novel phase feeding method to reduce the phase quantization error effects. A linear formula for the beam pointing deviation of a linear uniform array in condition of phase quantization error is derived, and the linear programming algorithm is introduced to achieve the minimum beam pointing deviation. Simulations are based on the pattern of the phased array, which gives each element a certain quantization phase error to find the beam pointing deviation. The novel method is then compared with previous methods. Examples show that a 32-element uniform linear array with 5-bit phase shifters using the proposed method can achieve a higher beam-steering accuracy than the same array with 11-bit phase shifters.
Mohammed ALSULTAN Kasim OZTOPRAK Reza HASSANPOUR
Wireless Sensor Networks (WSNs) have gained importance with a rapid growth in their applications during the past decades. There has also been a rise in the need for energy-efficient and scalable routing along with the data aggregation protocols for the large scale deployments of sensor networks. The traditional routing algorithms suffer from drawbacks such as the presence of one hop long distance data transmissions, very large or very small clusters within a network at the same moment, over-accumulated energy consumption within the cluster-heads (CHs) etc. The lifetime of WSNs is also decreased due to these drawbacks. To overcome them, we have proposed a new method for the Multi-Hop, Far-Zone and Load-Balancing Hierarchical-Based Routing Algorithm for Wireless Sensor Network (MFLHA). Various improvements have been brought forward by MFLHA. The first contribution of the proposed method is the existence of a large probability for the nodes with higher energy to become the CH through the introduction of the energy decision condition and energy-weighted factor within the electing threshold of the CH. Secondly, MFLHA forms a Far-Zone, which is defined as a locus where the sensors can reach the CH with an energy less than a threshold. Finally, the energy consumption by CHs is reduced by the introduction of a minimum energy cost method called the Multi-Hop Inter-Cluster routing algorithm. Our experimental results indicate that MFLHA has the ability to balance the network energy consumption effectively as well as extend the lifetime of the networks. The proposed method outperforms the competitors especially in the middle range distances.
Yuji KAMIYA Toru NAGURA Shigeki KAWAI Tsuneo NAKATA
In this paper, we propose an infrastructure-free precise positioning system by utilizing a variation of received radio broadcast signal strength against vehicle travel as fingerprints of road segments. Use of broadcast wave is considered advantageous in deployment cost and sample density that affects measurement reliability, compared to communication medium such as 802.11p-based V2X radio used in our previous paper. We also present preliminary experimental results that indicate potential of positioning at 20cm accuracy by using reception information of two FM radio channels broadcast from a station about 20km away from the test track
Wa SI Xun PAN Harutoshi OGAI Katsumi HIRAI
In most existing centralized lighting control systems, the lighting control problem (LCP) is reformulated as a constrained minimization problem and solved by linear programming (LP). However, in real-world applications, LCP is actually discrete and non-linear, which means that more accurate algorithm may be applied to achieve improvements in energy saving. In this paper, particle swarm optimization (PSO) is successfully applied for office lighting control and a linear programming guided particle swarm optimization (LPPSO) algorithm is developed to achieve considerable energy saving while satisfying users' lighting preference. Simulations in DIALux office models (one with small number of lamps and one with large number of lamps) are made and analyzed using the proposed control algorithms. Comparison with other widely used methods including LP shows that LPPSO can always achieve higher energy saving than other lighting control methods.
Teerapong ORACHON Taichi YOSHIDA Somchart CHOKCHAITAM Masahiro IWAHASHI Hitoshi KIYA
The lifting wavelet transform (WT) has been widely applied to image coding. Recently, the total number of lifting steps has been minimized introducing a non-separable 2D structure so that delay from input to output can be reduced in parallel processing. However the minimum lifting WT has a problem that its upper bound of the rate-distortion curve is lower than that of the standard lifting WT. This is due to the rounding noise generated inside the transform in its integer implementation. This paper reduces the rounding noise introducing channel scaling. The channel scaling is designed so that the dynamic range of signal values is fully utilized at each channel inside the transform. As a result, the signal to noise ratio is increased and therefore the upper bound of the minimum lifting WT in lossy coding is improved.
Lilan YU Masaya MIYAHARA Akira MATSUZAWA
This paper proposes two linearity enhancement techniques for open-loop amplifiers. One technique is nonlinearity cancellation. An amplifier with reversed nonlinearity is proposed to cascade with a conventional common source amplifier. The product of these two nonlinear gains demonstrates much higher linearity. It achieves a SFDR of 71 dB when differential output range is 600 mV. Compared with the conventional common source amplifier, about 24 dB improvement is achieved. Another proposed technique is gain adapting. An input amplitude detector utilizing second order nonlinearity is combined with a source-degenerated amplifier. It can adjust the gain automatically according to the input amplitude, and compensate the gain compression when the input amplitude becomes larger. A SFDR of 69 dB is realized when the differential output range is 600 mV. An improvement of 23 dB is achieved after gain is adapted. Furthermore, mismatch calibration for the two proposed linearity enhancement techniques is investigated. Finally, comparison between two proposed amplifiers is introduced. The amplifier with nonlinearity cancellation has advantage in large signal range while the amplifier utilizing gain adapting is more competitive on accurate calibration, fast response and low noise.
Zhaofeng WU Guyu HU Fenglin JIN Yinjin FU Jianxin LUO Tingting ZHANG
Stability-featured dynamic multi-path routing (SDMR) based on the existing Traffic engineering eXplicit Control Protocol (TeXCP) is proposed and evaluated for traffic engineering in terrestrial networks. SDMR abandons the sophisticated stability maintenance mechanisms of TeXCP, whose load balancing scheme is also modified in the proposed mechanism. SDMR is proved to be able to converge to a unique equilibria state, which has been corroborated by the simulations.
Masakazu URA Kohei NOGUCHI Yuta UEOKA Kota NAKAMURA Teruyoshi SASAYAMA Takashi YOSHIDA Keiji ENPUKU
In this paper, we propose improved methods of liquid-phase detection of biological targets utilizing magnetic markers and a high-critical-temperature superconducting quantum interference device (SQUID). For liquid-phase detection, the bound and unbound (free) markers are magnetically distinguished by using Brownian relaxation of free markers. Although a signal from the free markers is zero in an ideal case, it exists in a real sample on account of the aggregation and precipitation of free markers. This signal is called a blank signal, and it degrades the sensitivity of target detection. To solve this problem, we propose improved detection methods. First, we introduce a reaction field, Bre, during the binding reaction between the markers and targets. We additionally introduce a dispersion process after magnetization of the bound markers. Using these methods, we can obtain a strong signal from the bound markers without increasing the aggregation of the free markers. Next, we introduce a field-reversal method in the measurement procedure to differentiate the signal from the markers in suspension from that of the precipitated markers. Using this procedure, we can eliminate the signal from the precipitated markers. Then, we detect biotin molecules by using these methods. In an experiment, the biotins were immobilized on the surfaces of large polymer beads with diameters of 3.3 µm. They were detected with streptavidin-conjugated magnetic markers. The minimum detectable molecular number concentration was 1.8×10-19 mol/ml, which indicates the high sensitivity of the proposed method.
Guang-Ming TANG Kazuyoshi TAKAGI Naofumi TAKAGI
A rapid single-flux-quantum (RSFQ) 4-bit bit-slice multiplier is proposed. A new systolic-like multiplication algorithm suitable for RSFQ implementation is developed. The multiplier is designed using the cell library for AIST 10-kA/cm2 1.0-µm fabrication technology (ADP2). Concurrent flow clocking is used to design a fully pipelined RSFQ logic design. A 4n×4n-bit multiplier consists of 2n+17 stages. For verifying the algorithm and the logic design, a physical layout of the 8×8-bit multiplier has been designed with target operating frequency of 50GHz and simulated. It consists of 21 stages and 11,488 Josephson junctions. The simulation results show correct operation up to 62.5GHz.
Naoki TSUJI Naoki TAKEUCHI Yuki YAMANASHI Thomas ORTLEPP Nobuyuki YOSHIKAWA
We have studied ultra-low-power superconductor circuits using adiabatic quantum flux parametron (AQFP) logic. Latches, which store logic data in logic circuits, are indispensable logic elements in the realization of AQFP computing systems. Among them, feedback latches, which hold data by using a feedback loop, have advantages in terms of their wide operation margins and high stability. Their drawbacks are their large junction counts and long latency. In this paper, we propose a majority gate-based feedback latch for AQFP logic with a reduced number of junctions. We designed and fabricated the proposed AQFP latches using a standard National Institute of Advanced Industrial Science and Technology (AIST) process. The measurement results showed that the feedback latches operate with wide operation margins that are comparable with circuit simulation results.
Liang-Bi CHEN Wan-Jung CHANG Kuen-Min LEE Chi-Wei HUANG Katherine Shu-Min LI
Residents living in a nursing home usually have established medical histories in multiple sources, and most previous medicine management systems have only focused on the integration of prescriptions and the identification of repeated drug uses. Therefore, a comprehensive medicine management system is proposed to integrate medical information from different sources. The proposed system not only detects inappropriate drugs automatically but also allows users to input such information for any non-prescription medicines that the residents take. Every participant can fully track the residents' latest medicine use online and in real time. Pharmacists are able to issue requests for suggestions on medicine use, and residents can also have a comprehensive understanding of their medicine use. The proposed scheme has been practically implemented in a nursing home in Taiwan. The evaluation results show that the average time to detect an inappropriate drug use and complete a medicine record is reduced. With automatic and precise comparisons, the repeated drugs and drug side effects are identified effectively such that the amount of medicine cost spent on the residents is also reduced. Consequently, the proactive feedback, real-time tracking, and interactive consulting mechanisms bind all parties together to realize a comprehensive medicine management system.
Kazuki MIYAHARA Kenji HASHIMOTO Hiroyuki SEKI
We consider the problem of deciding whether a query can be rewritten by a nondeterministic view. It is known that rewriting is decidable if views are given by single-valued non-copying devices such as compositions of single-valued extended linear top-down tree transducers with regular look-ahead, and queries are given by deterministic MSO tree transducers. In this paper, we extend the result to the case that views are given by nondeterministic devices that are not always single-valued. We define two variants of rewriting: universal preservation and existential preservation, and discuss the decidability of them.