Makoto ISHIKAWA George SAIKALIS Shigeru OHO
We review practical case studies of a developing method of highly reliable real-time embedded control systems using a CPU model-based hardware/software co-simulation. We take an approach that enables us to fully simulate a virtual mechanical control system including a mechatronics plant, microcontroller hardware, and object code level software. This full virtual system approach simulates control system behavior, especially that of the microcontroller hardware and software. It enables design space exploration of microarchitecture, control design validation, robustness evaluation of the system, software optimization before components design. It also avoids potential problems. The advantage of this work is that it comprises all the components in a typical control system, enabling the designers to analyze effects from different domains, for example mechanical analysis of behavior due to differences in controller microarchitecture. To further improve system design, evaluation and analysis, we implemented an integrated behavior analyzer in the development environment. This analyzer can graphically display the processor behavior during the simulation without affecting simulation results such as task level CPU load, interrupt statistics, and the software variable transition chart. It also provides useful information on the system behavior. This virtual system analysis does not require software modification, does not change the control timing, and does not require any processing power from the target microcontroller. Therefore this method is suitable for real-time embedded control system design, in particular automotive control system design that requires a high level of reliability, robustness, quality, and safety. In this study, a Renesas SH-2A microcontroller model was developed on a CoMETTMplatform from VaST Systems Technology. An electronic throttle control (ETC) system and an engine control system were chosen to prove this concept. The electronic throttle body (ETB) model on the Saber® simulator from Synopsys® and the engine model on MATLAB®/Simulink® simulator from MathWorks can be simulated with the SH-2A model using a newly developed co-simulation interface between MATLAB®/Simulink® and CoMETTM. Though the SH-2A chip was being developed as the project was being executed, we were able to complete the OSEK OS development, control software design, and verification of the entire system using the virtual environment. After releasing a working sample chip in a later stage of the project, we found that such software could run on both actual ETC system and engine control system without critical problem. This demonstrates that our models and simulation environment are sufficiently credible and trustworthy.
Mamiko INAMORI Anas Muhamad BOSTAMAM Yukitoshi SANADA Hideki MINAMI
This paper presents a frequency offset estimation scheme for Orthogonal Frequency Division Multiplex (OFDM) direct conversion receivers. The key idea is to use a differential filter for reduction of DC offset. Frequency offset is estimated in the presence of time-varying DC offset. In order to overcome the varying DC levels under automatic gain control (AGC) circuits, a threshold level is set for the output of the differential filter. The proposed compensation scheme offers superior frequency offset estimation when compared with a conventional scheme with a high pass filter.
Sang-Min HAN Mi-Hyun SON Young-Hwan KIM
A chaotic UWB communication system based on IEEE 802.15.4a is proposed for wireless connectivity applications. A compact and simple architecture is implemented by using a chaotic UWB signal and a non-coherent detection scheme. The chaotic UWB signal has noise-like characteristics in time and frequency domains and naturally wide spectrum within a limited bandwidth. The chaotic UWB signal generator is designed on two methods with the bandwidth of 3.1 to 5.1 GHz, and a baseband process is realized on an FPGA including an adaptive decision and a channel code for non-source coded data stream. The system performance is evaluated by transmitting MP3 audio/voice with 32-byte length PSDUs and measuring PERs for assessing the system sensitivity and the interferer compatibility. The proposed system can be an excellent candidate for short-range connectivity services, as well as an inexpensive system with good capability for narrow-band interferences.
JunHwan LEE Yoshihisa KISHIYAMA Tomoaki OHTSUKI Masao NAKAGAWA
In a time-invariant wireless channel, the multipath that exceeds the cyclic prefix (CP) or the guard interval (GI) causes orthogonal frequency division multiplexing (OFDM) systems to hardly achieve high data rate transmission due to the inter-symbol interference (ISI) and the inter-carrier interference (ICI). In this paper the new canceller scheme, named as Double Window Cancellation and Combining (DWCC) is proposed. It includes the entire symbol interval, delayed by multipath as a signal processing window and intends to improve the performance by combining the double windows that can be formed by the pre- and post-ISI cancellation and reconstruction to the received OFDM symbol interfered by the multipath exceeding the guard interval. The proposed scheme has two algorithm structures of the DWCC-I and -II which are distinguished by the operational sequence (Symbol-wise or Group-wise) to the OFDM symbols of the received packet and by the selection of the processing window in the iterative decision feedback processing. Since the performance of the canceller is dependant on the equalization, particularly on the initial equalization, the proposed schemes operate with the time and frequency domain equalizer in the initial and the iterative symbol detection, respectively. For the verification of the proposed schemes, each scheme is evaluated in the turbo coded OFDM for low (QPSK) and high level modulation systems (16QAM, 64QAM), and compared with the conventional canceller with respect to the performance and computational complexity. As a result, the proposed schemes do not have an error floor even for 64QAM in a severe frequency selective channel.
The present paper introduces an integrated construction of binary sequences having a zero-correlation zone. The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The proposed method enables more flexible design of the binary zero-correlation zone sequence set with respect to its member size, length, and width of zero-correlation zone. Several previously reported sequence construction methods of binary zero-correlation zone sequence sets can be explained as special cases of the proposed method.
Shu-Chen WANG Pei-Hwa HUANG Chi-Jui WU Yung-Sung CHUANG
This paper is to investigate the application of fuzzy c-means clustering to the direct identification of coherent synchronous generators in power systems. Because of the conceptual appropriateness and computational simplicity, this approach is essentially a fast and flexible method. At first, the coherency measures are derived from the time-domain responses of generators in order to reveal the relations between any pair of generators. And then they are used as initial element values of the membership matrix in the clustering procedures. An application of the proposed method to the Taiwan power (Taipower) system is demonstrated in an attempt to show the effectiveness of this clustering approach. The effects of short circuit fault locations, operating conditions, data sampling interval, and power system stabilizers are also investigated, as well. The results are compared with those obtained from the similarity relation method. And thus it is found that the presented approach needs less computation time and can directly initialize a clustering process for any number of clusters.
Akari SATO Yoshihiro HAYAKAWA Koji NAKAJIMA
Many researchers have attempted to solve the combinatorial optimization problems, that are NP-hard or NP-complete problems, by using neural networks. Though the method used in a neural network has some advantages, the local minimum problem is not solved yet. It has been shown that the Inverse Function Delayed (ID) model, which is a neuron model with a negative resistance on its dynamics and can destabilize an intended region, can be used as the powerful tool to avoid the local minima. In our previous paper, we have shown that the ID network can separate local minimum states from global minimum states in case that the energy function of the embed problem is zero. It can achieve 100% success rate in the N-Queen problem with the certain parameter region. However, for a wider parameter region, the ID network cannot reach a global minimum state while all of local minimum states are unstable. In this paper, we show that the ID network falls into a particular permanent oscillating state in this situation. Several neurons in the network keep spiking in the particular permanent oscillating state, and hence the state transition never proceed for global minima. However, we can also clarify that the oscillating state is controlled by the parameter α which affects the negative resistance region and the hysteresis property of the ID model. In consequence, there is a parameter region where combinatorial optimization problems are solved at the 100% success rate.
Verayuth LERTNATTEE Thanaruk THEERAMUNKONG
In order to support decision making, text classification is an important tool. Recently, in addition to term frequency and inverse document frequency, term distributions have been shown to be useful to improve classification accuracy in multi-class classification. This paper investigates the performance of these term distributions on binary classification using a centroid-based approach. In such one-against-the-rest, there are only two classes, the positive (focused) class and the negative class. To improve the performance, a so-called hierarchical EM method is applied to cluster the negative class, which is usually much larger and more diverse than the positive one, into several homogeneous groups. The experimental results on two collections of web pages, namely Drug Information (DI) and WebKB, show the merits of term distributions and clustering on binary classification. The performance of the proposed method is also investigated using the Thai Herbal collection where the texts are written in Thai language.
Nordin Bin RAMLI Tetsuki TANIGUCHI Yoshio KARASAWA
This paper presents interference suppression using a subband adaptive array (SBAA) for uplink space-time block coding (STBC) code division multiple access (CDMA) under a frequency selective fading (FSF) channel. The proposed scheme utilizes CDMA with STBC and a receive array antenna with SBAA processing at the receiver. The received signal is converted into the frequency domain before despreading and adaptive processing is performed for each subband. A novel SBAA construction is introduced to process CDMA signals based on STBC. To improve the performance of the proposed scheme, we evaluate STBC-SBAA using spreading codes cyclic prefix (CP). Simulation results demonstrate an improved performance of the proposed system for single and multiuser environments compared to competing related techniques.
Myeongcheol SHIN Sangheon KIM Jiwon KANG Chungyong LEE
For the closed loop multiple-input-multiple-output (MIMO) systems, Fisher's adaptive bit loading algorithm gives the best error performance by jointly optimizing the transmit powers, rates, and number of streams. However, its good performance comes at the cost of high and variable computational complexity for the joint optimization. In this letter, we propose an efficient multi-mode precoding algorithm using a simplified mode table. Numerical results show that the proposed algorithm provides almost the same performance as Fischer's with much less computational complexity.
Yong-Yuk WON Hyuk-Choon KWON Sang-Kook HAN
A new scheme for reducing optical beat interference noise in a reflective semiconductor optical amplifier based wavelength division multiplexed/subcarrier multiplexing -- passive optical network is proposed. This method uses an Fabry Perot laser locked by modulated lights from optical network units in a central office. As an experimental verification, it is reported that carrier to noise ratio is enhanced by 10 dB and power penalty is improved by 16 dB.
Yoshihisa OKADA Tomotaka WADA Masato HORIE Fumio NAKASE Hiromi OKADA
Inter-Vehicle Communication (IVC) is one of the most important technologies to realize advanced Intelligent Transport Systems (ITS). We extensively apply the IVC technology to the communications between pedestrians and vehicles. We call this kind of communications VPEC (Vehicle-PEdestrian Communications). The objective of this paper is to present an effective control scheme for VPEC and to evaluate the performance of proposed scheme by experiments. We deal with direct communications between pedestrians and vehicles. Due to the battery shortage of pedestrians' terminals (p-node), we have presented a reflect-transmission scheme. In this paper, we propose a new access protocol for reflect-transmission scheme, and show its validity by various experiments with several vehicles.
Chin-Chen CHANG Wen-Chuan WU Chih-Chiang TSOU
The major application of digital data hiding techniques is to deliver confidential data secretly via public but unreliable computer networks. Most of the existing data hiding schemes, however, exploit the raw data of cover images to perform secret communications. In this paper, a novel data hiding scheme was presented with the manipulation of images based on the compression of side-match vector quantization (SMVQ). This proposed scheme provided adaptive alternatives for modulating the quantized indices in the compressed domain so that a considerable quantity of secret data could be artfully embedded. As the experimental results demonstrated, the proposed scheme indeed provided a larger payload capacity without making noticeable distortions in comparison with schemes proposed in earlier works. Furthermore, this scheme also presented a satisfactory compression performance.
It has been shown that the output information produced by the soft output Viterbi algorithm (SOVA) is too optimistic. To compensate for this, the output information should be normalized. This letter proposes a simple normalization technique that extends the existing sign difference ratio (SDR) criterion. The new normalization technique counts the sign differences between the a-priori information and the extrinsic information, and then adaptively determines the corresponding normalization factor for each data block. Simulations comparing the new technique with other well-known normalization techniques show that the proposed normalization technique can achieve about 0.2 dB coding gain improvement on average while reducing up to about 1/2 iteration for decoding.
Virach SORNLERTLAMVANICH Thatsanee CHAROENPORN Shisanu TONGCHIM Canasai KRUENGKRAI Hitoshi ISAHARA
Several approaches have been studied to cope with the exceptional features of non-segmented languages. When there is no explicit information about the boundary of a word, segmenting an input text is a formidable task in language processing. Not only the contemporary word list, but also usages of the words have to be maintained to cover the use in the current texts. The accuracy and efficiency in higher processing do heavily rely on this word boundary identification task. In this paper, we introduce some statistical based approaches to tackle the problem due to the ambiguity in word segmentation. The word boundary identification problem is then defined as a part of others for performing the unified language processing in total. To exhibit the ability in conducting the unified language processing, we selectively study the tasks of language identification, word extraction, and dictionary-less search engine.
Yuichi OHSITA Shingo ATA Masayuki MURATA
Distributed denial-of-service attacks on public servers have recently become more serious. The most effective way to prevent this type of traffic is to identify the attack nodes and detach (or block) attack nodes at their egress routers. However, existing traceback mechanisms are currently not widely used for several reasons, such as the necessity of replacement of many routers to support traceback capability, or difficulties in distinguishing between attacks and legitimate traffic. In this paper, we propose a new scheme that enables a traceback from a victim to the attack nodes. More specifically, we identify the egress routers that attack nodes are connecting to by estimating the traffic matrix between arbitral source-destination edge pairs. By monitoring the traffic variations obtained by the traffic matrix, we identify the edge routers that are forwarding the attack traffic, which have a sharp traffic increase to the victim. We also evaluate the effectiveness of our proposed scheme through simulation, and show that our method can identify attack sources accurately.
Previously Verifier-Local Revocation (VLR) group signature schemes from bilinear maps were proposed. In VLR schemes, only verifiers are involved in the revocation of a member, while signers are not. Thus, the VLR schemes are suitable for mobile environments. Furthermore, the previously proposed schemes satisfy the important backward unlinkability. This means that even after a member is revoked, signatures produced by the member before the revocation remain anonymous. This property is needed in case of a voluntary leave of a member or in case of a key loss. However, in the previous schemes, signatures become long, due to the adopted assumption, which should be improved in order to apply the schemes to the mobile environments. In this paper an improved VLR scheme is proposed with the shorter group signatures. This is achieved by using a different assumption, DLDH assumption, and improving zero-knowledge proofs in the group signatures. The length of the proposed group signatures is reduced to about 53% of that of the previous ones.
Takashi NOSE Junichi YAMAGISHI Takashi MASUKO Takao KOBAYASHI
This paper describes a technique for controlling the degree of expressivity of a desired emotional expression and/or speaking style of synthesized speech in an HMM-based speech synthesis framework. With this technique, multiple emotional expressions and speaking styles of speech are modeled in a single model by using a multiple-regression hidden semi-Markov model (MRHSMM). A set of control parameters, called the style vector, is defined, and each speech synthesis unit is modeled by using the MRHSMM, in which mean parameters of the state output and duration distributions are expressed by multiple-regression of the style vector. In the synthesis stage, the mean parameters of the synthesis units are modified by transforming an arbitrarily given style vector that corresponds to a point in a low-dimensional space, called style space, each of whose coordinates represents a certain specific speaking style or emotion of speech. The results of subjective evaluation tests show that style and its intensity can be controlled by changing the style vector.
Hiroshi IWAI Tsutomu SAKATA Atsushi YAMAMOTO Kei SAKAGUCHI
This paper presents an investigation of radio-wave propagation characteristics in the 5 GHz band in a residential two-story house. We investigated the 3-D angular spectra of incident waves when a transmitter and a receiver were situated on the first and second floors, respectively. First of all, correlation in the measured "home environment" containing furniture such as beds, a sofa and tables was determined to confirm a quasi-static environment. Then, 3-D angular spectra measurements were performed by using an eight-element Yagi-Uda antenna as a receiving antenna. Furthermore, the 4-by-4 MIMO channel capacity at each elevation angle was estimated by using elevation angular spectra and the propagation characteristics between the first and second floors were evaluated. The results indicated that the channel capacity in the elevation direction was strongly influenced by the direction of the transmitting antenna.
Liangwei GE Song CHEN Kazutoshi WAKABAYASHI Takashi TAKENAKA Takeshi YOSHIMURA
Scheduling, an essential step in high-level synthesis, is an intractable process. Traditional heuristic scheduling methods usually search schedules directly in the entire solution space. In this paper, we propose the idea of searching within an intermediate solution space (ISS). We put forward a max-flow scheduling method that heuristically prunes the solution space into a specific ISS and finds the optimum of ISS in polynomial time. The proposed scheduling algorithm has some unique features, such as the correction of previous scheduling decisions in a later stage, the simultaneous scheduling of all the operations, and the optimization of more complicated objectives. Aided by the max-flow scheduling method, we implement the optimization of the IC power-ground integrity problem at the behavior level conveniently. Experiments on well-known benchmarks show that without requiring additional resources or prolonging schedule latency, the proposed scheduling method can find a schedule that draws current more stably from a supply, which mitigates the voltage fluctuation in the on-chip power distribution network.