In this letter, we present timing synchronization method using two consecutive orthogonal frequency division multiplexing (OFDM) symbols which are designed to be cyclic-shifted against each other. Our approach can be viewed as an expansion of Minn's correlation methods. Using the proposed OFDM signal, however, we can estimate the timing offset without any training symbol.
Chien-Hsing SU Cheng-Sea HUANG Kuang-Yow LIAN
A new control scheme is proposed to improve the system performance for discrete-time fuzzy systems by tuning control grade functions using neural networks. According to a systematic method of constructing the exact Takagi-Sugeno (T-S) fuzzy model, the system uncertainty is considered to affect the membership functions. Then, the grade functions, resulting from the membership functions of the control rules, are tuned by a back-propagation network. On the other hand, the feedback gains of the control rules are determined by solving a set of LMIs which satisfy sufficient conditions of the closed-loop stability. As a result, both stability guarantee and better performance are concluded. The scheme applied to a truck-trailer system is verified by satisfactory simulation results.
Seok Gyu CHOI Jung Hun OH Bok Hyung LEE Byeong Ok LIM Sung Woon MOON Dong Hoon SHIN Sam Dong KIM Jin Koo RHEE
To perform a comparative study, we experimented on two differential epitaxial structures, the conventional metamorphic high-electron-mobility-transistor (MHEMT) using the InAlAs/InGaAs/InAlAs structure and the InP-composite-channel MHEMT adopting the InAlAs/InGaAs/InP structure. Compared with the conventional MHEMT, the InP-composite-channel MHEMT shows improved breakdown performance; more than approximately 3.8 V. This increased breakdown voltage can be explained by the lower impact ionization coefficient of the InP-composite-channel MHEMT than that of the conventional MHEMT. The InP-composite-channel MHEMT also shows improved Radio Frequency characteristics of S21 gain of approximately 4.35 dB at 50 GHz, and a cutoff frequency (fT) and a maximum frequency of oscillation (fmax) of approximately 124 GHz and 240 GHz, respectively, were obtained. These are due to decreases in go and gm.
A radio network (RN for short) is a distributed system with no central arbiter, consisting of n radio transceivers, henceforth referred to as stations. We assume that the stations run on batteries and expends power while broadcasting/receiving a data packet. Thus, the most important measure to evaluate protocols on the radio network is the number of awake time slots, in which a station is broadcasting/receiving a data packet. We also assume that the stations are identical and have no unique ID number, and no station knows the number n of the stations. For given n keys one for each station, the ranking problem asks each station to determine the number of keys in the RN smaller than its own key. The main contribution of this paper is to present an optimal randomized ranking protocol on the k-channel RN. Our protocol solves the ranking problem, with high probability, in O(+log n) time slots with every station being awake for at most O(log n) time slots. We also prove that any randomized ranking protocol is required to run in expected Ω(+log n) time slots with at least one station being awake for expected Ω(log n) time slots. Therefore, our ranking protocol is optimal.
Masao MASUGI Kimihiro TAJIMA Hiroshi YAMANE Kazuo MURAKAWA
This paper describes a two-dimensional clustering scheme-based analysis of audible noises induced at telephone terminals. To analyze EMI sources that cause telephone-audible noise, we use a self-organizing map, which provides a way to map high-dimensional data onto a two-dimensional domain. Also, in order to discriminate EMI sources without using particular resonance frequencies that have peaks in the frequency domain, we use the energy spectra of telephone-audible noises as input for training the self-organizing map. In applying this method in actual environments, we measured ten kinds of telephone-audible noises (due to Radio waves and cross-talk noises, etc.) and then derived their energy spectra for eight frequency bands: 1-250 Hz, 250-500 Hz, 500-1 kHz, 1 k-1.5 kHz, 1.5 k-2 kHz, 2 k-3 kHz, 3 k-4 kHz, and over 4 kHz. We visually confirmed that the measured telephone-audible noise data could be projected onto the map in accordance with their properties, resulting in a combined depiction of the composition of derived energy spectra in the frequency bands. The proposed method can deal with multi-dimensional parameters, projecting its results onto a two-dimensional space in which the projected data positions give us an effective depiction of EMI sources that cause disturbances at telephone terminals.
Jacir Luiz BORDIM Yasuaki ITO Koji NAKANO
In this work we present an energy efficient leader election protocol for anonymous radio network populated with n mobile stations. Previously, Nakano and Olariu have presented a leader election protocol that terminates, with probability exceeding 1- (f ≥ 1), in log log n+o(log log n)+O(log f) time slots [14]. As the above protocol works under the assumption that every station has the ability to transmit and monitor the channel at the same time, it requires every station to be equipped with two transceivers. This assumption, however, is unrealistic for most mobile stations due to constraints in cost, size, and energy dissipation. Our main contribution is to show that it is possible to elect a leader in an anonymous radio network where each station is equipped with a single transceiver. Quite surprisingly, although every station has only one transceiver, our leader election protocol still runs, with probability exceeding 1- (f ≥ 1), in log log n+o(log log n)+O(log f) time slots. Moreover, our leader election protocol needs only expected O(n) total awake time slots, while Nakano and Olariu's protocol needs expected O(nlog log n) total awake time slots. Since every leader election protocol needs at least Ω(n) awake time slots, our leader election protocol is optimal in terms of the expected awake time slots.
Ayami SUZUKA Ryuhei MIYASHIRO Akiko YOSHISE Tomomi MATSUI
Suppose that we have a timetable of a round-robin tournament with a number of teams, and distances among their homes. The home-away assignment problem is to find a home-away assignment that minimizes the total traveling distance of the teams. We propose a formulation of the home-away assignment problem as an integer program, and a rounding algorithm based on Bertsimas, Teo and Vohra's dependent randomized rounding method [2]. Computational experiments show that our method quickly generates feasible solutions close to optimal.
Duang-arthit SRIMOON Chuwong PHONGCHAROENPANICH Monai KRAIRIKSH
A probe-fed U-shaped cross-sectional antenna with tuning stubs on a U-shaped ground plane is proposed for wideband applications. The bottom of the antenna is etched to form tuning stubs for impedance matching. The simulated results of return loss, co- and cross-polarized patterns are presented and compared with the measured ones. Characteristics of a constructed antenna prototype at the operating frequency show that the antenna has an impedance bandwidth (2:1 VSWR) of 37.44% and average gain level of 8.5 dBi. Good radiation characteristics of the proposed antenna have been obtained that is the cross-polarization level and front-to-back ratio in both E- and H-planes across the large bandwidth are better than 22 dB and 12 dB, respectively.
An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of simulation runs and compared with other algorithms. The experimental results show that the improved genetic algorithm performs remarkably well and outperforms its competitors.
A self-organizing wireless network has to deal with reliability and congestion problems when the network size increases. In order to alleviate such problems, we designed and analyzed protocols and algorithms for a reliable and efficient multiple-layer self-organizing wireless network architecture. Each layer uses a high-power root node to supervise the self-organizing functions, to capture and maintain the physical topology, and to serve as the root of the hierarchical routing topology of the layer. We consider the problem of adding a new root with its own rooted spanning tree to the network. Based on minimum-depth and minimum-load metrics, we present efficient algorithms that achieve optimum selection of root(s). We then exploit layer scheduling algorithms that adapt to network load fluctuations in order to optimize the performance. For optimality we consider a load balancing objective and a minimum delay objective respectively. The former attempts to optimize the overall network performance while the latter strives to optimize the per-message performance. Four algorithms are presented and simulations were used to evaluate and compare their performance. We show that the presented algorithms have superior performance in terms of data throughput and/or message delay, compared to a heuristic approach that does not account for network load fluctuations.
Takuichi HIRANO Kimio SAKURAI Jiro HIROKAWA Makoto ANDO Tetsuya IDE Atsushi SASAKI Kazufumi AZUMA Yukihiko NAKATA
The authors have proposed a 1 m2 single-layer slotted waveguide array consisting of conducting baffles and quartz glass strips positioned in front of the slot aperture, which is referred to as a vacuum window, for microwave plasma excitation. The effect of the complicated outer vacuum window hinders the realization of uniform distribution. In this paper, a unit-cell of the alternating-phase fed single-layer slotted waveguide array with the vacuum window is analyzed by generalized scattering matrix method (GSM)-method of moments (MoM) hybridization analysis, and the array is designed to realize uniform aperture electromagnetic field distribution, where the plasma and the chamber is neglected. The GSM-MoM analysis gives reliable numerical results while the MoM has numerical errors due to singularities of Green's function for a long cavity. Uniform aperture EM field distribution outside of the vacuum window is observed in near field measurements using a 1/5 scale model antenna, and the validity of the analysis and design is verified.
Hiroyuki OCHI Shigeaki TAGASHIRA Satoshi FUJITA
In this paper, we propose a new localization scheme for wireless sensor networks consisting of a huge number of sensor nodes equipped with simple wireless communication devices such as wireless LAN and Bluetooth. The proposed scheme is based on the Point-In-Triangle (PIT) test proposed by He et al. The scheme is actually implemented by using Bluetooth devices of Class 2 standard, and the performance of the scheme is evaluated in an actual environment. The result of experiments indicates that the proposed scheme could realize a localization with an error of less than 2 m.
In this paper, we propose a framework that provides users with personalized interfaces by sharing user-centric context between real and virtual environments. The proposed framework consists of ubi-UCAM for generating user's contexts, NAVER for managing virtual environment, and rv-Interface for linking ubi-UCAM with NAVER. Firstly, personalized interface helps users to concentrate on their tasks of interest by reducing burdensome menu selections according to user's context. In addition, user-adaptive contents based on user's preferences allow more pleasure personal experiences. Finally, personalized interface with context hand-over mechanism enables users to continuously interact with virtual environments, even if the users move around. According to experimental results, we expect that the proposed framework can play an important role for realizing user-centric VR applications by exploiting personalized interface that adapts to user-centric context.
In this letter, multi user detection process in Code Division Multiple Access (CDMA) is performed by fuzzy inference system (FIS) and the bit error rate (BER) performance was compared with the single user bound, the matched filter receiver and neural network receiver. The BER performance of the matched filter receiver degrades as the number of the active users and the power level differences among the users increase. The neural network receiver needs the training process. Optimal receiver that has the best BER performance is too complex for practical application. The BER performance near the optimal case was obtained with the proposed receiver. The proposed receiver uses the FIS without training process and it has lower time complexity than the optimal receiver.
The complexity of the optimal decoding for vector quantization (VQ) in code-division multiple access (CDMA) communications prohibits implementation. It was recently shown in [1] that a suboptimal scheme that combines a soft-output multiuser detector and individual VQ decoders provides a flexible tradeoff between decoder's complexity and performance. The work in [1], however, only considers an AWGN channel model. This paper extends the technique in [1] to a frequency-selective Rayleigh fading channel. Simulation results indicate that such a suboptimal decoder also performs very well over this type of channel.
Hiro ITO Kazuo IWAMA Takeyuki TAMURA
In STS-based mapping, it is necessary to obtain the correct order of probes in a DNA sequence from a given set of fragments or an equivalently a hybridization matrix A. It is well-known that the problem is formulated as the combinatorial problem of obtaining a permutation of A's columns so that the resulting matrix has a consecutive-one property. If the data (the hybridization matrix) is error free and includes enough information, then the above column order uniquely determines the correct order of the probes. Unfortunately this does not hold if the data include errors, and this has been a popular research target in computational biology. Even if there is no error, ambiguities in the probe order may still remain. This in fact happens because of the lack of some information regarding the data, but almost no further investigation has previously been made. In this paper, we define a measure of such imperfectness of the data as the minimum amount of the additional fragments that are needed to uniquely fix the probe order. Polynomial-time algorithms to compute such additional fragments of the minimum cost are presented. A computer simulation using genes of human chromosome 20 is also noted.
Eduard A. JORSWIECK Holger BOCHE
The average performance of a single-user MIMO system under spatially correlated fading and with different types of CSI at the transmitter and with perfect CSI at the receiver was studied in recent work. In contrast to analyzing a single performance metric, e.g. the average mutual information or the average bit error rate, we study an arbitrary representative of the class of matrix-monotone functions. Since the average mutual information as well as the average normalized MSE belong to that class, this universal class of performance functions brings together the information theoretic and signal processing performance metric. We use Lowner's representation of operator monotone functions in order to derive the optimum transmission strategies as well as to characterize the impact of correlation on the average performance. Many recent results derived for average mutual information generalize to arbitrary matrix-monotone performance functions, e.g. the optimal transmit strategy without CSI at the transmitter is equal power allocation. The average performance without CSI is a Schur-concave function with respect to transmit and receive correlation. In addition to this, we derive the optimal transmission strategy with long-term statistics knowledge at the transmitter and propose an efficient iterative algorithm. The beamforming-range is the SNR range in which only one data stream spatially multiplexed achieves the maximum average performance. This range is important since it has a simple receiver structure and well known channel coding. We entirely characterize the beamforming-range. Finally, we derive the generalized water-filling transmit strategy for perfect CSI and characterize its properties under channel correlation.
Based on recent results for 2-D continuous-discrete systems, this paper develops 2-D Laplace-z transform, which can be used to analyze 2-D continuous-discrete signals and system in Laplace-z hybrid domain. Current 1-D Laplace transformation and z transform can be combined into the new 2-D s-z transform. However, 2-D s-z transformation is not a simple extension of 1-D transform, in 2-D case, we need consider the 2-D boundary conditions which don't occur in 1-D case. The hybrid 2-D definitions and theorems are given in the paper. To verify the results of this paper, we also derived a numerical inverse 2-D Laplace-z transform, applying it to show the 2-D pulse response of a stable 2-D continuous-discrete system.
Naoto KOBAYASHI Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
We propose transformation of a parity-check matrix of any low-density parity-check code. A code with transformed parity-check matrix is an equivalent of a code with the original parity-check matrix. For the binary erasure channel, performance of a message-passing algorithm with a transformed parity-check matrix is better than that with the original matrix.
Camille VUILLAUME Katsuyuki OKEYA Tsuyoshi TAKAGI
Koblitz curves belong to a special class of binary curves on which the scalar multiplication can be computed very efficiently. For this reason, they are suitable candidates for implementations on low-end processors. However, such devices are often vulnerable to side channel attacks. In this paper, we propose a new countermeasure against side channel attacks on Koblitz curves, which utilizes a fixed-pattern recoding to defeat simple power analysis. We show that in practical cases, the recoding can be performed from left to right, and can be easily stored or even randomly generated.