This paper proposes a design method for representing monochrome medical X-ray images on an electronic display. The required quantizing resolution of the input density and output voltage are theoretically clarified. The proposed method makes it easier to determine the required quantizing resolution which is important in a X-ray diagnostic system.

With the rapid adoption of mobile devices and location based services (LBS), applications provide with nearby information like recommending sightseeing resort are becoming more and more popular. In the mean time, traffic congestion in cities led to the development of mobile public transportation systems. In such applications, mobile devices need to communicate with servers via wireless communications and servers should process queries from tons of devices. However, because users can not neglect the payment for the wireless communications and server capacities are limited, decreasing the communications made between central servers and devices and reducing the burden on servers are quite demanding. Therefore, in this paper, we propose a cost-effective intelligent public transportation system, ACE-INPUTS, which utilizes a mobile device to retrieve the bus routes to reach a destination from the current location at the lowest wireless communication cost. To accomplish this task, ACE-INPUTS maintains a small amount of information on bus stops and bus routes in a mobile device and runs a heuristic routing algorithm based on such information. Only when a user asks more accurate route information or calls for a "leave later query", ACE-INPUTS entrusts the task to a server into which real-time traffic and bus location information is being collected. By separating the roles into mobile devices and servers, ACE-INPUTS is able to provide bus routes at the lowest wireless communication cost and reduces burden on servers. Experimental results have revealed that ACE-INPUTS is effective and scalable in most experimental settings.

This paper proposes a new adaptive filter algorithm for system identification by using an independent component analysis (ICA) technique, which separates the signal from noisy observation under the assumption that the signal and noise are independent. We first introduce an augmented state-space expression of the observed signal, representing the problem in terms of ICA. By using a nonparametric Parzen window density estimator and the stochastic information gradient, we derive an adaptive algorithm to separate the noise from the signal. The proposed ICA-based algorithm does not suppress the noise in the least mean square sense but to maximize the independence between the signal part and the noise. The computational complexity of the proposed algorithm is compared with that of the standard NLMS algorithm. The stationary point of the proposed algorithm is analyzed by using an averaging method. We can directly use the new ICA-based algorithm in an acoustic echo canceller without double-talk detector. Some simulation results are carried out to show the superiority of our ICA method to the conventional NLMS algorithm.

This letter presents delayed perturbation bounds (DPBs) for receding horizon controls (RHCs) of continuous-time systems. The proposed DPBs are obtained easily by solving convex problems represented by linear matrix inequalities (LMIs). We show, by numerical examples, that the RHCs have larger DPBs than conventional linear quadratic regulators (LQRs).

In this paper, we propose a low complexity realization method for compensating for nonlinear distortion. Generally, nonlinear distortion is compensated for by a linearization system using a Volterra kernel. However, this method has a problem of requiring a huge computational complexity for the convolution needed between an input signal and the 2nd-order Volterra kernel. The Simplified Volterra Filter (SVF), which removes the lines along the main diagonal of the 2nd-order Volterra kernel, has been previously proposed as a way to reduce the computational complexity while maintaining the compensation performance for the nonlinear distortion. However, this method cannot greatly reduce the computational complexity. Hence, we propose a subband linearization system which consists of a subband parallel cascade realization method for the 2nd-order Volterra kernel and subband linear inverse filter. Experimental results show that this proposed linearization system can produce the same compensation ability as the conventional method while reducing the computational complexity.

This study employs secret codes and secret keys based on the elliptic curve to construct an elliptic curve cryptosystem with a dynamic access control system. Consequently, the storage space needed for the secret key generated by an elliptic curve dynamic access control system is smaller than that needed for the secret key generated by exponential operation built on the secure filter (SF) dynamic access control system. Using the elliptic curve to encrypt/decrypt on the secure filter improves the efficiency and security of using exponential operation on the secure filter in the dynamic access control system. With the proposed dynamic elliptic curve access control system, the trusted central authority (CA) can add/delete classes and relationships and change the secret keys at any time to achieve an efficient control and management. Furthermore, different possible attacks are used to analyze the security risks. Since attackers can only obtain the general equations for the elliptic curve dynamic access control system, they are unable to effectively perform an elliptic curve polynomial (ECP) conversion, or to solve the elliptic curve discrete logarithm problem (ECDLP). Thus, the proposed elliptic curve dynamic access control system is secure.

In this paper, a new subspace-based speech enhancement algorithm is presented. First, we construct a perceptual filterbank from psycho-acoustic model and incorporate it in the subspace-based enhancement approach. This filterbank is created through a five-level wavelet packet decomposition. The masking properties of the human auditory system are then derived based on the perceptual filterbank. Finally, the prior SNR and the masking threshold of each critical band are taken to decide the attenuation factor of the optimal linear estimator. Five different types of in-car noises in TAICAR database were used in our evaluation. The experimental results demonstrated that our approach outperformed conventional subspace and spectral subtraction methods.

