Minseok KIM Yohei KONISHI Jun-ichi TAKADA Boxin GAO
This letter proposes an automatic IQ imbalance compensation technique for quadrature modulators by means of spectrum measurement of RF signal using a spectrum analyzer. The analyzer feeds back only magnitude information of the frequency spectrum of the signal. To realize IQ imbalance compensation, the conventional method of steepest descent is modified; the descent direction is empirically determined and a variable step-size is introduced for accelerating convergence. The experimental results for a four-channel transmitter operating at 11 GHz are presented for verification.
Kyungchul SHIN Youngsun KIM Chul-Hee KANG
This letter considers problems with an efficient link layer multicasting technique in a wireless personal area network environment using a directional antenna. First, we propose an adaptive directional multicast scheme (ADMS) for delay-sensitive applications in mmWave WPAN with directional antenna. Second, the proposed ADMS aims to improve throughput as well as satisfy the application-specific delay requirements. We evaluate the performances of legacy Medium Access Control, Life Centric Approach, and adaptive directional multicast schemes via QualNet 5.0. Our results show that the proposed scheme provides better performance in terms of total network throughput, average transmission time, packet delivery ratio and decodable frame ratio.
In this paper, we derive a simple formula to generate a wide-sense systematic generator matrix(we call it quasi-systematic) B for a Reed-Solomon code. This formula can be utilized to construct an efficient interpolation based erasure-only decoder with time complexity O(n2) and space complexity O(n). Specifically, the decoding algorithm requires 3kr + r2 - 2r field additions, kr + r2 + r field negations, 2kr + r2 - r + k field multiplications and kr + r field inversions. Compared to another interpolation based erasure-only decoding algorithm derived by D.J.J. Versfeld et al., our algorithm is much more efficient for high-rate Reed-Solomon codes.
This letter proposes two efficient schemes for the joint estimation of symbol timing offset (STO) and carrier frequency offset (CFO) in orthogonal frequency division multiplexing (OFDM) based IEEE 802.16e systems. Avoiding the effects of inter symbol interference (ISI) over delay spread by the multipath fading channel is a primary purpose in the letter. To do this, the ISI-corrupted CP is excluded when a correlation function is devised for both schemes, achieving the improved performance. To demonstrate the efficiency of the proposed methods, the performance is compared with the conventional method and is evaluated by the mean square error (MSE), acquisition range of CFO, and complexity comparison.
Hiroaki MUKAI Fumihiko TANO Masaki TANAKA Seiji KOZAKI Hideaki YAMANAKA
PON (Passive Optical Network) achieves FTTH (Fiber To The Home) economically, by sharing an optical fiber among plural subscribers. Recently, global climate change has been recognized as a serious near term problem. Power saving techniques for electronic devices are important. In PON system, the ONU (Optical Network Unit) power saving scheme has been studied and defined in XG-PON. In this paper, we propose an ONU power saving scheme for EPON. Then, we present an analysis of the power reduction effect and the data transmission delay caused by the ONU power saving scheme. According to the analysis, we propose an efficient provisioning method for the ONU power saving scheme which is applicable to both of XG-PON and EPON.
Decoding of Reed-Solomon (RS) codes requires many arithmetic operations in the Galois field. While the software decoding of RS codes has the advantage of its flexibility to support RS codes of variable parameters, the speed of the software decoding is slower than dedicated hardware RS decoders because arithmetic operations in the Galois field on an ordinary processor require many instruction steps. To achieve fast software decoding of RS codes, it is effective to accelerate Galois operations by both dedicated circuitry and parallel processing. In this paper, an accelerator is proposed which is attached to the base processor to speed up the software decoding of RS codes by parallel execution of Galois operations.
This paper presents our recent work in regard to building Large Vocabulary Continuous Speech Recognition (LVCSR) systems for the Thai, Indonesian, and Chinese languages. For Thai, since there is no word boundary in the written form, we have proposed a new method for automatically creating word-like units from a text corpus, and applied topic and speaking style adaptation to the language model to recognize spoken-style utterances. For Indonesian, we have applied proper noun-specific adaptation to acoustic modeling, and rule-based English-to-Indonesian phoneme mapping to solve the problem of large variation in proper noun and English word pronunciation in a spoken-query information retrieval system. In spoken Chinese, long organization names are frequently abbreviated, and abbreviated utterances cannot be recognized if the abbreviations are not included in the dictionary. We have proposed a new method for automatically generating Chinese abbreviations, and by expanding the vocabulary using the generated abbreviations, we have significantly improved the performance of spoken query-based search.
Shi-Ze GUO Zhe-Ming LU Guang-Yu KANG Zhe CHEN Hao LUO
Small-world is a common property existing in many real-life social, technological and biological networks. Small-world networks distinguish themselves from others by their high clustering coefficient and short average path length. In the past dozen years, many probabilistic small-world networks and some deterministic small-world networks have been proposed utilizing various mechanisms. In this Letter, we propose a new deterministic small-world network model by first constructing a binary-tree structure and then adding links between each pair of brother nodes and links between each grandfather node and its four grandson nodes. Furthermore, we give the analytic solutions to several topological characteristics, which shows that the proposed model is a small-world network.
Go HASEGAWA Shinpei TANAKA Yoshiaki TANIGUCHI Hirotaka NAKANO
In this paper, the authors focus on upstream transmission in TDMA-based IEEE 802.16j and propose two time slot assignment algorithms to decrease end-to-end transmission latency. One of the proposed algorithms assigns time slots considering the hop count from a gateway node, and the other takes the path from the relay node to the gateway node into account. In addition, a restriction in assigning time slots is introduced to reduce the delay at each relay node. The algorithms with the restriction assign later time slots considering the time slot order of links connecting a relay node. The performance of the proposed algorithms is evaluated through simulation experiments from the viewpoints of frame size and end-to-end transmission latency, and it is confirmed that the proposed algorithms achieve small transmission latency regardless of packet generation rate in the network, and decrease the transmission latency by up to 70% compared with the existing algorithm.
In this paper, a Schmitt Trigger based 10T SRAM (ST 10T SRAM) cell with the vertical MOSFET is proposed for low supply voltage operation, and its impacts on cell size, stability and speed performance are investigated. The proposed ST 10T SRAM cell with the vertical MOSFET achieves smaller cell size than the ST 10T SRAM cell with the conventional planar MOSFET. Moreover, the proposed SRAM cell realizes large and constant static noise margin (SNM) against bottom node resistance of the vertical MOSFET without any architectural changes from the present 6T SRAM architecture. The proposed SRAM cell also suppresses the degradation of the read time of the ST 10T SRAM cell due to the back-bias effect free characteristic of the vertical MOSFET. The proposed ST 10T SRAM cell with the vertical MOSFET is a superior SRAM cell for low supply voltage operation with a small cell size, stable operation, and fast speed performance with the present 6T SRAM architecture.
Sang-Youl LEE Seung-Dong YANG Jae-Sub OH Ho-Jin YUN Kwang-Seok JEONG Yu-Mi KIM Hi-Deok LEE Ga-Won LEE
In this paper, we fabricated a gate-all-around bandgap-engineered (BE) silicon-oxide-nitride-oxide-silicon (SONOS) and silicon-oxide-high-k-oxide-silicon (SOHOS) flash memory device with a vertical silicon pillar type structure for a potential solution to scaling down. Silicon nitride (Si3N4) and hafnium oxide (HfO2) were used as trapping layers in the SONOS and SOHOS devices, respectively. The BE-SOHOS device has better electrical characteristics such as a lower threshold voltage (VTH) of 0.16 V, a higher gm.max of 0.593 µA/V and on/off current ratio of 5.76108, than the BE-SONOS device. The memory characteristics of the BE-SONOS device, such as program/erase speed (P/E speed), endurance, and data retention, were compared with those of the BE-SOHOS device. The measured data show that the BE-SONOS device has good memory characteristics, such as program speed and data retention. Compared with the BE-SONOS device, the erase speed is enhanced about five times in BE-SOHOS, while the program speed and data retention characteristic are slightly worse, which can be explained via the many interface traps between the trapping layer and the tunneling oxide.
Ashish JAMES A.S. MADHUKUMAR Fumiyuki ADACHI
By performing the encoding operation on several message packets, rateless coding in cooperative networks has the potential risk of processing information already available to the receivers. In this paper, the intermediate packet decodability of rateless codes is exploited to mitigate such redundant packet processing at the cooperating nodes. The message packets that are already decoded at the receivers are eliminated from further processing by harnessing the back channel (from receiver to transmitter) for feedback. This reduces the required number of transmissions and optimizes the throughput of the network.
Kazuo MORI Katsuhiro NAITO Hideo KOBAYASHI
The traffic adaptive 2-level active period control has been proposed as a traffic adaptation mechanism to handle temporal and spatial (geographical) traffic fluctuations in cluster-based wireless sensor networks (WSNs) employing IEEE802.15.4 medium access control (MAC). This paper proposes a traffic adaptive distributed backoff control mechanism for cluster-based WSNs with the traffic adaptive 2-level active period control to enhance the system performance, especially transmission performance. The proposed mechanism autonomously adjusts the starting time of the backoff procedure for channel accesses in the contention access period (CAP) specified by the IEEE802.15.4 MAC, and then distributes the channel access timing over a wide range within the CAP, which can mitigate channel access congestion. The results of computer simulations show that the proposed mechanism can improve the transmission delay performance while keeping the enhancement in throughput and energy consumption at the cluster-based WSNs under non-uniform traffic environments.
Yangjie CAO Hongyang SUN Depei QIAN Weiguo WU
The proliferation of many-core architectures has led to the explosive development of parallel applications using programming models, such as OpenMP, TBB, and Cilk/Cilk++. With increasing number of cores, however, it becomes even harder to efficiently schedule parallel applications on these resources since current many-core runtime systems still lack effective mechanisms to support collaborative scheduling of these applications. In this paper, we study feedback-driven adaptive scheduling based on work stealing, which provides an efficient solution for concurrently executing a set of applications on many-core systems. To dynamically estimate the number of cores desired by each application, a stable feedback-driven adaptive algorithm, called SAWS, is proposed using active workers and the length of active deques, which well captures the runtime characteristics of the applications. Furthermore, a prototype system is built by extending the Cilk runtime system, and the experimental results, which are obtained on a Sun Fire server, show that SAWS has more advantages for scheduling concurrent parallel applications. Specifically, compared with existing algorithms A-Steal and WS-EQUI, SAWS improves the performances by up to 12.43% and 21.32% with respect to mean response time respectively, and 25.78% and 46.98% with respect to processor utilization, respectively.
Youn-Hee HAN Chan-Myung KIM Joon-Min GIL
A key challenge in developing energy-efficient sensor networks is to extend network lifetime in resource-limited environments. As sensors are often densely distributed, they can be scheduled on alternative duty cycles to conserve energy while satisfying the system requirements. Directional sensor networks composed of a large number of directional sensors equipped with a limited battery and with a limited angle of sensing have recently attracted attention. Many types of directional sensors can rotate to face a given direction. Maximizing network lifetime while covering all of the targets in a given area and forwarding sensor data to the sink is a challenge in developing such rotatable directional sensor networks. In this paper, we address the maximum directional cover tree (MDCT) problem of organizing directional sensors into a group of non-disjoint subsets to extend network lifetime. One subset, in which the directional sensors cover all of the targets and forward the data to the sink, is activated at a time, while the others sleep to conserve energy. For the MDCT problem, we first present an energy-consumption model that mainly takes into account the energy expenditure for sensor rotation as well as for the sensing and relaying of data. We also develop a heuristic scheduling algorithm called directional coverage and connectivity (DCC)-greedy to solve the MDCT problem. To verify and evaluate the algorithm, we conduct extensive simulations and show that it extends network lifetime to a reasonable degree.
Amir FATHI Sarkis AZIZIAN Khayrollah HADIDI Abdollah KHOEI
This paper presents design of a novel high speed booth encoder-decoder in a 0.35 µm CMOS technology. Focusing on transistor level implementation of the new architecture and employing newly designed truth table, the gate level delay of the whole system is reduced to one logic gate plus one transistor delay which is the main advantage of the proposed circuit. Simulation results indicate high speed performance of the designed circuit and depict low power dissipation feature of implemented architecture which makes this work suitable for extensive use in high speed arithmetic blocks.
Shoichi OSHIMA Mamoru UGAJIN Mitsuru HARADA
A new low-power feedback structure for a power amplifier (PA) reduces signal distortion while keeping the power efficiency of the PA high. The feedback structure injects the envelope of the third-order harmonics into the input signal. In adopting this method for a class-A amplifier, we obtain over 10% higher efficiency while maintaining the same adjacent channel power ratio (ACPR). The power consumption of additional circuit is 200 µW.
Kunihiro NODA Takashi KOBAYASHI Shinichiro YAMAMOTO Motoshi SAEKI Kiyoshi AGUSA
Program comprehension using dynamic information is one of key tasks of software maintenance. Software visualization with sequence diagrams is a promising technique to help developer comprehend the behavior of object-oriented systems effectively. There are many tools that can support automatic generation of a sequence diagram from execution traces. However it is still difficult to understand the behavior because the size of automatically generated sequence diagrams from the massive amounts of execution traces tends to be beyond developer's capacity. In this paper, we propose an execution trace slicing and visualization method. Our proposed method is capable of slice calculation based on a behavior model which can treat dependencies based on static and dynamic analysis and supports for various programs including exceptions and multi-threading. We also introduce our tool that perform our proposed slice calculation on the Eclipse platform. We show the applicability of our proposed method by applying the tool to two Java programs as case studies. As a result, we confirm effectiveness of our proposed method for understanding the behavior of object-oriented systems.
Byungsung PARK Jaeyeong YOO Hagbae KIM
In a large queuing system, the effect of the ratio of the filled data on the queue and waiting time from the head of a queue to the service gate are important factors for process efficiency because they are too large to ignore. However, many research works assumed that the factors can be considered to be negligible according to the queuing theory. Thus, the existing queuing models are not applicable to the design of large-scale systems. Such a system could be used as a product classification center for a home delivery service. In this paper, we propose a tree-queue model for large-scale systems that is more adaptive to efficient processes compared to existing models. We analyze and design a mean waiting time equation related to the ratio of the filled data in the queue. Based on simulations, the proposed model demonstrated improvement in process-efficiency, and it is more suitable to realistic system modeling than other compared models for large-scale systems.
We propose a network coordinated opportunistic beamforming (NC-OBF) protocol for downlink K-cell networks with M-antenna base stations (BSs). In the NC-OBF scheme, based on pseudo-randomly generated BF vectors, a user scheduling strategy is introduced, where each BS opportunistically selects a set of mobile stations (MSs) whose desired signals generate the minimum interference to the other MSs. Its performance is then analyzed in terms of degrees-of-freedom (DoFs). As our achievability result, it is shown that KM DoFs are achievable if the number N of MSs in a cell scales at least as SNRKM-1, where SNR denotes the received signal-to-noise ratio. Furthermore, by deriving the corresponding upper bound on the DoFs, it is shown that the NC-OBF scheme is DoF-optimal. Note that the proposed scheme does not require the global channel state information and dimension expansion, thereby resulting in easier implementation.