This paper investigates the fixed-rate and fixed-distortion lossy coding problems of individual sequences subject to the subadditive distortion measure. The fixed-rate and fixed-distortion universal lossy coding schemes based on the complexity of the sequence are proposed. The obtained coding theorems reveal that the optimal distortion (resp. rate) attainable by the fixed-rate (resp. fixed-distortion) lossy coding is equal to the optimal average distortion (resp. rate) with respect to the overlapping empirical distribution of the given sequence. Some connections with the lossy coding problem of ergodic sources are also investigated.

We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem and the associated KCR lower bound. Then, we describe the algorithms of three well-known methods: FNS, HEIV, and renormalization. We also introduce Gauss-Newton iterations as a new method for fundamental matrix computation. For initial values, we test random choice, least squares, and Taubin's method. Experiments using simulated and real images reveal different characteristics of each method. Overall, FNS exhibits the best convergence properties.

In D.O.A. estimation, identification of the signal and the noise subspaces plays an essential role. This identification process was traditionally achieved by the eigenvalue decomposition (EVD) of the spatial correlation matrix of observations or the generalized eigenvalue decomposition (GEVD) of the spatial correlation matrix of observations with respect to that of an observation noise. The framework based on the GEVD is not always an extension of that based on the EVD, since the GEVD is not applicable to the noise-free case which can be resolved by the framework based on the EVD. Moreover, they are not applicable to the case in which the spatial correlation matrix of the noise is singular. Recently, a quotient-singular-value-decomposition-based framework, that can be applied to problems with singular noise correlation matrices, is introduced for noise reduction. However, this framework also can not treat the noise-free case. Thus, we do not have a unified framework of the identification of these subspaces. In this paper, we show that a unified framework of the identification of these subspaces is realized by the concept of proper and improper eigenspaces of the spatial correlation matrix of the noise with respect to that of observations.

This paper presents a fast transient simulation method for power distribution networks (PDNs) of the PCB/Package. Because these PDNs are modeled as large-scale linear circuits consisting of a large number of RLC elements, it takes large costs to solve by conventional circuit simulators, such as SPICE. Our simulation method is based on the leapfrog algorithm, and can solve RLC circuits of PDNs faster than SPICE. Actual PDNs have frequency-dependent dispersions such as the skin-effect of conductors and the dielectric loss. To model these dispersions, more number of RLC elements are required, and circuit structures of these dispersion models are hard to solve by using the leapfrog algorithm. This paper shows that the circuit structures of dispersion models can be converted to suitable structures for the leapfrog algorithm. Further, in order to reduce the simulation time, our proposed method exploits parallel computation techniques. Numerical results show that our proposed method using single processing element (PE) enables a speedup of 20-100 times and 10 times compared to HSPICE and INDUCTWISE with the same level of accuracy, respectively. In a large-scale example with frequency-dependent dispersions, our method achieves over 94% parallel efficiency with 5PEs.

In this paper, we address the problem of the rotation-invariant texture analysis. For this purpose, we first present a modified version of the discrete Radon transform whose performance, including accuracy and processing time, is significantly better than the conventional transform in direction estimation and categorization of textural images. We then utilize this transform with a rotated version of Gabor filters to propose a new scheme for texture classification. Experimental results on a set of images from the Brodatz album indicate that the proposed scheme outperforms previous works.

A novel configuration method called Row Multicast Configuration (RoMultiC) is proposed for high speed configuration of coarse grain reconfigurable systems. The same configuration data can be transferred in multicast fashion to configure many Processing Elements (PEs) by using a multicast bit-map provided in row and column directions of PE array. Evaluation results using practical applications show that a model reconfigurable system that incorporates this scheme can reduce configuration clock cycles by up to 73.1% compared with traditional configuration delivery scheme. Amount of required memory to store the configuration data at external memory is also reduced by omitting the duplicated configuration data.

In this letter, we study the blocking probabilities in an asynchronous optical packet/burst switching system with full wavelength conversion. Most of the existing work use Poisson traffic models that is well-suited for an infinite population of users. In this letter, the optical packet traffic arriving at the switching system is modeled through a superposition of a finite number of identical on-off sources. We propose a block tridiagonal LU factorization algorithm to efficiently solve the two dimensional Markov chain that arises in the modeling of the switching system.

When Simulated Annealing (SA) is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. Many experiments are necessary to determine an appropriate neighborhood range in each problem, because the neighborhood range corresponds to distance in Euclidean space and is decided arbitrarily. We propose Multi-point Simulated Annealing with Adaptive Neighborhood (MSA/AN) for continuous optimization problems, which determine the appropriate neighborhood range automatically. The proposed method provides a neighborhood range from the distance and the design variables of two search points, and generates candidate solutions using a probability distribution based on this distance in the neighborhood, and selects the next solutions from them based on the energy. In addition, a new acceptance judgment is proposed for multi-point SA based on the Metropolis criterion. The proposed method shows good performance in solving typical test problems.

We introduce an adaptive subchannel, bit, and power allocation (ASBPA) algorithm to maximize the bandwidth efficiency of the mobile communication system that use orthogonal frequency division multiplexing (OFDM). We propose a suboptimal rate adaptive ASBPA algorithm that guarantees fairness in resource allocation and overcomes inherent co-channel interference (CCI) in the cellular system. Furthermore, we evaluate the maximum possible bandwidth efficiency of the cellular OFDM system achieved by the ASBPA algorithm which is practical to implement. Our simulation results show that the proposed algorithm outperforms the existing ones and achieves the cellular bandwidth efficiency of up to 5 b/s/Hz/cell. We also investigate some of the conditions that govern the bandwidth efficiency of the cellular OFDM system using the proposed ASBPA algorithm.

