Wyner and Ziv considered the rate-distortion function for source coding with side information at the decoder (we call the Wyner-Ziv problem). In this paper we show an information-spectrum approach to the Wyner-Ziv problem for general class of nonstationary and/or nonergodic sources with side information at the decoder, where the distortion measure is arbitrary and may be nonadditive. We show that a general formula for the rate-distortion function of the Wyner-Ziv problem for general sources with the maximum distortion criterion under fixed-length coding by using the information spectrum approach.

A MOSFET structure with non-overlapped source-drain to gate region is proposed to overcome the challenges in sub-0.1 µm CMOS device. Key device characteristics were investigated by extensive simulation study. Fringing gate electric field through the dielectric spacer induces inversion layer in the non-overlap region to act as extended S/D region. Electrons were induced reasonably under the spacer. Internal physics and speed characteristics were studied with the non-overlap distance. The proposed structure had good subthreshold slope and DIBL characteristics compared to those of overlapped structure.

We report on the analysis and fabrication of vertical PtSi Schottky source/drain metal oxide semiconductor field effect transistors (MOSFETs), which are suitable for combination with quantum effect devices such as resonant tunneling diodes. Analysis was carried out by one-dimensional approximation of the device structure, WKB approximation of the tunneling probability in Schottky barrier tunneling and self-consistent calculation. Theoretical calculation showed good drivability (750 µA/µm) of this device with tOX = 1 nm and tSi = 5 nm. As a preliminary experiment, devices with a Si channel thickness of 8 nm, 20 nm or 30 nm and a vertical channel length of 55 nm were fabricated. Although the drain current at the "on" state was small due to the thick gate oxide of 8 nm, analysis and measurement showed reasonable agreement with respect to the drivability. Based on the results of theoretical analysis, the device drivability can be much improved by reducing the gate oxide thickness.

This paper describes the concept of an adaptive network, that is, a network environment that can rapidly and autonomously adapt its behavior according to network conditions and traffic status. The user interface of the adaptive network can access any resource in the network as a memory-mapped I/O device, as if it were attached to the local bus of the user's PC. This network concept has several benefits. From the application development viewpoint, no network related programming is required, and applications do not have to be modified even if the network topologies and protocols are changed. Network maintenance and upgrading can be done anytime without having to worry about the application users, because the network itself is concealed from the applications. In addition, the reconfigurable hardware technology functions as an autonomous network control through the use of a lower-layer protocol. We developed a testbed that makes heterogeneous resources available to users and used it to demonstrate the feasibility of our concept by implementing and running some applications over it.

This paper deals with a cellular system based on Code Division Multiple Access (CDMA) and investigates the performance of Signal-to-Interference (SIR)-based Closed Loop-Power Control (CLPC) schemes taking into account errors on the feedback channel that conveys the power control command from the base station to the mobile terminals. We have evaluated both the distribution of the received power at the base station and the optimum control step size that minimizes the Control Error (CE) standard deviation, a useful measure of the CLPC performance. The impact of interference variations has been deeply investigated for different mobility scenarios and for different feedback channel error conditions.

The possibility of applying a recently proposed emission source location method, which is based on CISPR measurements, to sources with arbitrary directional current components is studied. We propose a new finding algorithm in which the horizontal and the vertical current components are estimated at the same time by taking into account the contribution of horizontal current components when calculating the vertical electric field. As a result of experimental verification by using two spherical dipole antennas as ideal emission sources, estimated values show good agreement with the original ones in the frequency range from 300 MHz to 1 GHz, where the position estimation deviation d was less than 0.15 m, the amplitude estimation deviation j was less than 2.1 dB, and furthermore the angle of current direction could be estimated. Consequently, this method with the presented new algorithm can be applied to find radiated emission sources even when the current components point to arbitrary directions.

In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized.

