This study presents two new bit-parallel cellular multipliers based on an irreducible all one polynomial (AOP) over the finite field GF(2m). Using the property of the AOP, this work also presents an efficient algorithm of inner-product multiplication for computing AB2 multiplications is proposed, with a structure that can simplify the time and space complexity for hardware implementations. The first structure employs the new inner-product multiplication algorithm to construct the bit-parallel cellular architecture. The designed multiplier only requires the computational delays of (m+1)(TAND+TXOR). The second proposed structure is a modification of the first structure, and it requires (m+2) TXOR delays. Moreover, the proposed multipliers can perform A2iB2j computations by shuffling the coefficients to make i and j integers. For the computing multiplication in GF(2m), the novel multipliers turn out to be efficient as they simplify architecture and accelerate computation. The two novel architectures are highly regular, simpler, and have shorter computation delays than the conventional cellular multipliers.

Causal message ordering in the context of group communication ensures that all the message receivers observe consistent ordering of events affecting a group as a whole. This paper presents a scalable causal multicast protocol for mobile distributed computing systems. In our protocol, only a part of the mobility agents in the system is involved in group computations and the resulting size of control information in messages can be kept small. Our protocol can outperform qualitatively the counterparts in terms of communication overhead and handoff complexity. An analytical model is also developed to evaluate our proposal. The performance results show that the proposed protocol is promising.

Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is suitable for large dictionaries which improve compression ratio for large files. We also experiment on the compression ratio and the speed of block sorting compression, which uses suffix sorting in its compression algorithm. The results show that the LZ77 using the two-level hash is suitable for small dictionaries, the LZ77 using suffix sorting is good for large dictionaries when fast decompression speed and efficient use of memory are necessary, and block sorting is good for large dictionaries.

A two-dimensional algorithm, which combines the well-known Synthetic Aperture Radar (SAR) imaging and the recently developed effective inversion method, is presented and applied to a three-dimensional configuration. During the first stage a two-dimensional image of a realistic three-dimensional buried object is obtained. In the second stage the average permittivity of the object is estimated using a two-dimensional effective inversion scheme where the geometrical information retrieved from the SAR image is employed. The algorithm is applicable in real time.

This paper describes two competitive learning algorithms from the viewpoint of deleting mechanisms of weight (reference) vectors. The techniques are termed the adaptivity and sensitivity deletions participated in the criteria of partition error and distortion error, respectively. Experimental results show the effectiveness of the proposed approaches in the average distortion.

This paper presents a class of binary block codes capable of correcting single synchronization errors and single reversal errors with fewer check bits than the existing codes by 3 bits. This also shows a decoding circuit and analyzes its complexity.

This paper introduces a flexible, stream-oriented dataflow processing model based on the "Communicating Logic (CL)" framework. As the target architecture, we adopt the dual layered "Plastic Cell Architecture (PCA). " Datapath processing functionality is encapsulated in asynchronous hardware objects with variable graining and implemented using look-up tables. Communication (i.e. connectivity and control) between the distributed processing objects is achieved by means of inter-object message passing. The key point of the CL approach is that it offers the merits of scalable performance, low power hardware implementation with the user friendly compilation and linking capabilities unique to software.

This letter proposes a new detection method of human faces in gray scale image with cluttered background using a face template and elliptical structure of the human face. This proposed method can be applicable even in the cases that the face is much smaller than image size and several faces exist in one image, which is impossible in the existing one.

In this paper, we consider the coherent radar detection of rapid fluctuating signals in the Gaussian noise. This problem has been previously solved by employing the GLR technique, but we use the ALR to improve the detection performance. So, after deriving an approximate ALR detector, we compare the new detector with the GLR and Square-law detectors and we show its superiority.

Recently we have studied the performance of the VS/VD behavior for two binary feedback congestion control schemes, FECN and BECN, when they are applied to multicast ABR services. It is shown that the VS/VD schemes alleviate the problems of consolidation noise and consolidation delay, which are two major design issues in multicast congestion control. To complement, we further explore the VS/VD behavior for the explicit rate feedback control scheme in this letter. Through an efficient rate estimation method, it is again observed that VS/VD behavior performs better than the traditional end-to-end schemes.