This paper discusses the behavior of the second-order modes (Hankel singular values) of linear continuous-time systems under typical frequency transformations, such as lowpass-lowpass, lowpass-highpass, lowpass-bandpass, and lowpass-bandstop transformations. Our main result establishes the fact that the second-order modes are invariant under any of these typical frequency transformations. This means that any transformed system that is generated from a prototype system has the same second-order modes as those of the prototype system. We achieve the derivation of this result by describing the state-space equations and the controllability/observability Gramians of transformed systems.

The traffic with asymmetry between uplink and downlink has recently been getting remarkable on mobile communication systems providing multimedia communication services. In the future mobile communications, the accommodation of asymmetric traffic is essential to realize efficient multimedia mobile communication systems. This paper discusses asymmetric traffic accommodation in CDMA/FDD cellular packet communication systems and proposes its efficient scheme using an adaptive cell sizing technique. In the proposed scheme, each base station autonomously controls its coverage area so that almost the same communication quality can be achieved across the service area under the asymmetric traffic conditions. We present some numerical examples to demonstrate the effectiveness of the proposed scheme by using computer simulation. The simulation results show that, under asymmetric traffic conditions, the proposed scheme can provide fair communication quality across the service area in both links and can improve total transmission capacity in the uplink.

Multilink MIMO technique is a promising technology for cellular networks with a guaranteed quality-of-service. It will provide high capacity and wide coverage. We evaluated the downlink performance of the multilink MIMO system from the perspective of quality-of-service. The presence of Rayleigh fading, shadowing, and path loss was assumed. To evaluate the proposed system, we developed a performance measure for MIMO cellular system. The measure is ergodic capacity taking into account area coverage. Our numerical results show that the area coverage of proposed multilink MIMO system is greatly improved compared with that of the conventional singlelink MIMO system. Using the proposed measure, we also found that the multilink MIMO system could achieve high capacity with guaranteed QoS for a wide coverage.

The traditional feedback linearization method often requires the full system parameter and state information. In this paper, we consider an asymptotic stabilization problem of a class of feedback linearizable nonlinear systems by using less than the full parameter/state information. First, our approach is to classify system parameters into two categories--'directly used parameters' and 'indirectly used parameters.' Then, a feedback linearizing controller is designed by using only the 'directly used parameters' and the observer is utilized to estimate the transformed states (diffeomorphism) which includes 'indirectly used parameters.' Thus, in our control approach, we use only a partial set of system parameters and partial state information for asymptotic stability. The useful aspects of the proposed scheme are illustrated through an example.

In real-time systems, deadline misses of the tasks cause a degradation in the quality of their results. To improve the quality, we have to allocate CPU utilization for each task adaptively. Recently, Buttazzo et al. address a feedback scheduling algorithm, which dynamically adjusts task periods based on the current workloads by applying a linear elastic task model. In their model, the utilization allocated to each task is treated as the length of a linear spring and its flexibility is described by a constant elastic coefficient. In this paper, we first consider a nonlinear elastic task model, where the elastic coefficient depends on the utilization allocated to the task. We propose a simple iterative method for calculating the desired allocated resource and derive a sufficient condition for the convergence of the method. Next, we apply the nonlinear elastic model to an adaptive fair sharing controller. Finally, we show the effectiveness of the proposed method by computer simulation.

Since Smart Antenna technology has powerful spatial processing ability; it is regarded as a promising approach to enhancing the data rates and capacity of wireless LAN systems. In this paper, a small size, practical switched-beam antenna system, well suited for domestic in-home networking in the 2.4 GHz band, is designed and tested. The system has the configuration of regular nine-prism, and nine 1/4 wavelength rectangular patches are symmetrically distributed on the nine sides of the prism. The switching process is based on control of the microstrip used to feed the patch radiators, by placing PIN diodes at the microstrip feeding lines. The antenna array can generate nine beams with a gain of 11 dB. All the beams generated by the system are cophasal excited and have a 40°beamwidth. Compared to the uniform array, the system can guarantee the consistency of every beam and is preferable in shape.

We propose a digital carrier recovery loop employing both a frequency detector and a phase detector for M-ary phase shift keying (MPSK) systems. A new frequency error correction function is also derived to increase the acquisition range. It is shown through computer simulation that the proposed scheme can reduce the acquisition time at large frequency offsets, unlike the existing ones.

