In this paper, an area efficient VLSI architecture of decision feedback equalizer is derived accommodating 64/256 QAM modulators. This architecture is implemented efficiently in VLSI structure using EDA tools due to its regular structure. The method is to employ a time-multiplexed design scheme, so-called Folding, which executes multiple operation on a single functional unit. In addition, we define a new folding set by grouping the adjacent filter taps with data transfer having the same processing sequence between blocks and perform the internal data-bit optimization. By doing so, the computational complexity is reduced by performance optimization and also silicon area is reduced by using a shared operator. Moreover, through the performance and convergence time comparison of the various LMS (e.g. LMS, data signed LMS, error signed LMS, signed-signed LMS) ) coefficient updating algorithms, we identify an optimum LMS algorithm scheme suitable for the low complexity, high performance and high order (64 and 256) QAM applications for the presented Fractionally Spaced Decision Feedback Equalizer. We simulated the proposed design scheme using SYNOPSYSTM and SPWTM.

This paper presents a new technique to implement a convolutional codec in VLSI. The code is used in the Trellis Code Modulation. The technique aims to reduce hardware complexity and increase throughput to decode the convolutional code using Viterbi algorithm. To simplify decoding algorithm and calculation, branch cost distances are pre-calculated and stored in a Distance Look Up Table (DLUT). By using the DLUT to get each branch cost in the algorithm, the hardware implementation of the algorithm does not require any calculation circuits. Furthermore, based on the trellis diagram, an Output Look-Up-Table (OLUT) is also constructed for decoding output generation. This table reduces the amount of storage in the algorithm. The use of look-up tables reduces hardware complexity and increases throughput of the decoder. Using this technique, a 16-states, radix-4 TCM codec with 2-D and 4-D was designed and implemented in both FPGA and ASIC after mathematically simulated. The tested ASIC has a core area of 1.1 mm2 in 0.18 µm CMOS technology and yields a decoding speed over 500 Mbps. Implementation results have shown that LUT can be used to decrease hardware requirement and to increase decoding speed. The designed codec can be used as an IP core to be integrated into system-on-chip applications and the technique can be explored to use to decode the turbo code.

In this paper, first, we consider how to illustrate the effect of background noise to the measurement of room acoustics under a background noise of arbitrary distribution type. Two kinds of estimation methods are proposed to evaluate a proper reverberation time of a room by observing real unrefined decay curves, which can not realize smoothly a sufficient decay of 60 dB in a low frequency region, especially under a contamination of background noise. In the first method, an observation equation is derived from a stochastic model by means of well-known Sabine's differential equation, which is approximately rewritten in a matched form of difference equation especially to preserve its original physical meaning and functional linearity on the reverberation parameter. The effect of background noise is eliminated by employing a generalized state estimation algorithm based on Bayes' theorem. In the second one, after reflecting the effect of background noise in an observation equation of measuring model, a well-known mutual information criterion is introduced to estimate a reverberation time especially based on the basic property of statistical independency between signal and background noise. Finally, the effectiveness of the proposed methods are experimentally confirmed too by applying it to the actual measurement of a reverberation time in the actual living situation of room contaminated by a background noise. The proposed methods are, however, some technique using actively the higher order correlation beyond a linear one, and so they are methodology-trials which should coexist with other techniques.

This paper presents a cost-effective CORDIC-based architecture for adaptive lattice filters. An implementation method for an ARMA lattice filter using the CORDIC algorithm has been proposed. The previously proposed method can provide a simple filter architecture; however, it has problems such as redundant structure and numerical inaccuracy. Therefore, by solving each problem we derive a new non-redundant filter architecture with improved numerical accuracy. The obtained filter architecture provides a low cost ARMA lattice filter in which high-precision data processing is feasible. In addition, the proposed architecture can be applied to AR-type lattice filters, so that it may have several applications in adaptive signal processing. The presented filter architecture is useful from a hardware point of view because it facilitates an effective VLSI design of various adaptive lattice filters.

To realize the hardware object which facilitates the application development in the reconfigurable computing system, a hardware module (HwModule) is proposed and implemented. To access the circuit in the HwModule from the standard PC without detailed knowledge of the hardware, an object manager (ObjectManager) is also implemented. With the help of the ObjectManager, the programmers can use the hardware objects like the usual software objects. The HwModule is applied to the image matching, and the easiness of the application development for the HwModule is confirmed.