We propose a variation of the Context Tree Weighting algorithm for tree source modified such that the growth of the context resembles Lempel-Ziv parsing. We analyze this algorithm, give a concise upper bound to the individual redundancy for any tree source, and prove the asymptotic optimality of the data compression rate for any stationary and ergodic source.

An optical spectral coding scheme is devised for fiber-optic code-division multiple-access (FO-CDMA) networks. The spectral coding is based on the pseudo-orthogonality of FO-CDMA codes properly written in the fiber Bragg grating (FBG) devices. For an incoming broadband optical signal having spectral components equal to the designed Bragg wavelengths of the FBG, the spectral components will be reflected and spectrally coded with the written FO-CDMA address codes. Each spectral chip has different central wavelength and is distributed over the spectrum of the incoming light source. Maximal-length sequence codes (m-sequence codes) are chosen as the signature or address codes to exemplify the coding and correlation processes in the FO-CDMA system. By assigning the N cycle shifts of a single m-sequence code to N users, we get an FO-CDMA network that can theoretically support N simultaneous users. To overcome the limiting factor of multiple-access interference (MAI) on the performance of the FO-CDMA network, an FBG decoder is configured on the basis of orthogonal correlation functions of the adopted pseudo-orthogonal codes. An intended receiver user that operates on the defined orthogonal correlation functions will reject any interfering user and obtain quasi-orthogonality between the FO-CDMA users in the network. Practical limiting issues on networking performance, such as non-flattened source spectra, optical path delay, and asynchronous data accesses, are evaluated in terms of the bit-error-rate versus the number of active users. As expected, the bit-error-rate will increase with the number of active users. Increasing the flatness parameter of optical signal will lead to a lower average error probability, since we are working in a part of the more flattened optical spectrum. In contrast, reducing the encoded bandwidth will reduce the total received power, and this will necessitate higher resolution of fiber Bragg gratings.

This paper describes a novel IDDQ sensor circuit that is driven by only an abnormal IDDQ. The sensor circuit has relatively high sensitivity and can operate at a low supply voltage. Based on a very simple idea, it requires two additional power supplies. It can operate at either 5-V or 3.3-V VDD with the same design. Simulation results show that it can detect a 16-µA abnormal IDDQ at 3.3-V VDD. This sensor circuit causes a smaller voltage drop and smaller performance penalty in the circuit under test than other ones.

Increasing the capacity and intelligence of the next-generation Internet requires the application of optical technologies to switching nodes as well as transmission lines, and the development of advanced network architectures with end-to-end connection setup processing at the source node and autonomous routing at intermediate nodes. In the present paper, we design a new CDM-based switching scheme and node configurations that are suitable for a photonic IP switching system, in which a set of multiple-encoding CDM codes is utilized as routing information. In addition, we calculate the BER characteristics of the multiple-encoding CDM system by simulation. Under the condition that the chip duration of a certain code is a multiple of that of another code, the BER characteristics of the multiple-encoding system are shown to coincide with that of the single-encoding system by the longer code.

This paper proposes a fault tolerant optical crossconnect (FTOXC) which can tolerate link, channel, and internal optical switch failures via spare optical channels, extra input/output (I/O) ports for an optical switch, and associated wavelength converters. It also proposes a fault tolerant wavelength routing algorithm (FTWRA) which is used in the normal and the restored state. The FTOXC and FTWRA can be applied to any all-optical network and can recover many types of failures. FTOXC can configure the number of working and spare channels in each output link based on the traffic demand. Two formulations in this paper can be used to determine the optimal settings of channels. A global optimal setting of working and spare channels in each link can be found by formulating the problem as an integer linear program (ILP). In addition, the number of working and spare channels in each link can be dynamically adjusted according to the traffic loads and the system reliability requirements. The tradeoff between these two conflicting objectives is analyzed by the Markov decision process (MDP).