With advances in ubiquitous environments, user demand for easy data-lookup is growing rapidly. Not only users but intelligent ubiquitous applications also require data-lookup services for a ubiquitous computing framework. This paper proposes a backward-compatible, searchable virtual file system (S-VFS) for easy data-lookup. We add search functionality to the VFS, the de facto standard abstraction layer over the file system. Users can find a file by its attributes without remembering the full path. S-VFS maintains the attributes and the indexing structures in a normal file per partition. It processes queries and returns the results in a form of a virtual directory. S-VFS is the modified VFS, but uses legacy file systems without any modification. Since S-VFS supports full backward compatibility, users can even browse hierarchically with the legacy path name. We implement S-VFS in Linux kernel 2.6.7-21. Experiments with randomly generated queries demonstrate outstanding lookup performance with a small overhead for indexing.

Over the past ten years, the demand for low-cost, low-power, and small form-factor portable wireless devices has led to the integration of RF transceivers on the same silicon as digital processors to form wireless systems-on-a-chip. This paper describes the challenges in designing CMOS systems-on-a-chip for wireless communications. RF transceiver building blocks for signal amplification, frequency translation, and frequency selectivity are examined with special emphasis on low noise amplifiers, power amplifiers, mixers, and frequency synthesizers. System-on-a-chip integration issues such as leakage currents of digital logic, calibration techniques, and noise coupling are also discussed.

This paper proposes a channel estimation technique for the dynamic parameter controlled--orthogonal frequency and time division multiple access (DPC-OF/TDMA) systems studied as one of the candidates of the beyond third generation (B3G) systems. In the proposed scheme, the impulse response, which represents the channel state information (CSI) is estimated using carrier interferometry (CI) which is equivalent to impulse signal transmission. Moreover, because the minimum number of subcarriers allocated to terminals is 64, in order to estimate a CSI with its spreading factor of 64, we employ a code-multiplexed CI signal for a cell search process and a time-domain-multiplexed CI signal for transmit antenna identification. Furthermore, we also propose a flexible CSI estimation scheme that supports two cases: multiple subchannel block assignment and MIMO transmission cases. Computer simulation confirms that the proposed scheme can estimate the CSI with high accuracy.

A novel PND (PMOS-NMOS-Depletion MOS) technology for a single poly gate non-volatile memory cell design has been reported for the first time. This technology features memory cell design with a differential cell architecture which enables to provide the higher performance for the key specifications such as programming time, erasing time, and endurance characteristics. This memory cell consists of 3-Transistors, PMOS, NMOS, and Depletion MOS transistors (hereafter PND). The DMOS in this cell is used for the tunneling device in the erasing operation, while the NMOS and the PMOS are used for the tunneling device and the coupling capacitor in the programming operation, respectively. The proposed PND design can allow lower applied voltage of the erase-gate (EG) and control-gate (CG) in the erasing and the programming operations so that the endurance characteristics can be improved because the DMOS suppresses the potential of floating-gate (FG) and hence the effective potential difference between the EG and the FG can be increased in the erasing operation. Based on the measured data, it can be expected that the erasing speed of the PND cell can be 125-fold faster than that of our previously reported work (PN type). Therefore, high performance and high reliability CMOS non-volatile memory without any additional process can be realized using this proposed PND technology.

In this paper, we propose an adaptive data transmission scheme for DS/CDMA packet radio communication systems in bandlimited indoor multipath fading channels. We first analyze the relationship between the code rate and the processing gain (defined as the number of chips per coded bit) in maximizing the normalized throughput in connection with the channel state of the indoor multipath fading channels. One observation made is that the maximum throughput with BPSK modulation is attained when the code rate is chosen as low as possible irrespective of the channel state, and the processing gain is increased (decreased) as the channel becomes worse (better). The other observation made is that when DPSK modulation is employed, there exists an optimal combination of the code rate and the processing gain in maximizing the normalized throughput for each channel state. Based on these observations, we propose to adapt the processing gain and/or code rate according to the fading conditions in order to maximize the normalized throughput. We analyze the performance of the proposed scheme and compare it with the non-adaptive data transmission scheme. Our results show that the adaptive transmission scheme yields a significant performance improvement over the nonadaptive scheme, and increasing the adaptation level is more effective as the channel gets worse, but the 3-state adaptation seems to be practically optimum.

The most time consuming operation to verify a signature with the Elliptic Curve Digital Signature Algorithm is a multi-scalar multiplication with two scalars. Efficient methods for its computation are the Shamir method and the Interleave method, whereas the performance of those methods can be improved by using general base-2 representations of the scalars. In exchange for the speed-up, those representations require the precomputation of several points that must be stored. In the case of two precomputed points, the Interleave method and the Shamir method provide the same, optimal efficiency. In the case of more precomputed points, only the Interleave method can be sped-up in an optimal way and is currently more efficient than the Shamir method. This paper proposes a new general base-2 representation of the scalars that can be used to speed up the Shamir method. It requires the precomputation of ten points and is more efficient than any other representation that also requires ten precomputed points. Therefore, the proposed method is the first to improve the Shamir method such that it is faster than the Interleave method.