Photonic Internet Lab. (PIL) is shooting for the leading edge photonic-GMPLS (Generalized Multi-protocol Label Switching) that utilizes wide-band, cost-effective photonic technology to implement IP-centric managed networks. PIL is a consortium for researching the GMPLS protocol and advancing a de facto standard in this area. Members make leading edge GMPLS code modules and test them at the lab site. The experimental results, new ideas, and protocols are contributed to standardization bodies such as IETF and OIF. This paper also describes the world's first trial of GMPLS multi-region (multi-layer), multi-route, multi-vender signaling.

Artificial electromagnetic structures have significantly broadened the range of wave propagation phenomena available. In particular, it has been shown that metamaterials can be constructed for which the index-of-refraction is negative over a finite band of frequencies. In this paper, we present the design, fabrication and characterization of a metamaterial that exhibits negative refraction. The metamaterial design we explore is anisotropic in the plane of propagation. Based on our analysis and supporting simulations and measurements, we demonstrate that for the geometry considered, the anisotropic metamaterial has the identical negative refraction properties as would an isotropic negative index metamaterial.

Low-loss optical coupling structures between photonic crystal waveguides and channel waveguides were investigated. It was emphasized that impedance matching of guided modes of those waveguides, as well as field-profile matching, was essential to achieving the low-loss optical coupling. We developed an impedance matching theory for Bloch waves, and applied it to designing the low-loss optical coupling structures. It was demonstrated that the optical coupling loss between a photonic crystal waveguide and a Si-channel waveguide was reduced to as low as 0.7 dB by introducing an interface structure for impedance matching between the two waveguides.

There exists a class of nonlinear systems which fail to have a well-defined relative degree but have a robust relative degree. We have removed the full relative degree assumption which the previous results required, and have provided a local state observer for nonlinear systems that have robust relative degree γ n and have detectability property in some sense. The proposed observer utilizes the coordinate change which transforms the system into an approximate normal form. Using the proposed method, we constructed an observer for the ball and beam system on a vibrating frame. Simulation results reveal that substantial improvement in the performance is achieved compared with other local observers.

Measuring and modeling network traffic is of key importance for the traffic engineering of IP networks, due to the growing diversity of multimedia applications and the need to efficiently support QoS differentiation in the network. Several recent measurements have shown that Internet traffic may incorporate long-range dependence and self-similar characteristics, which can have significant impact on network performance. Self-similar traffic shows variability over many time scales, and this behavior must be taken into account for accurate prediction of network performance. In this paper, we propose a new parameter fitting procedure for a superposition of Markov Modulated Poisson Processes (MMPPs), which is able to capture self-similarity over a range of time scales. The fitting procedure matches the complete distribution of the arrival process at each time scale of interest. We evaluate the procedure by comparing the Hurst parameter, the probability mass function at each time scale, and the queuing behavior (as assessed by the loss probability and average waiting time), corresponding to measured traffic traces and to traces synthesized according to the proposed model. We consider three measured traffic traces, all exhibiting self-similar behavior: the well-known pOct Bellcore trace, a trace of aggregated IP WAN traffic, and a trace corresponding to the popular file sharing application Kazaa. Our results show that the proposed fitting procedure is able to match closely the distribution over the time scales present in data, leading to an accurate prediction of the queuing behavior.

We discuss photonic crystals (PhCs) with advanced micro/nano-structres which are semiconductor quantum dots (QDs) and micro electro-mechanical systems (MEMS) for the purpose of realizing novel classes of PhC devices in future photonic network system. After brief introduction on advantages to implement QDs and MEMS with PhCs, we discuss optical characterization of PhC microcavity containing self-assembled InAs QDs. Modification of emission spectrum of a QD ensemble due to the resonant cavity modes is demonstrated. We also point out the feasibility of low-threshold PhC lasers with QD active media in numerical analysis. A very low threshold current of 10 µA is numerically obtained for lasing action in the multi dimensional distributed feedback mode by using realistic material parameters. Then, the basic concept for MEMS-controlled PhC slab devices is described. We show numerical results that demonstrate some of interesting functions such as the intensity modulation and the tuning of resonant frequency of cavity mode. Finally, a preliminary experiment of MEMS-based switching operation in a PhC line-defect waveguide is demonstrated.

As semiconductor manufacturing technology advances, power dissipation and noise in scan testing have become critical problems. Our studies on practical LSI manufacturing show that power supply voltage drop causes testing problems during shift operations in scan testing. In this paper, we present a new testing method named MD-SCAN (Multi-Duty SCAN) which solves power supply voltage drop problems, as well as its experimental results applied to practical LSI chips.

