This letter describes a two-band excitation model for HMM-based speech synthesis. The HMM-based speech synthesis system generates speech from the HMM training data of the spectral and excitation parameters. Synthesized speech has a typical quality of "vocoded sound" mostly because of the simple excitation model with the voiced/unvoiced selection. In this letter, two-band excitation based on the harmonic plus noise speech model is proposed for generating the mixed excitation source. With this model, we can generate the mixed excitation more accurately and reduce the memory for the trained excitation data as well.
This paper describes a method of free iris and focus image generation based on transformation integrating multiple differently focused images. First, we assume that objects are defocused by a geometrical blurring model. And we combine acquired images on certain imaging planes and spatial information of objects by using a convolution of a three-dimensional blur. Then, based on spatial frequency analysis of the blur, we design three-dimensional filters that generate free iris and focus images from the acquired images. The method enables us to generate not only an all-in-focus image corresponding to an ideal pin-hole iris but also various images, which would be acquired with virtual irises whose sizes are different from the original one. In order to generate a certain image by using multiple differently focused images, especially very many images, conventional methods usually analyze focused regions of each acquired image independently and construct a depth map. Then, based on the map, the regions are merged into a desired image with some effects. However, generally, it is so difficult to conduct such depth estimation robustly in all regions that these methods cannot prevent merged results from including visible artifacts, which decrease the quality of generated images awfully. In this paper, we propose a method of generating desired images directly and robustly from very many differently focused images without depth estimation. Simulations of image generation are performed utilizing synthetic images to study how certain parameters of the blur and the filter affect the quality of generated images. We also introduce pre-processing that corrects the size of acquired images and a simple method for estimating the parameter of the three-dimensional blur. Finally, we show experimental results of free iris and focus image generation from real images.
Boo Hwan LEE Il CHOI Gi Joon JEON
This paper presents a motion-based boundary tracking method for a moving deformable object in an image sequence using a parametric active contour model. Deciding the local converging directions of the contour points is essential for correctly extracting the boundary of a moving deformable object. Thus, a new energy function for a parametric active contour model is proposed based on the addition of a directional energy term using a frame difference map to the greedy snake. The frame difference map is used to obtain motion information on an object with fast and non-rigid motion. Plus, updating rules for the frame difference map are also developed to encourage the stable convergence of the contour points. Experiments on a set of synthetic and real image sequences show that the proposed method could fully track a speedy deformable object while exactly extracting the boundary of the object in every frame.
Azman-Osman LIM Susumu YOSHIDA
We develop an enrichment protocol, called a 2-hop Path Selection Protocol (2PSP) for a set of nodes, in which data can be sent faster using adaptive rate control capability of IEEE 802.11a/b/g MAC protocol via a relaying concept than via a direct connection. The main objective of this protocol is to build upon opportunistic rate adaptation in order to assist a sender, a relay node, and a receiver to reach a higher rate data transmission through Medium Access Control (MAC) layer relaying. We propose a relay mechanism to further improve the performance of 2PSP protocol. In the relay mechanism, new contention window, called a Short Backoff Internal (SBI) is applied for a set of relay nodes. A potential node that succeeds as a relay is allowed to send a Ready-To-Relay (RTR) message. In this paper, two collision resolution algorithms are proposed to deal with the case when the potential relay node is more than one. Simulation results indicate that the proposed 2PSP protocol can achieve high reduction of delay and power consumption and also an improvement in the throughput compared to both Receiving-based Auto Rate (RBAR) and Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocols.
Viet-Hoang LE Trung-Kien NGUYEN Seok-Kyun HAN Sang-Gug LEE
This letter presents a 900 MHz ZigBee RF transmitter front-end with on-chip LO suppression circuit at the output. To suppress the LO leakage at the RF output, a novel LO suppression circuit is adopted at the up-conversion mixer. The RF transmitter implemented in 0.18 µm CMOS shows more than 28 dB of LO suppression over a wide range of the baseband signal power variation.
Wei ZHANG Jun SUN Jing LIU Haibin ZHANG
This letter presents a clear and more accurate analytical model to evaluate the IEEE 802.11e enhanced distributed channel access (EDCA) protocol. The proposed model distinguishes internal collision from external collision. It also differentiates the two cases when the backoff counter decreases, i.e. an arbitration interframe space (AIFS) period after a busy duration and a time slot after the AIFS period. The analytical model is validated through simulation.
Using a pair of matched square-root-raised-cosine (SRRC) filters in the transmitter and the receiver in a band-limited digital communication system can theoretically achieve zero inter-symbol interference (ISI). In reality, the ISI cannot be zero when both SRRC filters are approximately implemented because of some numerical precision problems in the design phase as well as in the implementation phase. In this paper, the author proposes an iterative method to design the coefficients of SRRC FIR filters. The required ISI of the system can be specified such that both ISI and frequency domain specifications are monitored in the design phase. Since the ISI can be specified beforehand, the tradeoff between performance and the filter length becomes possible in the proposed design algorithm.
Luis LOYOLA Tomoaki KUMAGAI Kengo NAGATA Shinya OTSUKI Satoru AIKAWA
The mesh topology based on the standard IEEE 802.11 for wireless LANs (WLANs) appears to be a very promising architecture on the way to realizing an ubiquitous high-speed wireless Internet access in the future. However, the current IEEE 802.11 protocol is aimed at single Access Point (AP) environments and many problems related to the wireless meshed interconnection of APs and Mobile Terminals (MTs) remain unsolved. Some proposed solutions to build such mesh architectures are based on ad-hoc-oriented single-channel schemes that modify IEEE 802.11 protocol. The main problem with this type of schemes, however, lies in the very low performance of the single-channel architecture itself when the network becomes larger or the offered traffic load increases. The task group IEEE 802.11s is currently discussing and working out a standard for IEEE 802.11-compliant mesh architectures for various usage scenarios including residential, office and campus/community/public access network but much work is ahead since the group was recently established. In this paper we propose a new multi-radio multi-channel mesh architecture for WLAN hot spots, which works using a Distributed Coordination Function (DCF)-based technique for interconnecting APs, and also a radio-aware packet forwarding scheme among APs. A major advantage of the system is that, putting routing issues aside, it introduces no changes into the MAC protocol of IEEE 802.11. The simulation results obtained in OPNET v.10.0 show the great potential of our mesh architecture to support real-time traffic with any packet size, and the effectiveness of the radio-aware forwarding scheme in improving the delay performance of the mesh network.
We have proposed a diffusion-type flow control mechanism to achieve the extremely time-sensitive flow control required for high-speed networks. In this mechanism, each node in a network manages its local traffic flow only on the basis of the local information directly available to it, by using predetermined rules. In this way, the implementation of decision-making at each node can lead to optimal performance for the whole network. Our previous studies concentrated on the flow control for a single flow. In this paper, we propose a diffusion-type flow control mechanism for multiple flows. The proposed scheme enables a network to quickly recover from a state of congestion and to achieve fairness among flows.
Ping WANG Binxing FANG Xiaochun YUN Jun ZHENG
We focus on the overall representation of network user behavior and observe that the number of destinations accessed by a network user is limited, which means users have certain preferential haunts in networks. And the distribution of users closely matches heavy tail distribution instead of Possion Distribution.
Hiroki OKUNO Ayami NISHIOKA Maho HOSOGI Fumikazu OOHIRA Gen HASHIGUCHI
In this paper, we propose a new method for detecting label-free T4-DNA molecules quantitatively using a surface plasmon resonance (SPR) technique on a gold thin film. We used a solution that dissolved T4-DNA molecules in pure water, and examined the relationship between DNA concentration change and SPR angle change in the solution. As a result, it was confirmed that the SPR angle change increased with increasing DNA concentration change. Therefore, it was feasible to detect the DNA concentration change using the SPR technique. Furthermore, to examine and detect a single or a few DNA molecule, we tried to fabricate an SPR chip in which SPR area is narrowed so that it has the same effect as focusing the beam. To narrow the SPR area, we decreased the area of gold thin film in this chip, and, to reflect light from only the area of gold thin film, the area without a gold thin film was micromachined to increase its unevenness for the reduction of light reflection. By the above-mentioned method, we examined the possibility of detecting a label-free DNA molecule using the SPR technique.
Jianfeng XU Hong LI Wen-Yan YIN Junfa MAO Le-Wei LI
The element-by-element finite element method (EBE-FEM) combined with the preconditioned conjugate gradient (PCG) technique is employed in this paper to calculate the coupling capacitances of multi-level high-density three-dimensional interconnects (3DIs). All capacitive coupling 3DIs can be captured, with the effects of all geometric and physical parameters taken into account. It is numerically demonstrated that with this hybrid method in the extraction of capacitances, an effective and accurate convergent solution to the Laplace equation can be obtained, with less memory and CPU time required, as compared to the results obtained by using the commercial FEM software of either MAXWELL 3D or ANSYS.
Kwan-Joo MYOUNG Soo-Young SHIN Hong-Seong PARK Wook-Hyun KWON
In this paper, the performance of IEEE 802.11b WLAN under the interference of IEEE 802.15.4 WPAN is analyzed. An analytic model for the coexistence of IEEE 802.15.4 and IEEE 802.11b is presented. Packet error rate, average transmission time, and throughput are evaluated.
Takashi ISHIDA Masayuki GOTO Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
Recently, a word-valued source has been proposed as a new class of information source models. A word-valued source is regarded as a source with a probability distribution over a word set. Although a word-valued source is a nonstationary source in general, it has been proved that an entropy rate of the source exists and the Asymptotic Equipartition Property (AEP) holds when the word set of the source is prefix-free. However, when the word set is not prefix-free (non-prefix-free), only an upper bound on the entropy density rate for an i.i.d. word-valued source has been derived so far. In this paper, we newly derive a lower bound on the entropy density rate for an i.i.d. word-valued source with a finite non-prefix-free word set. Then some numerical examples are given in order to investigate the behavior of the bounds.
Padungkrit PRAGTONG Kazi M. AHMED Tapio J. ERKE
This paper presents the characteristics and modeling of VoIP traffic for a real network. The new model, based on measured data, shows a significant difference from the previously proposed models in terms of parameters and their effects. It is found that the effects of background noise and ringing tones have essential influences on the model. The observed distributions of talkspurt and silent durations have long-tail characteristics and considerably differ from the existing models. An additional state called "Long burst", which represents the background noise at the talker's place, is added into the continuous-time Markov process model. The other three states, "Talk", "Short silence" and "Long silence", represent the normal behavior of the VoIP user. Models for conversational speech containing the communication during the dialogue are presented. In the case of the VoIP traffic aggregation, the simplified models, which neglect the conversation's interaction, are proposed. Depending on the occurrences of background noise during the speech, the model is classified as "noisy speech" or "noiseless speech". The measured data shows that the background noise typically increases the data rate by 60%. Simulation results of aggregated VoIP traffic indicate the self-similarity, which is analogous to the measured data. Results from the measurements support the fact that except the ringing duration the conversations from both the directions can be modeled in identical manner.
Win-Bin HUANG Alvin W. Y. SU Yau-Hwang KUO
Set Partitioning in Hierarchical Trees (SPIHT) is a highly efficient technique for compressing Discrete Wavelet Transform (DWT) decomposed images. Though its compression efficiency is a little less famous than Embedded Block Coding with Optimized Truncation (EBCOT) adopted by JPEG2000, SPIHT has a straight forward coding procedure and requires no tables. These make SPIHT a more appropriate algorithm for lower cost hardware implementation. In this paper, a modified SPIHT algorithm is presented. The modifications include a simplification of coefficient scanning process, a 1-D addressing method instead of the original 2-D arrangement of wavelet coefficients, and a fixed memory allocation for the data lists instead of a dynamic allocation approach required in the original SPIHT. Although the distortion is slightly increased, it facilitates an extremely fast throughput and easier hardware implementation. The VLSI implementation demonstrates that the proposed design can encode a CIF (352288) 4:2:0 image sequence with at least 30 frames per second at 100-MHz working frequency.
Haruhito YOSHIDA Fumiaki MAEHARA Fumio TAKAHATA
This letter presents an iterative decision feedback channel estimation scheme for burst mode COFDM transmission. The feature of the proposed scheme is that the channel estimation using metrics comparison is applied to the initial stage of the iterative mechanism, which makes it possible to provide a reliable data stream at the initial stage. Computer simulation results show that the proposed approach provides better BER than the traditional iterative decision feedback channel estimation scheme irrespective of the number of iterations.
Jung-Wook PARK Byoung-Kon CHOI Kyung-Bin SONG
This letter describes the first derivatives estimation of nonlinear parameters through an embedded identifier in the hybrid system by using a feed-forward neural network (FFNN). The hybrid systems are modelled by the differential-algebraic-impulsive-switched (DAIS) structure. The FFNN is used to identify the full dynamics of the hybrid system. Moreover, the partial derivatives of an objective function J with respect to the parameters are estimated by the proposed identifier. Then, it is applied for the identification and estimation of the non-smooth nonlinear dynamic behaviors due to a saturation limiter in a practical engineering system.
This paper presents the analogical conception of Chomsky normal form and Greibach normal form for linear, monadic context-free tree grammars (LM-CFTGs). LM-CFTGs generate the same class of languages as four well-known mildly context-sensitive grammars. It will be shown that any LM-CFTG can be transformed into equivalent ones in both normal forms. As Chomsky normal form and Greibach normal form for context-free grammars (CFGs) play a very important role in the study of formal properties of CFGs, it is expected that the Chomsky-like normal form and the Greibach-like normal form for LM-CFTGs will provide deeper analyses of the class of languages generated by mildly context-sensitive grammars.
Seungjae BAHNG Chang-Wahn YU Youn-Ok PARK
We propose a simple initial frame timing acquisition algorithm for cellular OFDMA systems. The proposed algorithm utilizes the 9 dB boost in preamble power set by the IEEE 802.16e standard. Simulation results show that the proposed algorithm succeeds in acquiring the starting point of a frame under not only single cell but also multi-cell environments, while the conventional autocorrelation-based method fails under multi-cell environment.