This paper examines a system which is inspected at equally spaced points in time. We express the observed states of the system as a discrete time Markov chain with an absorbing state. It is assumed that the true state is certainly identified through inspection. After each inspection, one of three actions can be taken: Operation, repair, or replacement. We assume that the result of repair is uncertain. If repair is taken, we decide whether to inspect the system or not. When inspection is performed after completion of repair, we select an optimal action. After replacement, the system becomes new. We study the optimal maintenance policy which minimizes the expected total discounted cost for unbounded horizon. It is shown that, under reasonable conditions on the system's deterioration and repair laws and the cost structures, a control limit policy is optimal. We derive several valid properties for finding the optimal maintenance policy numerically. Furthermore, numerical analysis is conducted to show our theoretical results could hold under weaker conditions.

A sub-optimal practical computationally efficient transmit power allocation algorithm is proposed under the constraints of data rate and max bit error rate (BER) in OFDM systems. By exploiting the relation between the water-filling level and the data rate, the proposed algorithm derives an efficient adaptive coarse searching method for water-filling level without need of preset step and other initial parameters, then determines the required water-filling level by the dichotomy method. When the channel state changes, the proposed algorithm works out a small domain of required water-filling level based on the latest allocation and then tracks the channel quickly. Simulation results show that the proposed algorithm converges quickly and is suitable for time-varying channels.

In this letter, the system capacity of multiuser diversity combined with spatial multiplexing schemes is analyzed. An analytic expression is derived for the ergodic system capacity with multiuser scheduling and dual multi-input multi-output (MIMO) systems by using a tight lower bound of the link capacity. The proposed analytic approach is verified through comparisons between analytic and simulated results, and is shown to make fairly precise predictions of the ergodic system capacity and the scheduling gains even when the numbers of antennas and users are small.

A compact OTA suitable for low-voltage active-RC and MOSFET-C filters is presented. The input stage of the OTA utilises the resistive tail-biased differential amplifier and the output stage relies upon the feed-forward class AB technique with common-mode rejection capability that incurs no penalty on transconductance/bias-current efficiency. Analysis on the achievable peak voltage swing of the OTA when employed in filters is given. Simulation results of a 0.5-V 100-kHz elliptic 5th-order filter based on the OTA's in a 2-V 0.18 µm CMOS process indicate the differential peak voltage as large as 0.42 Vp (84% of the supply voltage) at 1% THD with the SFDR of 60 dB and the total power consumption of 50 µW.

Band connections employed in active cancellation circuits for effective reduction of digital substrate noise are proposed. An almost-odd-symmetrical noise characteristic is utilized for canceling out noises. Advancing this idea, interlaced connections of four bands are also proposed. Excess cancellation by those bands is more effective for noise reduction in a guard ring than a cancellation by two bands. Use of L-shaped bands on the basis of the interlaced connection suppresses the noise more. Simulation and experimental results show that the proposed band connections reduce the noise.

This paper presents a low cost and portable DOA (Direction Of Arrival) estimation system for surveillance using a modifed beamspace MUSIC (MUltiple Signal Classification) by a quasi-orthogonal multi-beam. This is instead of DFT processing and hardware system consisting of chip-sized phase shifters, a single ADC (Analogue to Digital Converter) and a single TR (TRanceiver) module for an antenna array. In the beamspace MUSIC, generated beampatterns have orthogonal properties. This proposed system cannot make such a beampattern due to the variable range limitation of phase shifter, then we use the quasi-orthogonal beam obtained by the calculation of correlation coefficient for beampattern. We demonstrate the proposed system using 4-element microstrip array antenna and chip-sized phase shifters. The DOA experiment in anechoic chamber confirms the proposed system performance.

One of the system greatly affecting the performance of a database server is the size-division of buffer pools. This letter proposes an adaptive control method of the buffer pool sizes. This method obtains the nearly optimal division using only observed response times in a comparatively short duration.

This paper describes the design of a random access memory (RAM) bank with a 0.35-µm CMOS process for column-parallel analog/digital converters (ADC) utilized in CMOS imagers. A dynamic latch is utilized that expends neither input DC nor drain current during the monitoring phase. Accuracy analysis of analog/digital conversion error in the RAM bank is discussed to ensure low power consumption of a counter buffer circuit. Moreover, the counter buffer utilizes a combination of NMOS and CMOS buffers to reduce power consumption. Total power consumption of a 10-bit 800-column 40 MHz RAM bank is 2.9 mA for use in an imager.

A novel procedure for an efficient and rigorous solution of electromagnetic scattering problems is presented. It is based on the use of universal bases that are obtained by applying the SVD procedure to PO-derived basis functions. These bases, constructed by totally bypassing any matrix-type approach, can be used for all angles of incidence and their use leads to a matrix with relatively small dimensions. The method enables us to solve 2D scattering problems in a computationally efficient and numerically rigorous manner.

Ultrahigh-speed fiber lasers operating at up to 40 GHz offer a clean longitudinal comb and a narrow linewidth. This makes them suitable for applications including optical comb generation, ultrahigh-speed optical pulse transmission including PSK, and as opto-microwave oscillators. In this paper, we describe recent progress on ultrafast fiber lasers and their applications to optical metrology.

We suggest a new minimum credit method for the dynamic bandwidth allocation in EPON. In the suggested method, to eliminate the unused transmission time-slot, each ONU requests no more than a predetermined maximum. We analyze the upstream channel resource wastage when traffic is light. Based on the analysis, we derive a minimum credit that eliminate the upstream channel resource wastage. The OLT estimates a traffic load and grants a minimum credit when the request is smaller than the minimum credit and traffic is light. Using simulation, we show the minimum credit discipline is superior than the existing methods in the mean delay and the frame loss rate.