Hideaki TAMORI Naofumi AOKI Tsuyoshi YAMAMOTO
This paper suggests that a watermarking technique based on the number theoretic transform (NTT) may effectively be employed for detecting alterations on lossless digital master images. Due to its fragility, the NTT-based technique is sensitive to detecting alterations, compared with that based on the discrete Fourier transform (DFT).
Masatoshi HAMADA Fumiyuki ADACHI
A hybrid data transmission technique for multimedia satellite broadcasting is proposed. The main-channel data and sub-channel data are simultaneously transmitted using QPSK modulation and 2ASK modulation, respectively, but the latter modulation timing is offset by half the main-channel QPSK symbol length in time. The BER performance in a Gaussian channel, the transmission bandwidth, and the transmit power peak factor are theoretically analyzed for various impulse responses of the sub-channel transmit filter. It is found that the use of the sub-channel transmit filter having a sine impulse response minimizes the sub-channel BER while keeping the transmission bandwidth and the transmit power peak factor lower than those of CAPSK transmission.
Hedia KOCHKAR Takeshi IKENAGA Yuji OIE
Most of the QoS-based routing schemes proposed so far focus on improving the performance of individual service classes. In a multi-class network where high priority QoS traffic coexists with best-effort traffic, routing decision for QoS sessions will have an effect on lower ones. A mechanism that allows dynamic sharing of link resources among multiple classes of traffic is needed. In this paper we propose a multi-class routing algorithm based on inter-class sharing resources among multiple class of traffic. Our algorithm is based on the concept of "the virtual residual bandwidth," which is derived from the real residual bandwidth. The virtual residual bandwidth is greater than the residual bandwidth when the load of lower priority traffic is light, and smaller when the load of lower priority traffic is heavy. The idea of our approach is simple since the routing algorithm for individual traffic doesn't change, but the only change is the definition of the link cost. We demonstrate through some extensive simulations the effectiveness of our approach when the best effort distribution is uneven and when its load is heavy. Also better performance is noticed when using topology with large number of alternative paths.
Yasushi YUMINAKA Shinya SAKAMOTO
This paper investigates multiple-valued code-division multiple access (MV-CDMA) techniques and circuits for intra/inter-chip communication to achieve efficient data transmission in VLSI systems. To address the problems caused by interconnection complexity, we transmit multiplexed signals inside LSI systems employing pseudo-random orthogonal m-sequences as information carriers. A new class of multiple-valued CDMA techniques for intra-chip communication is discussed to demonstrate the feasibility of eliminating co-channel interference caused by a propagation delay of signals, e.g., clock skew. This paper describes the circuit configuration and performance evaluation of MV-CDMA systems for intra-chip communication. We first explain the principle of MV-CDMA technique, and then propose a bidirectional current-mode CMOS technique to realize compact correlation circuits for CDMA. Finally, we show the Spice and MATLAB simulation results of MV-CDMA systems, which indicate the excellent capabilities of eliminating co-channel interference.
Woo-Chan PARK Cheol-Ho JEONG Tack-Don HAN
The format conversion operations between a floating-point number and an integer number and a round operation are the important standard floating-point operations. In most cases, these operations are implemented by adding additional hardware to the floating-point adder. The SR (simultaneous rounding) method, one of the techniques used to improve the performance of the floating-point adder, can perform addition and rounding operations at the same stage and is an efficient method with respect to the silicon area and its performance. In this paper, a hardware model to execute CRops (conversion and rounding operations) for the SR floating-point adder is presented and CRops are analyzed on the proposed hardware model. Implementation details are also discussed. The proposed scheme can maintain the advantages of the SR method and can perform each CRop with three pipeline stages.
Shigeru YAMAMOTO Toshimitsu USHIO
In this paper, we present new stability conditions for a class of large-scale hybrid dynamical systems composed of a number of interconnected hybrid subsystems. The stability conditions are given in terms of discontinuous Lyapunov functions of the stable hybrid subsystems. Furthermore, the stability conditions are represented by LMIs (Linear Matrix Inequalities) which are computationally tractable.
This paper investigates the stochastic property of packet destinations in order to describe Internet access patterns. If we assume a sort of stationary condition for the address generation process, the process is an LRU stack model. Although the LRU stack model gives appropriate descriptions of address generation on a medium/long time-scale, address sequences generated from the LRU stack model do not reproduce Zipf-type distributions, which appear frequently in Internet access patterns. This implies that the address generation behavior on a short time-scale has a strong influence on the shape of the distributions that describe frequency of address appearances. This paper proposes an address generation algorithm that does not meet the stationary condition on the short time-scale, but restores it on the medium/long time-scale, and shows that the proposed algorithm reproduces Zipf-type distributions.
Caching of frequently accessed data has been shown to be a useful technique for reducing congestion on the narrow bandwidth of wireless channels. However, traditional client/server strategies for supporting transactional cache consistency, which require extensive communications between a client and a server, are not appropriate in a wireless mobile database. This paper proposes two, simple but effective, transactional cache consistency protocols for mobile read-only transactions by utilizing the broadcast-based solutions for the problem of invalidating caches. The novelty of our approach is that the consistency check on accessed data and the commitment protocol are implemented in a truly distributed fashion as an integral part of cache invalidation process. The applicability of proposed techniques is also examined by an analytical study.
Shinichi NOMOTO Yoshihiko MIZUGUCHI
Since the penetration of VSAT services is rapidly increasing, more earth stations will operate around airports than is currently true. This makes it essential to evaluate accurately and efficiently the impairment of received signals due to blockage by aircraft. This paper proposes developing an aircraft model using a thin, planar polygon to represent the aircraft projection and to apply GTD with corner diffraction terms. The effectiveness and applicability of the method is then examined numerically. It is demonstrated that the results measured in the Ku-band around two airports are a good match with the numerical simulations even when the distance between the aircraft and the stations is small.
In this letter a low-complexity and low-power realization of the 2D discrete-cosine-transform and its inverse (DCT/IDCT) is presented. A VLSI circuit based on the Chen algorithm with the distributed arithmetic approach is described. Furthermore low-power design techniques, based on clock gating and data driven switching activity reduction, are used to decrease the circuit power consumption. To this aim, input signal statistics have been extracted from H.263/MPEG verification models. Finally, circuit performance is compared to known software solutions and dedicated full-custom ones.
Katsutoshi OHTSUKI Tatsuo MATSUOKA Shoichi MATSUNAGA Sadaoki FURUI
In this paper, we propose topic extraction models based on statistical relevance scores between topic words and words in articles, and report results obtained in topic extraction experiments using continuous speech recognition for Japanese broadcast news utterances. We attempt to represent a topic of news speech using a combination of multiple topic words, which are important words in the news article or words relevant to the news. We assume a topic of news is represented by a combination of words. We statistically model mapping from words in an article to topic words. Using the mapping, the topic extraction model can extract topic words even if they do not appear in the article. We train a topic extraction model capable of computing the degree of relevance between a topic word and a word in an article by using newspaper text covering a five-year period. The degree of relevance between those words is calculated based on measures such as mutual information or the χ2-method. In experiments extracting five topic words using a χ2-based model, we achieve 72% precision and 12% recall for speech recognition results. Speech recognition results generally include a number of recognition errors, which degrades topic extraction performance. To avoid this, we employ N-best candidates and likelihood given by acoustic and language models. In experiments, we find that extracting five topic words using N-best candidate and likelihood values achieves significantly improved precision.
Riwu JIN Shinji SUGAWARA Tetsuya MIKI Nobuo NAKAJIMA
In this paper, we propose an efficient algorithm of quick routing for private Wireless ATM (Asynchronous Transfer Mode) networks. This algorithm uses hierarchical source routing, which first establishes a connection between the sending node and the home node (which has the terminal location information), and then, partially releases the connection and reroutes it between the sending node and the receiving node. This results in less delay than found in other conventional routing methods, and avoids passing through congested nodes, because this algorithm uses traffic estimation based on queuing theory. We also show the effectiveness of this algorithm with the use of computer simulations.
A plane drawing of a graph is called a floorplan if every face (including the outer face) is a rectangle. A based floorplan is a floorplan with a designated base line segment on the outer face. In this paper we give a simple algorithm to generate all based floorplans with at most n faces. The algorithm uses O(n) space and generates such floorplans in O(1) time per floorplan without duplications. The algorithm does not output entire floorplans but the difference from the previous floorplan. By modifying the algorithm we can generate without duplications all based floorplans having exactly n faces in O(1) time per floorplan. Also we can generate without duplications all (non-based) floorplans having exactly n faces in O(n) time per floorplan.
Kazuhiko KINOSHITA Tomokazu MASUDA Keita KAWANO Hideaki TANIOKA Tetsuya TAKINE Koso MURAKAMI
To diffuse multimedia information services, communication networks must guarantee the quality of services (QoSs) requested by users. In addition, users should be allowed to observe the network in order to customize their own services. A new network management architecture is therefore essential. It must perceive not only node connectivity, but also network failure points and the traffic situation dynamically. This paper introduces the network map as such an architecture on personalized multimedia communication networks and proposes multiple QoS routing using the network map. Moreover, a prototype system is built in order to verify the availability of the network map.
Hyochang NAM Jong KIM Sung Je HONG Sunggu LEE
For checkpointing to be practical, it has to introduce low overhead for the targeted application. As a means of reducing the overhead of checkpointing, this paper proposes a probabilistic checkpointing method, which uses block encoding to detect the modified memory area between two consecutive checkpoints. Since the proposed technique uses block encoding to detect the modified area, the possibility of aliasing exists in encoded words. However, this paper shows that the aliasing probability is near zero when an 8-byte encoded word is used. The performance of the proposed technique is analyzed and measured by using experiments. An analytic model which predicts the checkpointing overhead is first constructed. By using this model, the block size that produces the best performance for a given target program is estimated. In most cases, medium block sizes, i.e., 128 or 256 bytes, show the best performance. The proposed technique has also been implemented on Unix based systems, and its performance has been measured in real environments. According to the experimental results, the proposed technique reduces the overhead by 11.7% in the best case and increases the overhead by 0.5% in the worst case in comparison with page-based incremental checkpointing.
Jianqing WANG Kohji SASABE Osamu FUJIWARA
Common-mode (CM) radiation from a cable attached to a conducting enclosure has a typical dipole-type antenna structure, in which an equivalent noise voltage source located at the connector excites the attached cable against the enclosure to produce radiated emissions. Based on this mechanism, a simple method for predicting the CM radiation from the cable/enclosure structure was proposed. The method combines an equivalent dipole approximation with sinusoidal current distribution and CM current measurement at a specified location on the cable. Its validity was examined in comparison with the far-field measurement and finite-difference time-domain (FDTD) modeling. The predicted resonance frequencies and CM radiation levels were validated with engineering accuracy, i.e., within 30 MHz and 6 dB, respectively, from the measured and FDTD-modeled results in the frequencies above 150 MHz.
This paper presents a new method of designing a dither matrix based on simulated annealing. An obtained dither matrix (halftone screen/mask) is appropriate for press printing. Because of several physical reasons, halftoning for press printing is more difficult than halftoning for electronic displays, or ink-jet printers. Even if stochastic dispersed-dot screening (so-called FM-screening) is one of the best solutions for halftoning, that is not appropriate for press printing. On the other hand, classical periodic clustered-dot screening (so-called AM-screening) is more important and is widely used even now. We recognize unfavorable quality of AM-screening, but we can not ignore its productive stability in printing section. The proposed halftone dither matrix has aperiodic clustered-dot pattern, and size of cluster can be controlled by a weighting parameter of a cost function. We will obtain a dither matrix which consists of clustered-dots. Some characteristics of the design algorithm and halftoned images are investigated in detail. As a result, the fact that an obtained dither matrix is superior to AM-screen and comparable to FM-screen in visual quality, and the matrix is comparable to AM-screen and superior to FM-screen in press printability is confirmed.
Anto Satriyo NUGROHO Susumu KUROYANAGI Akira IWATA
Studies on artificial neural network have been conducted for a long time, and its contribution has been shown in many fields. However, the application of neural networks in the real world domain is still a challenge, since nature does not always provide the required satisfactory conditions. One example is the class size imbalanced condition in which one class is heavily under-represented compared to another class. This condition is often found in the real world domain and presents several difficulties for algorithms that assume the balanced condition of the classes. In this paper, we propose a method for solving problems posed by imbalanced training sets by applying the modified large-scale neural network "CombNET-II. " CombNET-II consists of two types of neural networks. The first type is a one-layer vector quantization neural network to turn the problem into a more balanced condition. The second type consists of several modules of three-layered multilayer perceptron trained by backpropagation for finer classification. CombNET-II combines the two types of neural networks to solve the problem effectively within a reasonable time. The performance is then evaluated by turning the model into a practical application for a fog forecasting problem. Fog forecasting is an imbalanced training sets problem, since the probability of fog appearance in the observation location is very low. Fog events should be predicted every 30 minutes based on the observation of meteorological conditions. Our experiments showed that CombNET-II could achieve a high prediction rate compared to the k-nearest neighbor classifier and the three-layered multilayer perceptron trained with BP. Part of this research was presented in the 1999 Fog Forecasting Contest sponsored by Neurocomputing Technical Group of IEICE, Japan, and CombNET-II achieved the highest accuracy among the participants.
Kazunari SHINBO Eigo SAKAI Futao KANEKO Keizo KATO Takahiro KAWAKAMI Toyoyasu TADOKORO Shinichi OHTA Rigoberto C. ADVINCULA
Organic light emitting diodes (OLEDs) containing nanostructured cathode buffer layers were fabricated, and their electrical and emitting properties were investigated. The OLEDs have an ITO anode/CuPc/TPD/Alq3/buffer layer/Al cathode structure with the buffer layers made from nanostructured alternating layers Alq3 and Al. The driving voltage and the efficiency of the devices were improved by insertion of the buffer layer. It was estimated that some modulations of the Schottky barrier at the Alq3 and the Al cathode interface were induced due to the insertion of the buffer layer and it caused an enhancement of electron injection from the Al cathode.
Md. Altaf-Ul-AMIN Satoshi OHTAKE Hideo FUJIWARA
This paper introduces the concept of hierarchical testability of data paths for delay faults. A definition of hierarchically two-pattern testable (HTPT) data path is developed. Also, a design for testability (DFT) method is presented to augment a data path to become an HTPT one. The DFT method incorporates a graph-based analysis of an HTPT data path and makes use of some graph algorithms. The proposed method can provide similar advantages to the enhanced scan approach at a much lower hardware overhead cost.