This paper presents a robust reduced order observer for a class of Lipschitz nonlinear systems with external disturbance. Sufficient conditions on the existence of the proposed observer are characterized by linear matrix inequalities. It is also shown that the proposed observer design can reduce the effect on the estimation error of external disturbance up to the prescribed level. Finally, a numerical example is provided to verify the proposed design method.
Shan ZENG Wenjian YU Jin SHI Xianlong HONG Chung-Kuan CHENG
Inductive effect becomes important for on-chip global interconnects, like the power/ground (P/G) grid. Because of the locality property of partial reluctance, the inverse of partial inductance, the window-based partial reluctance extraction has been applied for large-scale interconnect structures. In this paper, an efficient method of partial reluctance extraction is proposed for large-scale regular P/G grid structures. With a block reuse technique, the proposed method makes full use of the structural regularity of the P/G grid. Numerical results demonstrate the proposed method is able to efficiently handle a P/G grid with up to one hundred thousands wire segments. It is several tens times faster than the window-based method, while generating accurate frequency-dependent partial reluctance and resistance.
This paper presents two power-saving designs for Quadratic Polynomial Permutation (QPP) interleave address generator of which interleave length K is fixed and unfixed, respectively. These designs are based on our observation that the quadratic term f2x2%K of f(x) = (f1x+f2x2)%K, which is the QPP address generating function, has a short period and is symmetric within the period. Power consumption is reduced by 27.4% in the design with fixed-K and 5.4% in the design with unfixed-K on the average for various values of K, when compared with existing designs.
Young-Hwan YOU Taewon HWANG Kwang-Soo JEONG Jae-Hoon YI
This letter presents a noise-robust sampling frequency offset (SFO) estimation scheme for OFDM-based WLAN systems. Mean square error of the proposed estimation scheme is derived and simulation results are provided to verify our analysis. The proposed SFO estimator has an improved performance over the existing schemes with a reduction of the estimation range.
Sang-Wook PARK Fengchao XIAO Yoshio KAMI
An analytical method for estimating coupling between microstrip lines in arbitrary directions on adjacent layers in multi-layer printed circuit boards is studied: one line is embedded and the other is on the surface layer. Coupling or crosstalk has been estimated by development of a circuit-concept approach based on modified telegrapher's equations of the Agrawal approach instead of the Taylor approach for some computational advantages. Electromagnetic fields from the embedded microstrip line and the microstrip line on the surface can be obtained by using the electric image method for dielectric substrates. To verify the proposed approach, we conducted some experiments and compared the results of our approach with those of measurement and a commercial electromagnetic solver.
Chantima SRITIAPETCH Seiichi SAMPEI
This paper proposes a frequency domain nulling filter and Turbo equalizer to suppress interference in the uplink of one-cell reuse single-carrier time division multiple access (TDMA) systems. In the proposed system, the desired signal in a reference cell is interfered by interference signals including adjacent-channel interference (ACI), co-channel interference (CCI), and intersymbol interference (ISI). At the transmitter, after a certain amount of spectrum is nulled considering the expected CCI, the suppressed power due to nulling is reallocated to the remaining spectrum components so as to keep the total transmit power constant. In this process, when mitigation of ACI is necessary, after a certain amount of spectrum at both edges is nulled using an edge-removal filter, the aforementioned process is conducted. At the receiver, frequency domain SC/MMSE Turbo equalizer (FDTE) is employed to suppress ISI due to spectrum nulling process in the transmitter as well as the multipath fading. Computer simulations confirm that the proposed scheme is effective in suppression of CCI, ACI and ISI in one-cell reuse single-carrier TDMA systems.
Yi WANG Li Hua LI Ping ZHANG Ze Min LIU Ping WU
In this letter, a novel blind maximum Doppler frequency estimation algorithm for OFDM based systems is proposed. We only utilize part of the subcarriers which are modulated by constant-envelope modulation such as QPSK. The received magnitude of these subcarriers is obtained and its power spectral density (PSD) is estimated by classic periodogram method. The maximum Doppler frequency is derived by finding the edge point of PSD. Different from the conventional PSD method, our method does not need the channel estimates, the estimation precision is also increased. Simulation results show that the performance of our method is good for a wide range of Doppler spread values.
Yohei KOJIMA Kazuaki TAKEDA Fumiyuki ADACHI
Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can provide better downlink bit error rate (BER) performance of direct sequence code division multiple access (DS-CDMA) than the conventional rake combining in a frequency-selective fading channel. FDE requires accurate channel estimation. In this paper, we propose a new 2-step maximum likelihood channel estimation (MLCE) for DS-CDMA with FDE in a very slow frequency-selective fading environment. The 1st step uses the conventional pilot-assisted MMSE-CE and the 2nd step carries out the MLCE using decision feedback from the 1st step. The BER performance improvement achieved by 2-step MLCE over pilot assisted MMSE-CE is confirmed by computer simulation.
Two-dimensional (2D) matrix symbols have higher storage capacity than conventional bar-codes, and hence have been used in various applications, including parts management in factories and Internet site addressing in camera-equipped mobile phones. These symbols generally utilize strong error control codes to protect data from errors caused by blots and scratches, and therefore require a large number of check bits. Because 2D matrix symbols are expressed in black and white dot patterns, blots and scratches often induce clusters of unidirectional errors (i.e., errors that affect black but not white dots, or vice versa). This paper proposes a new class of unidirectional lm ln-clustered error correcting codes capable of correcting unidirectional errors confined to a rectangle with lm rows and ln columns. The proposed code employs 2D interleaved parity-checks, as well as vertical and horizontal arithmetic residue checks. Clustered error pattern is derived using the 2D interleaved parity-checks, while vertical and horizontal positions of the error are calculated using the vertical and horizontal arithmetic residue checks. This paper also derives an upper bound on the number of codewords based on Hamming bound. Evaluation shows that the proposed code provides high code rate close to the bound. For example, for correcting a cluster of unidirectional 40 40 errors in 150 150 codeword, the code rate of the proposed code is 0.9272, while the upper bound is 0.9284.
In this paper, we analyze the extended real-time Polling Service (ertPS) algorithm in IEEE 802.16e systems, which is designed to support Voice-over-Internet-Protocol (VoIP) services with data packets of various sizes and silence suppression. The analysis uses a two-dimensional Markov Chain, where the grant size and the voice packet state are considered, and an approximation formula for the total throughput in the ertPS algorithm is derived. Next, to improve the performance of the ertPS algorithm, we propose an enhanced uplink resource allocation algorithm, called the e 2rtPS algorithm, for VoIP services in IEEE 802.16e systems. The e 2rtPS algorithm considers the queue status information and tries to alleviate the queue congestion as soon as possible by using remaining network resources. Numerical results are provided to show the accuracy of the approximation analysis for the ertPS algorithm and to verify the effectiveness of the e 2rtPS algorithm.
When the joint source-channel (JSC) decoder is used for source coding over noisy channels, the JSC decoder may invent errors even though the received data is not corrupted by the channel noise, if the JSC decoder assumes the channel was noisy. A novel encoder algorithm has been recently proposed to improve the performance of the communications system under this situation. In this letter, we propose another algorithm based on conditional entropy-constrained vector quantizer to further improve the encoder. The algorithm proposed in this letter significantly improves the performance of the communications system when the hypothesized channel bit error rate is high.
Gangming LV Shihua ZHU Zhimeng ZHONG
A delay-oriented packet scheduling scheme is proposed for downlink OFDMA networks with heterogeneous delay requirements. Using a novel packet utility concept, the proposed algorithm can exploit diversity from traffic characteristics and requirements to improve delay performance for delay sensitive traffics. Besides, the proposal also shows good ability in balancing fairness and efficiency. Simulation results show that our proposal outperforms existing delay-oriented scheduling schemes in terms of both delay performance and spectrum efficiency.
Lechang LIU Yoshio MIYAMOTO Zhiwei ZHOU Kosuke SAKAIDA Jisun RYU Koichi ISHIDA Makoto TAKAMIYA Takayasu SAKURAI
A novel DC-to-960 MHz impulse radio ultra-wideband (IR-UWB) transceiver based on threshold detection technique is developed. It features a digital pulse-shaping transmitter, a DC power-free pulse discriminator and an error-recovery phase-frequency detector. The developed transceiver in 90 nm CMOS achieves the lowest energy consumption of 2.2 pJ/bit transmitter and 1.9 pJ/bit receiver at 100 Mbps in the UWB transceivers.
Jing WU Jeonghoon MO Richard J. LA
We study the interaction of TCP and the proportional fair scheduling algorithm in wireless networks. We show that the additive increase and multiplicative decrease algorithm of TCP can favor bad channel users, which results in inefficient use of radio resources. To remedy the problem, a proportional queue management scheme is proposed. The effectiveness of the algorithm is shown by simulations.
The wireless sensor network is a resource-constrained self-organizing system that consists of a large number of tiny sensor nodes. Due to the low-cost and low-power nature of sensor nodes, sensor nodes are failure-prone when sensing and processing data. Most presented fault-tolerant research for wireless sensor networks focused on crash faults or power faults and less on Byzantine faults. Hence, in this paper, we propose a power-saving data aggregation algorithm for Byzantine faults to provide power savings and high success rates even in the environment with high fault rates. The algorithm utilizes the concept of Byzantine masking quorum systems to mask the erroneous values and to finally determine the correct value. Our simulation results demonstrate that when the fault rate of sensor nodes is up to 50%, our algorithm still has 48% success rate to obtain the correct value. Under the same condition, other fault-tolerant algorithms are almost failed.
To reduce RFID tag identification delay, we propose a novel Dynamic Splitting protocol (DS) which is an improvement of the Query tree protocol (QT). DS controls the number of branches of a tree dynamically. An improved performance of DS relative to QT is verified by analytical results and simulation studies.
Masataka MIYAKE Daisuke HORI Norio SADACHIKA Uwe FELDMANN Mitiko MIURA-MATTAUSCH Hans Jurgen MATTAUSCH Tatsuya OHGURO Takahiro IIZUKA Masahiko TAGUCHI Shunsuke MIYAMOTO
Frequency dependent properties of accumulation-mode MOS varactors, which are key elements in many RF circuits, are dominated by Non-Quasi-Static (NQS) effects in the carrier transport. The circuit performances containing MOS varactors can hardly be reproduced without considering the NQS effect in MOS-varactor models. For the LC-VCO circuit as an example it is verified that frequency-tuning range and oscillation amplitude can be overestimated by over 20% and more than a factor 2, respectively, without inclusion of the NQS effect.
Tasuku NISHIHARA Takeshi MATSUMOTO Masahiro FUJITA
Equivalence checking is one of the most important issues in VLSI design to guarantee that bugs do not enter designs during optimization steps or synthesis steps. In this paper, we propose a new word-level equivalence checking method between two models before and after high-level synthesis or behavioral optimization. Our method converts two given designs into RTL models which have same datapaths so that behaviors by identical control signals become the same in the two designs. Also, functional units become common to the two designs. Then word-level equivalence checking techniques can be applied in bit-level accuracy. In addition, we propose a rule-based equivalence checking method which can verify designs which have complicated control structures faster than existing symbolic simulation based methods. Experimental results with realistic examples show that our method can verify such designs in practical periods.
Tetsuya YAMAMOTO Kazuki TAKEDA Fumiyuki ADACHI
Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can provide a better bit error rate (BER) performance than rake combining. To further improve the BER performance, cyclic delay transmit diversity (CDTD) can be used. CDTD simultaneously transmits the same signal from different antennas after adding different cyclic delays to increase the number of equivalent propagation paths. Although a joint use of CDTD and MMSE-FDE for direct sequence code division multiple access (DS-CDMA) achieves larger frequency diversity gain, the BER performance improvement is limited by the residual inter-chip interference (ICI) after FDE. In this paper, we propose joint FDE and despreading for DS-CDMA using CDTD. Equalization and despreading are simultaneously performed in the frequency-domain to suppress the residual ICI after FDE. A theoretical conditional BER analysis is presented for the given channel condition. The BER analysis is confirmed by computer simulation.
Quantum computations have so far proved to be more powerful than classical computations, but quantum computers still have not been put into practical use due to several technical issues. One of the most serious problems for realizing quantum computers is decoherence that occurs inevitably since our apparatus are surrounded with environment and open systems. In this paper, we give some surveys on a variety of effects of decoherence in quantum algorithms such as Grover's database search and quantum walks, and we show how quantum algorithms work under decoherence, how sensitive they are against decoherence, and how to implement a robust quantum circuit.