This paper presents an algorithm for fingerprint matching using the Phase-Only Correlation (POC) function. One of the most difficult problems in human identification by fingerprints has been that the matching performance is significantly influenced by fingertip surface condition, which may vary depending on environmental or personal causes. This paper proposes a new fingerprint matching algorithm using phase spectra of fingerprint images. The proposed algorithm is highly robust against fingerprint image degradation due to inadequate fingertip conditions. A set of experiments is carried out using fingerprint images captured by a pressure sensitive fingerprint sensor. The proposed algorithm exhibits efficient identification performance even for difficult fingerprint images that could not be identified by the conventional matching algorithms.

We propose two new adaptive minimum symbol error rate algorithms based on biased and unbiased decision rule respectively for M-ary PAM equalizer systems. The proposed algorithms can be processed either on-line or off-line depending on the availability of the information on channel impulse response. Comparisons are made between our algorithms with other existing algorithms. Computer simulations are performed to present performance results and some important algorithm properties including the effect of varying equalizer length and SNR values.

The new Internet has to provide the Quality of Services to converged multimedia services, in which each one may choose its own requirements. Managing such a dynamic network is not an easy task. A more intelligent and adaptive behavior is required from network management. We argue that agents are able to realize this task by dynamically adapting management mechanisms to the current network conditions. This article presents a Behavioral Multi-Agent-based model for QoS-enabled Internet. Based on this behavioral approach, we analyze network management mechanisms (or "elementary behaviors") in terms of performance and applicability profile. We use simulation to observe services performances when submitted to diverse QoS management elementary behaviors.

Interval arithmetic is able to be applied when we include the ranges of various functions. When we include them applying the interval arithmetic, the serious problem that the widths of the range inclusions increase extremely exists. In range inclusion of polynomials particularly, Horner's method and Alefeld's method are well known as the conventional methods which mitigates this problem. The purpose of this paper is to propose the new methods which are able to mitigate this problem more efficiently than the conventional methods. And in this paper, we show and compare the efficiencies of the new methods by some numerical examples.

This paper proposes an SoC test architecture generation framework. It contains a database, which stores the test cost information of several DFTs for every core, and a DFT selection part which performs DFT selection for minimizing the test application time using this database in the early phase of the design flow. Moreover, the DFT selection problem is formulated and the algorithm that solves this problem is proposed. Experimental results show that bottlenecks in test application time when using a single DFT method for all cores in an SoC is reduced by performing DFT selection from two types of DFTs. As a result, the whole test application time is drastically shortened.

This paper describes a comprehensive simulation and test environment for prototype LSI verification. We develop a Perl package, ST, for simulation & test of digital circuits. A designer can describe a testbench with the Perl syntax, which can be converted to various kinds of simulators and LSI testers. Parameters such as a target simulator/tester, cycle time and voltage levels can be changed very easily just modifying arguments of subroutines. We also develop DUT boards which consist of a tester-dependent mother board and a package-dependent daughter board. Using ST and the DUT boards, a designer can start verification just after getting fabricated LSIs.

Among several methods of storing XML documents, a straightforward yet efficient method is to store a string representation of the XML document. An XML node is usually represented by a region coordinate, which is a pair of integers expressing the start and end positions of the substring corresponding to the node. This approach, however, has the drawback that a change of a node's region coordinate causes change of the region coordinates of many other elements. This recomputation normally degrades the performance of XML applications, especially when content is updated frequently. In this paper, we propose the Relative Region Coordinate (RRC) technique to effectively reduce the cost of recomputation. The main idea is to express the coordinate of an XML element in the region of its parent element. We present a method to integrate the RRC information into XML systems and provide experimental results that demonstrate the effectiveness of the RRC in the content update.

We propose a new orthogonal frequency division multiplexing transmission scheme using orthogonal code multiplexing. This scheme makes all modulation symbols have the same reliability even in a frequency selective fading channel, through a distributed transmission of each symbol over the whole effective subcarriers using a distinct orthogonal code. As an appropriate set of orthogonal multiplexing codes, we use the set of discrete Fourier transform code sequences that hold the orthogonality irrespective of the length. Using this set, we also can greatly reduce the peak-to-average-power ratio (PAR) of the resulting signal. Simulation results show that the proposed scheme can significantly reduce the required signal-to-noise ratio at a given bit error rate over the existing schemes. The scheme can maintain the PAR within a reasonable range of about 6 dB even up to 512 subcarriers and works well even with PAR clipping of 1.5 dB.