Sophisticated and robust resource management is an essential issue in future wireless systems which will provide a variety of application services. In this paper, we employ an adaptive-network-based fuzzy inference system (ANFIS) to control the resource allocation for mobile multimedia networks. ANFIS, possessing the advantages of expert knowledge of fuzzy logic system and learning capability of neural networks, can provide a systematic approach to finding appropriate parameters for the Sugeno fuzzy model. The fuzzy resource allocation controller (FRAC) is designed in a two-layer architecture and selects properly the capacity requirement of new call request, the capacity reservation for future handoffs, and the air interface performance as input linguistic variables. Therefore, the statistical multiplexing gain of mobile multimedia networks can be maximized in the FRAC. Simulation results indicate that the proposed FRAC can keep the handoff call blocking rate low without jeopardizing the new call blocking rate. Also, the FRAC can indeed guarantee quality of service (QoS) contracts and achieve higher system performance according to network dynamics, compared with the guard channel scheme and ExpectedMax strategy.

The provisioning of QoS in the Internet is gaining an increasing attention, thus the importance of methods capable of estimating the bandwidth requirement of traffic flows is constantly growing. This information can be used for a wide range of purposes. Admission control, QoS routing and load sharing all need the same basic information in order to be able to make decisions. This paper describes a number of methods that can be used to arrive at precise estimates of the bandwidth requirement focusing on those that are based on the theory of large deviations. A methodology is presented that allows the reformulation of earlier solutions based on the estimation of some form of an overflow probability so that their output becomes a bandwidth-type quantity, the format preferred by Internet control applications. The methodology provides two tracks for the conversion: an indirect method that encapsulates the overflow probability-type approach as an embedded calculation and a direct method that immediately results in the estimate of the bandwidth requirement. The paper introduces a novel method for the direct computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotic regime of the large deviation theory. The direct bandwidth estimator method reduces the computational complexity of the calculations, since it results directly in the bandwidth requirement, allowing the omission of the frequent and costly computation of the buffer overflow probability. The savings arising from the reduction in computational complexity are demonstrated in a numerical example.

We suggest the method to recover the 3D shape of an object by using a color image scanner which has three light sources. The photometric stereo is traditional to recover the surface normals of objects using multiple light sources. In this method, it usually assumes distant light sources to make the optical models simple. But the light sources in the image scanner are so close to an object that the illuminant intensity varies with the distance from the light source, therefore these light sources should be modeled as the linear light sources. In this method, by using these models and two step algorithm; the initial estimation by the iterating computation and the optimization by the non-linear least square method, not only the surface normal but also the absolute distance from the light source to the surface can be estimated. By using this method, we can recover the 3D shape more precisely. In the experimental results, the 3D shape of real objects can be recovered and the effectiveness of the proposed method is shown.