The need for greater transmission capacity through optical fiber has been met so far by the wide scale deployment of wavelength division multiplexing (WDM). Still, to manage and access this bandwidth, the next growth challenge will most likely emerge at the switching nodes, where processing is needed to groom the ever diverse and changing traffic. The eventual goal is to reduce the amount of complex electronics, and thus, the cost, by migrating to the all-optical network, where data is switched and routed transparently in optical form, with a minimum amount of electronic processing. As a first step in this direction, optical cross-connects (OXCs) and optical add-drop multiplexers (OADMs) are already being introduced commercially to perform basic routing and switching functions for protection and allocation. Eventually, we envision an optical packet switched network layer that features: (i) bit rate transparency, (ii) protocol transparency, and (iii) fast switching with fine granularity. With these characteristics, an optical packet switched network layer can be a high performance and cost competitive solution for future networks. Several networking functions will be needed to deploy the all-optical transparent layer. Wavelength conversion will allow the reuse of wavelengths in the network and may help alleviate contentions. Optical synchronization and optical packet header processing (for routing and switching) will increase throughput and reduce latency. Last, but not least, all the above solutions will need to be bit rate and modulation format independent (or at least be able to handle a wide range of bit rates and modulation formats).

A sufficient condition for a code to be optimum on discrete channels with finite input and output alphabets is given, where being optimum means achieving the minimum decoding error probability. This condition is derived by generalizing the ideas of binary perfect and quasi-perfect codes, which are known to be optimum on the binary symmetric channel. An application of the sufficient condition shows that the code presented by Hamada and Fujiwara (1997) is optimum on the q-ary channel model proposed by Fuja and Heegard (1990), where q is a prime power with some restriction. The channel model is subject to two types of additive errors of (in general) different probabilities.

We propose an extraction method of personal features based on on-line handwriting information. Most recent research has been focused on signature verification, especially in the field of on-line writer verification. However, signature verification has a serious problem in that it will accept forged handwriting. To solve this problem, we have introduced an on-line writer verification method which uses ordinary characters. In this method, any handwritten characters (i.e., ordinary characters) are accepted as a text in the verification process, and the text used in the verification process can be different from that in the enrollment process. However, in the proposed method, personal features are extracted only from the shape of strokes, and it is still uncertain how efficient other on-line information, such as writing pressure or pen inclination, is for extracting personal features. Therefore, we propose an extraction method of personal features based on on-line handwriting information, including writing-pressure and pen-inclination information. In the proposed method, handwriting information is described by a set of three-dimensional curves, and personal features are described by a set of Fourier descriptors for the three-dimensional curves. We also discuss the reliability of the proposed method with some simulation results using handwritten data. From these simulation results, it is clear that the proposed method effectively extracts personal features from ordinary characters.

By using full-color light emitting diode (LED) panel, we have been studying a stereoscopic full-color large television in broad daylight. In order to implement stereoscopic large display for the general public, optimum parameters of display elements and parallax barrier and viewing areas of stereoscopic display using parallax barrier are discussed. Although stereoscopic display with parallax barrier permits the viewer to view stereoscopic images without any special glasses, its viewing area is restricted by crosstalk and disappearing of pixels. Enlarged viewing areas, which are derived from the small ratio of light emitting region to pixel and a proper aperture ratio of parallax barrier, are analyzed. A model of a viewer standing toward the display is proposed because the viewer apart from the horizontal center of the display turns to the center point of LED display and this turning causes a deviation of viewer's eye position. Then, the allowable number of viewing locations is derived on "no crosstalk" and "no disappearance" conditions. The optimum aperture ratio of parallax barrier and the width of light emitting region is obtained through the optimization. The viewing area obtained from the analysis is confirmed by experiments using full-color LED panel. Relations between viewing area and the moire fringes is also discussed. The depth of the viewing area agrees the viewing distance where no moire fringe appears. Furthermore, possibility of display for the crowds is discussed.

This paper describes how to generate, analyze and design a novel current-mode filter model using tunable multiple-output operational transconductance amplifiers and grounded capacitors (MO-OTA-Cs) for synthesizing both transmission poles and zeros. Transfer functions of low-order, high-order, general type, and special type are realized based on the filter model. The theory focuses mainly on establishing a relationship between the cascaded MO-OTA-Cs and the multiple-loop feedback matrix, which makes the structural generation and design formulas. Adopting the theory allows us to systematically generate many interesting new configurations along with some known structures. All the filter architectures contain only grounded capacitors, which can absorb parasitic capacitances and require smaller chip areas than floating ones. The paper also presents numerical design examples and simulation results to confirm the theoretical analysis.