This letter describes experiments conducted to measure the interference effects of two kinds of UWB sources, which are OFDM UWB source and pulse radio UWB source, to broadcasting relay system and SDMB system. The received power degradation of a broadcasting system is presented. experimental results show that UWB system can coexist 35 m distance as close as to in-band broadcasting network and can also coexist 1.8 m as close as with the SDMB terminal without causing any dangerous interference.
Chanwoo KIM Kwang-Deok SEO Wonyong SUNG
In this letter, we derive an efficient audio/video synchronization method for video telephony. For synchronization, this method does not require any further RTCP packet processing except for the first one. The derived decision rule is far more compact than the conventional method. This decision rule is incorporated in an actual video telephony system adopting Texas Instruments (TI) OMAP 1510 processor and Qualcomm MSM 5500. The computational requirement was compared with the conventional method and through simulations the superiority of the proposed method is proved.
Yuki HIGUCHI Takashi MITSUISHI Kentaro GO
In this paper, we propose an interactive instruction system named IMPRESSION, which allows performance of interactive presentations using multimedia educational materials in class. In recent years, although many practices of educational methodology with information technology and presentation tools using multimedia resources as educational materials have come into common use, instructors can only present such materials in a slide-sheet form through the use of such presentation tools in class. Therefore, instructors can neither do formative evaluations nor can they present suitable materials according to students' reactions in class. Our proposed methodology employs a scenario-based approach in a double loop instructional design process to overcome such problems. Instructors design an instructional plan as a scenario, and subsequently implement and modify the plan through formative evaluation during the class. They then conduct a summative evaluation based on planned and implemented instructions for redesign. To realize our methodology, in this paper we propose and design an instruction system that provides functions to select and present multimedia materials interactively provided on the Internet during the class; we then record these instructions. After implementing it, we confirmed that we can conduct the class flexibly based on our methodology through its practical use in an actual classroom environment.
Yasuo SUGURE Seiji TAKEUCHI Yuichi ABE Hiromichi YAMADA Kazuya HIRAYANAGI Akihiko TOMITA Kesami HAGIWARA Takeshi KATAOKA Takanori SHIMURA
A 32-bit embedded RISC microcontroller core targeted for automotive, industrial, and PC-peripheral applications has been developed to offer the smaller code size, lower-latency instruction and interrupt processing needed for next-generation microcontrollers. The 360 MIPS/400MFLOPS/200 MHz core--based on the Harvard bus architecture--uses 0.13/0.15-µm CMOS technology and consists of a CPU, FPU, and register banks. To reduce the size of the control programs, new instructions have been added to the instruction set. These new instructions, as well as an enhanced C compiler, produce object files about 25% smaller than those for a previous designed core. A dual-issue superscalar structure consisting of three- or five-stage pipelines provides instruction processing with low latency. The cycle performance is thus an average of 1.8 times faster than the previous designed core. The superscalar structure is used to save 19 CPU registers in parallel when executing interrupt processing. That is, it saves the 19 CPU registers to the resister bank by accessing four registers at a time. This structure significantly improves interrupt response time from 37 cycles to 6 cycles.
Seok-jin LEE Seung-kwon CHO Young-il KIM Kyoung-rok CHO
Among the broadband wireless communication standards utilized to satisfy the demand for multimedia services, time division duplexing (TDD) is satisfactory for the asymmetric data transmission emphasized in Internet services. In this system, the transition between receiving a frame and transmitting a response must be bounded for an effective use of radio resources. However, the minimized inter-frame space-time requires high processing power. The aim of the present paper is to gain insight into the time latency at the turn-around time of a TDD operation. We also propose a simplified new processor, which is a terminal device-friendly architecture that includes prediction and preparation to support processing of burst-type traffic.
Analog-to-Digital converters (ADCs) for video applications have made exciting progress in miniaturization and power reduction in the past 20 years. This paper mainly describes the key technologies for miniaturization and power reduction of 10-bit video-frequency ADCs. By reviewing useful architectures and circuit schemes for video-frequency ADCs, self-calibration techniques and interleaving techniques are surveyed. The subranging pipeline look-ahead ADC architecture is introduced. It has a potential for reducing power consumption and improving conversion rate when minute deep submicron CMOS devices are used with low supply voltage.
Zheng LIU Masanori FURUTA Shoji KAWAHITO
The RC mismatch among S/H stages for time-interleaved ADCs causes a phase error and a gain error and the phase error is dominant. The paper points out that clock skew and the phase error caused by the RC mismatch have similar effects on the sampling error and then can be compensated with the clock skew compensation. Simulation results agree well with the theoretical analysis. With the phase error compensation of RC mismatch, the SNDR in 14b ADC can be improved by more than 15 dB in the case that the bandwidth of S/H circuits is 3 times the sampling frequency. This paper also proposes a method of clock skew and RC mismatch compensation in time-interleaved sample-and-hold (S/H) circuits by sampling clock phase adjusting.
Thang Viet NGUYEN Takehiro MORI Yoshihiro MORI
This paper studies the problem of the relations between existence conditions of common quadratic and those of common infinity-norm Lyapunov functions for sets of discrete-time linear time-invariant (LTI) systems. Based on the equivalence between the robust stability of a class of time-varying systems and the existence of a common infinity-norm Lyapunov function for the corresponding set of LTI systems, the relations are determined. It turns out that although the relation is an equivalent one for single stable systems, the existence condition of common infinity-norm type is strictly implied by that of common quadratic type for the set of systems. Several existence conditions of a common infinity-norm Lyapunov functions are also presented for the purpose of easy checking.
We propose an optimal algorithm for the real-time scheduling of parallel tasks on multiprocessors, where the tasks have the properties of flexible preemption, linear speedup, bounded parallelism, and arbitrary deadline. The proposed algorithm is optimal in the sense that it always finds out a feasible schedule if one exists. Furthermore, the algorithm delivers the best schedule consuming the fewest processors among feasible schedules. In this letter, we prove the optimality of the proposed algorithm. Also, we show that the time complexity of the algorithm is O(M2N2) in the worst case, where M and N are the number of tasks and the number of processors, respectively.
Given a graph G=(V,E), a set of vertices S ⊆ V covers v ∈ V if the edge connectivity between S and v is at least a given number k. Vertices in S are called sources. The source location problem is a problem of finding a minimum-size source set covering all vertices of a given graph. This paper presents a new variation of the problem, called maximum-cover source-location problem, which finds a source set S with a given size p, maximizing the sum of the weight of vertices covered by S. It presents an O(np + m + nlog n)-time algorithm for k=2, where n=|V| and m=|E|. Especially it runs linear time if G is connected. This algorithm uses a subroutine for finding a subtree with the maximum weight among p-leaf trees of a given vertex-weighted tree. For the problem we give a greedy-based linear-time algorithm, which is an extension of the linear-time algorithm for finding a longest path of a given tree presented by E. W. Dijkstra around 1960. Moreover, we show some polynomial solvable cases, e.g., a given graph is a tree or (k-1)-edge-connected, and NP-hard cases, e.g., a vertex-cost function is given or G is a digraph.
Trong Thua HUYNH Choong Seon HONG
Sensors have very scarce resources in terms of memory, energy and computational capacities. Wireless sensor network is composed of a large number of such sensor nodes densely deployed in inhospitable physical environments. Energy efficient information dissemination throughout such a network is still a challenge. Though dissemination of information with minimum energy consumption is a key concern in wireless sensor networks, it often introduces additional delay. In this work, we first propose an energy and delay efficient multi-hop routing scheme called C2E2S (Cluster and Chain based Energy*Delay Efficient Routing Scheme) for wireless sensor networks. This scheme is a combination of cluster-based and chain-based approaches and the way to form clusters and chains in this work is center-based approach. To reduce a large number of communication overheads due to this approach, we propose a modified-center-based approach called passive-BS-based approach. Next, we propose (1) an energy and delay aware routing algorithm for sensors within each k-hop cluster, and (2) an Energy-efficient chain construction algorithm for cluster heads. To evaluate the appropriateness of our approach, we analyze the evaluated performance against existing protocols in terms of communication overhead, the number of communication rounds (network lifetime), total amount of energy dissipated in the system over time, network delay and Energy*Delay metric using SENSE simulator. The simulation results show that C2E2S consumes less energy, balances the energy and delay metrics, and extends the network lifetime as compared to other approaches.
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.
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.
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.
This paper proposes a low complexity composite CDMA system based on MIMO (Multiple-Input-Multiple-Output) processing and LDPC (low-density parity-check) codec based a CDMA system, which works well even if the complicated case of multipath, multiusers and short length LDPC codes. To explore the practical application, the mobile user in the composite CDMA systems is with only two antennas and adopts short length irregular LDPC codec, each user's data has been divided two LDPC encoded substreams being sent to two transmitter antennas at base station. Since the LDPC encoded substreams of reaching the mobile user are orthogonal to each other in space and time, the CDMA system performances (BER and SINR) can be improved much, but the multipath may ruin the orthogonalilty. To solve the problems, the paper provides the algorithms of main function modules of transmitter and receivers, gives a simple method to test the girth of LDPC codes, and analyzes the performance of MIMO-LDPC CDMA systems theoretically and experimentally. The simulation results show that the hybrid CDMA systems can have better performance than the conventional CDMA systems based on single transmitted antenna at a base station.
Jaehak CHUNG Seung Hoon NAM Chan-Soo HWANG
A differential detection Space-Time Block Code (STBC) is proposed with a high transmission rate, allowing a trade-off between diversity and multiplexing gain with low encoding and decoding complexity. The proposed method offers multiplexing gain by doubling the transmission rate for three and four transmission antennas. Computer simulations demonstrate that the proposed STBC can achieve a 5.8 dB Eb/N0 gain at BER = 10-3 compared with a conventional differential detection STBC for four transmission and two receiving antennas.
Seung Hoon NAM Jaehak CHUNG Chan-Soo HWANG
A design of non-orthogonal 33 space-time block code (STBC) is proposed. The proposed design achieves full rate, full level diversity, and maximum coding gain by symbol rotation (SR) method. In addition, the proposed scheme has lower encoding complexity than the unitary constellation-rotation (CR) STBC, while two methods exhibit the same bit error rate (BER) performance in Rayleigh fading channel.
Mohammad E. HAMID Takeshi FUKABAYASHI
A time domain (TD) speech enhancement technique to improve SNR in noise-contaminated speech is proposed. Additional supplementary scheme is applied to estimate the degree of noise of noisy speech. This is estimated from a function, which is previously prepared as the function of the parameter of the degree of noise. The function is obtained by least square (LS) method using the given degree of noise and the estimated parameter of the degree of noise. This parameter is obtained from the autocorrelation function (ACF) on frame-by-frame basis. This estimator almost accurately estimates the degree of noise and it is useful to reduce noise. The proposed method is based on two-stage processing. In the first stage, subtraction in time domain (STD), which is equivalent to ordinary spectral subtraction (SS), is carried out. In the result, the noise is reduced to a certain level. Further reduction of noise and by-product noise residual is carried out in the second stage, where blind source separation (BSS) technique is applied in time domain. Because the method is a single-channel speech enhancement, the other signal is generated by taking the noise characteristics into consideration in order to apply BSS. The generated signal plays a very important role in BSS. This paper presents an adaptive algorithm for separating sources in convolutive mixtures modeled by finite impulse response (FIR) filters. The coefficients of the FIR filter are estimated from the decorrelation of two mixtures. Here we are recovering only one signal of interest, in particular the voice of primary speaker free from interfering noises. In the experiment, the different levels of noise are added to the clean speech signal and the improvement of SNR at each stage is investigated. The noise types considered initially in this study consist of the synthesized white and color noise with SNR set from 0 to 30 dB. The proposed method is also tested with other real-world noises. The results show that the satisfactory SNR improvement is attained in the two-stage processing.
Toshiya MASHIMA Satoshi TAOKA Toshimasa WATANABE
The k-edge-connectivity augmentation problem for a specified set of vertices of a graph with degree constraints, kECA-SV-DC, is defined as follows: "Given an undirected multigraph G = (V,E), a specified set of vertices S ⊆V and a function g: V → Z+ ∪{∞}, find a smallest set E' of edges such that (V,E ∪ E') has at least k edge-disjoint paths between any pair of vertices in S and such that, for any v ∈ V, E' includes at most g(v) edges incident to v, where Z+ is the set of nonnegative integers." This paper first shows polynomial time solvability of kECA-SV-DC and then gives a linear time algorithm for 2ECA-SV-DC.
Masafumi UEMORI Haruo KOBAYASHI Tomonari ICHIKAWA Atsushi WADA Koichiro MASHIKO Toshiro TSUKADA Masao HOTTA
This paper proposes a continuous-time bandpass ΔΣAD modulator architecture which performs high-accuracy AD conversion of high frequency analog signals and can be used for next-generation radio systems. We use an RF DAC inside the modulator to enable subsampling and also to make the SNDR of the continuous-time modulator insensitive to DAC sampling clock jitter. We have confirmed that this is the case by MATLAB simulation. We have also extended our modulator to multi-bit structures and show that this alleviates excess loop delay problems.