DANSE (Dynamically Adaptive Networking Service Environment) is a new architecture for adaptive network service systems. In this paper, a framework for context-aware service construction based on DANSE architecture is presented. In DANSE, any hardware, software, information, and services that are available on a network are treated as network resources. DANSE coordinates the construction of an end user's service based on the user's requests and situation or context (i.e., user's location, schedule, co-workers, etc.). To provide users with satisfactory services, it monitors user context continuously and searches for network resources that are convenient for a target user. Moreover, it detects changes in user context and invokes service construction if needed. If the desired service is not available, alternative services are automatically constructed. With those capabilities, DANSE enables ubiquitous provision of services any time, anywhere.

Our aim is to develop an intuitive and effective sound retrieval method for non-expert users. Such a retrieval method should be developed to accommodate a human's perceptual features. We therefore first conducted an experiment to clarify how people represent sound. A participant listens to one sound stimulus and then conveys the sound to a partner. The results indicated that people used mostly verbal description categorized in three groups: the sound itself, the sound's situation, and the sound's impression. Based on these results, we propose three types of keywords: onomatopoeia, sound source, and adjective, which are typical keywords of the above three groups of sound description, for sound retrieval. This retrieval method was implemented for a sound database. Our method can increase the varieties of sounds able to be retrieved and allow users to intuitively search sounds because users can retrieve sounds by using keywords that are most natural to them.

We study the reliability functions or the minimum r-achievable rates of the lossless coding for the general sources in the sense of Han-Verdu, where r means the exponent of the error probability. Han has obtained formulas for the minimum r-achievable rates of the general sources. Our aim is to give alternative expressions for the minimum r-achievable rates. Our result seems to be a natural extension of the known results for the stationary memoryless sources and Markov sources.

A universal channel decoder for a given family of channels is a decoder that can be designed without prior knowledge of the characteristics of the channel. Nevertheless, it still attains the same random coding error exponent as the optimal decoder tuned to the channel. This paper investigates the duality between universal channel decoders and universal source encoders. First, for the family of finite-state channels, we consider a sufficient condition for constructing universal channel decoders from universal source encoders. Next, we show the existence of a universal channel code that does not depend on the choice of the universal decoder.

We proposed a simple technique for measuring the effective zero-dispersion wavelength. In this study, we measured the effective zero-dispersion wavelength of a 25-km-long dispersion-shifted fiber (DSF) using the four-wave mixing (FWM) of a spectrum-sliced fiber amplifier light source, and then compared our results with other conventional techniques to confirm the validity of our method.

In variable-length coding, the probability of codeword length per source letter being above (resp. below) a prescribed threshold is called the overflow (resp. the underflow) probability. In this paper, we show that the infimum achievable threshold given the overflow probability exponent r always coincides with the infimum achievable fixed-length coding rate given the error exponent r, without any assumptions on the source. In the case of underflow probability, we also show the similar results. From these results, we can utilize various theorems and results on the fixed-length coding established by Han for the analysis of overflow and underflow probabilities. Moreover, we generalize the above results to the case with overflow and underflow probabilities of codeword cost.

An efficient numerical source model is proposed to calculate the induced current densities in the human body from low-frequency inhomogeneous magnetic fields emitted by electronic devices. Due to the complex geometrical structure of electronic devices (e.g. household appliances, power tools), an efficient equivalent source model based on magnetic elementary dipoles is used instead of the real device or the approximated source model (current loop). Subsequently, the validity of the method proposed is confirmed.

This paper presents a novel image coding scheme based on separate coding of region and residue sources. In a subband image coding scheme, quantization errors in each subimage spread over the reconstructed image and result in a blurring or a boundary artifact. To obtain high compression ratio without considerable degradation, an input image, in our scheme, is separated into region and residue sources which are coded using different coding schemes. The region source is coded by adaptive arithmetic coder. The residue source is coded using multiresolution subimages generated by applying a subband filter. Each block in the subimages is predicted by an affine transformation of blocks in lower resolution subimages. Experimental results show that a high coding efficiency is achieved using the proposed scheme, especially in terms of the subjective visual quality and PSNR at low bit-rate compression.

The capacity analysis of CDMA forward link is required to allocate high data-rate users. To solve this problem, we analyze the capacity of the CDMA forward link based on optimum power control. In a multi-cell environment, the intracell interference and intercell interference are derived. To show the capacity impact of high data-rate users, we introduce a location dependent factor, which is the ratio of intercell interference to intracell interference. Considering the location dependent factor, we propose a coordinated allocation scheme that can be used to allocate high data-rate users in sectorized cells. As a result, we show the capacity impact of high data-rate users according to location variations. The outage probability can be decreased when the coordinated allocation scheme is applied.

In this paper we study the scalability issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning. We propose and develop a path-oriented, quota-based dynamic bandwidth allocation mechanism for efficient admission control operations under the centralized bandwidth broker model. We demonstrate that this dynamic bandwidth allocation mechanism can significantly reduce the overall number of QoS state accesses/updates, thereby increasing the overall call processing capability of the bandwidth broker. Based on the proposed dynamic bandwidth allocation mechanism, we also extend the centralized architecture with a single bandwidth broker to a hierarchically distributed architecture with multiple bandwidth brokers to further improve its scalability. Our study demonstrates that the bandwidth broker architecture can be designed in such a manner that it scales with the increase in the network capacity.