This paper presents two new intelligent methods to linearize the Multi-Carrier Power Amplifiers (MCPA). One of the them is based on the Neuro-Fuzzy controller while the other uses two small neural networks as a polar predistorter. Neuro-Fuzzy controllers are not model based, and hence, have ability to control the nonlinear systems with undetermined parameters. Both methods are adaptive, low complex, and can be implemented in base-band part of the communication systems. The performance of the linearizers is obtained via simulation. The simulation is performed for three different scenarios; namely, a multi-carrier amplifier for GSM with four channels, a CDMA amplifier and a multi-carrier amplifier with two tones. The simulation results show that Neuro-Fuzzy Controller (NFC) and Neural Network Polar Predistorter (NNPP) have higher efficiencies so that reduce IMD3 by more than 42 and 32 dB, respectively. The practical implementation aspects of these methods are also discussed in this paper.

A new Row-by-Row Dynamic Source-Line Voltage Control (RRDSV) scheme is proposed to suppress leakage current by two orders of magnitude in the SRAM's for sub-70 nm process technology with sub-1-V VDD. This two-order leakage reduction is caused from the cooperation of reverse body-to-source biasing and Drain Induced Barrier Lowering (DIBL) effects. In addition, metal shields are proposed to be inserted between the cell nodes and the bit lines not to allow the cell nodes to be flipped by the external bit-line coupling noise in this paper. A test chip has been fabricated to verify the effectiveness of the RRDSV scheme with the metal shields by using 0.18-µm CMOS process. The retention voltages of SRAM's with the metal shields are measured to be improved by as much as 40-60 mV without losing the stored data compared to the SRAM's without the shields.

This paper presents a novel approach to improving the IDDQ-based diagnosability of a CMOS circuit by dividing the circuit into independent partitions and using a separate power supply for each partition. This technique makes it possible to implement multiple IDDQ measurement points, resulting in improved IDDQ-based diagnosability. The paper formalizes the problem of partitioning a circuit for this purpose and proposes optimal and heuristic based solutions. The effectiveness of the proposed approach is demonstrated through experimental results.

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and device-limited wireless networks. WSFQ slows down the growth of queue length in limited-buffer devices, still maintains the properties of fairness, and guarantees the throughputs of the system. Moreover, WSFQ can easily adapt itself to various kinds of traffic load. We also implement a packet-based scheduling algorithm, the Packetized Weighted Sacrificing Fair Queueing (PWSFQ), to approach the WSFQ. WSFQ and PWSFQ are evaluated by comparing with other algorithms by mathematical analysis and simulations.

In this paper, a dual level access scheme is proposed to provide two levels of access to the broadcast data; one to video signals protected for authorized users, another to extra information e.g. advertisements provided for the remaining users in the network. In the scheme, video signals in MPEG format are considered. The video contents are protected from unauthorized viewing by encrypting the DC coefficients of the luminance component in I-frames, which are extracted from the MPEG bit-stream. An improved direct sequence spread spectrum technique is used to add extra information to non-zero AC coefficients, extracted from the same MPEG bit-stream. The resultant MPEG bit-stream still occupies the same existing bandwidth allocated for a broadcast channel. At the receiver, the extra information is recovered and subtracted from the altered AC coefficients. The result is then combined with the decrypted DC coefficients to restore the original MPEG bit-stream. The experimental results show that less than 2.9% of the size of MPEG bit-stream was required to be encrypted in order to efficiently reduce its commercial value. Also, on average, with a 1.125 Mbps MPEG bit-stream, an amount of extra information up to 1.4 kbps could be successfully transmitted, while the video quality (PSNR) was unnoticeably degraded by 2.81 dB.

Materialized views, which are derived from base relations and stored in the database, offer opportunities for significant performance gain in query evaluation by providing quick access to the pre-computed data. A materialized view can be utilized in evaluating a query if it has pre-computed result of some part of the query plan. Although many approaches to utilizing materialized views in evaluating a query have been proposed, there exist several restrictions in selecting such views. This paper proposes new ways of utilizing materialized views in answering an aggregate query. Views including relations that are not referred to in the given query are utilized. Attributes missing from a view can be recovered under certain conditions. We identify the conditions where a view may be used in evaluating a query and present the algorithm to search for the most efficient query among the equivalent ones. We also report on a simulation based on the TPC-H and GRID databases. Simulation results show that our approach provides impressive performance improvements to the data warehousing environment where aggregate views are often pre-computed and materialized.

We analyze the performance of an adaptive hybrid search code acquisition algorithm for direct-sequence code division multiple access (DS-CDMA) systems under slowly-moving mobile environments. The code acquisition algorithm is designed to provide the desired feature of constant false alarm rate (CFAR) to cope with nonstationarity of interference in CDMA forward links. An analytical expression for the mean acquisition time is first derived and the probabilities of detection, miss, and false alarm are then obtained for frequency-selective Rayleigh fading environments. The fading envelope of a received signal is assumed to be constant over the duration of post-detection integration (PDI), which is most reasonable, especially for slowly-moving mobile environments. The performance of the designed code acquisition algorithm shall be evaluated numerically to examine the effect of some design parameters, such as the sub-window size, the size of the PDI, the decision thresholds in search and verification modes, and so on, considering IMT-2000 environments.

A radio frequency identification tag LSI operating with the carrier frequency of 13.56 MHz as well as storing nonvolatile information in embedded ferroelectric random access memory (FeRAM) has been developed. A full wave rectifier composed of PMOS transistor diodes and NMOS transistor switches achieves RF-to-DC power conversion efficiency over 54%. The entire 16 kbits write and read transaction time can be reduced to 2.1 sec by the use of FeRAM, which corresponds to 2.2 times speed enhancement over conventional EEPROM based tag LSIs. The communication range of the FeRAM based tag LSI can be effectively improved by storing antitheft information in a ferroelectric nonvolatile flip-flop, which can reduce the power consumption of FeRAM from 27 µW to 5 µW. The communication range for the antitheft gate system becomes 70 cm.

This paper describes a formal verification for a shared-memory-style communication system. We first describe two versions (i.e. abstract and concrete) of the communication system based on an I/O-automaton, which is a formal system for distributed algorithms. Then, we prove the concrete version can perform all the external operations of the abstract version. This result, together with a former result, leads to the equivalence of the two versions. The proof is done by Larch theorem prover, and is the ever largest case study using I/O-automata.

Path following circuits (PFC's) are circuits for solving nonlinear problems on the circuit simulator SPICE. In the method of PFC's, formulas of numerical methods are described by circuits, which are solved by SPICE. Using PFC's, numerical analysis without programming is possible, and various techniques implemented in SPICE will make the numerical analysis very efficient. In this paper, we apply the PFC's of the homotopy method to various nonlinear problems (excluding circuit analysis) where the homotopy method is proven to be globally convergent; namely, we apply the method to fixed-point problems, linear programming problems, and nonlinear programming problems. This approach may give a new possibility to the fields of applied mathematics and operations research. Moreover, this approach makes SPICE applicable to a broader class of scientific problems.

Hypersequential programming is a new method of concurrent-program development in which the original concurrent program is first serialized, then tested and debugged as a set of sequential programs (scenarios), and finally restored into the target concurrent program by parallelization. Both high productivity and reliability are achieved by hypersequential programming because testing and debugging are done for the serialized versions and the correctness of the serialized programs is preserved during the subsequent parallelization. This paper proposes scenario-based hypersequential programming for reactive multitasking systems that have not only concurrency and nondeterminacy, but also interruption and priority. Petri nets with priority are used to model reactive systems featuring interruption and priority-based scheduling. How reactive systems are made highly reliable by this approach is explained and the effectiveness of the approach is demonstrated through the example of a telephone terminal control program.

This paper addresses the estimation of time delay between two spatially separated noisy signals by system identification modeling with the input and output corrupted by additive white Gaussian noise. The proposed method is based on a modified adaptive Butler-Cantoni equalizer that decouples noise variance estimation from channel estimation. The bias in time delay estimates that is induced by input noise is reduced by an IIR whitening filter whose coefficients are found by the Burg algorithm. For step time-variant delays, a dual mode operation scheme is adopted in which we define a normal operating (tracking) mode and an interrupt operating (optimization) mode. In the tracking mode, only a few coefficients of the impulse response vector are monitored through L1-normed finite forward differences tracking, while in the optimization mode, the time delay optimized. Simulation results confirm the superiority of the proposed approach at low signal-to-noise ratios.

Recently, major services provided by mobile communications systems are shifting from voice conversations to data communications over the Internet. There is a strong demand for increasing the data transmission rate. However, an important problem arises; larger peak transmit power is required as transmission rate becomes higher. In this paper, we propose a wireless multi-hop virtual cellular concept to avoid this power problem. The virtual cellular network consists of a central port, which is a gateway to the network, and many distributed wireless ports. Transmit power and frequency efficiencies of the virtual cellular network are evaluated by computer simulation to compare with that of the present cellular networks. In the wireless multi-hop virtual cellular network, routing among wireless ports is an important technical issue. We propose a routing algorithm based on the total uplink transmit power minimization criterion and evaluate the total transmit power by computer simulation.

In this letter, we introduce the concept of k-error lattice structure to describe the stability of lattice structure for pseudorandom number sequences, give some of its properties, and make a study of the relationship between the k-error lattice structure and the k-error linear complexity. These properties and the relationship create an elementary framework to study the stability of the lattice structure of pseudorandom number sequences.

Joint frequency-domain equalization (FDE) and antenna diversity combining is applied to the reception of multi-rate DS-CDMA signals to achieve the frequency diversity effect while suppressing inter-path interference (IPI) resulting from the asynchronism of different propagation paths. At a receiver, fast Fourier transform (FFT) is applied for FDE and then inverse FFT (IFFT) is used to obtain a frequency-domain equalized DS-CDMA chip sequence for the succeeding despreading operation. An arbitrary spreading factor SF can be used for the given value of FFT window size; an extreme case is the nonspread SC system with SF=1. This property allows a flexible design of multi-rate DS-CDMA systems. Three types of FDE are considered; minimum mean square error (MMSE) equalization, maximal-ratio combining (MRC) equalization and zero-forcing (ZF) equalization. Matched filter bound analysis for achievable BER performance is presented. The improvement in the BER performance in a frequency-selective Rayleigh fading channel is evaluated by computer simulation. First, we consider the single-user case and compare the BER performances achievable with MMSE, MRC and ZF equalizations. How the fading rate and the spreading factor affect the BER performance is also evaluated. Furthermore, the BER performance comparison between FDE and rake combining is presented for various values of SF and also performance comparison between DS-CDMA and SC signal transmissions, both using FDE, is presented. Finally, we extend our evaluation to the multi-user case. Both downlink and uplink are considered and how the BER performances of downlink and uplink differ is discussed.

This paper describes a polarimetric feature extraction method from urban areas using the POLSAR (Polarimetric Synthetic Aperture Radar) data. The scattering characteristic of urban areas is different from that of natural distributed areas. The main point of difference is polarimetric correlation coefficient, because urban areas do not satisfy property of azimuth symmetry, Shh = Shv = 0. The decomposition technique based on azimuth symmetry can not be applied to urban areas. We propose a new model fit suitable for urban areas. The proposed model fit consists of odd-bounce, even-bounce and cross scattering models. These scattering models can represent the polarimetric backscatter from urban areas, and satisfy Shh 0 and Shv 0. In addition, the combination with the proposed model fit and the three component scattering model suited for natural distributed areas is examined. It is possible to apply the combined technique to POLSAR data which includes both urban areas and natural distributed areas. The combined technique is used for feature extraction of actual X-band POLSAR data acquired by Pi-SAR. It is shown that the proposed model fit is useful to extract polarimetric features from urban areas.

This paper analytically formulates both the optimal quantization noise allocation ratio and the coding gain of the two-dimensional morphological Haar wavelet transform. The two-dimensional morphological Haar wavelet transform has been proposed as a nonlinear wavelet transform. It has been anticipated for application to nonlinear transform coding. To utilize a transformation to transform coding, both the optimal quantization noise allocation ratio and the coding gain of the transformation should be derived beforehand regardless of whether the transformation is linear or nonlinear. The derivation is crucial for progress of nonlinear transform image coding with nonlinear wavelet because the two-dimensional morphological Haar wavelet is the most basic nonlinear wavelet. We derive both the optimal quantization noise allocation ratio and the coding gain of the two-dimensional morphological Haar wavelet transform by introducing appropriate approximations to handle the cumbersome nonlinear operator included in the transformation. Numerical experiments confirmed the validity of formulations.

Ubiquitous computing (ubicomp) demands new security and privacy enhancing technologies for the new information and communication environments where a huge number of computers interact with each other in a distributed and ad hoc manner to access various resources and services. This paper surveys emerging security and privacy enhancing technologies, focusing on access control in ubiquitous computing environments because this is the underlying core technology to enforce security and privacy policies. We classify access control technologies into three types associated with the three access control phases of prevention, avoidance, and detection, and provide an overview of ubiquitous computing-oriented technologies and solutions, ranging from security and privacy models and policies to the enforcement of policies and system implementation.

In the design of cascode CMOS low-noise amplifiers, the gate-drain capacitance is generally neglected because it is thought to be small enough compared to gate-source capacitance. However, a careful examination will reveal the fact that the drain impedance of the input transistor significantly affects the input impedance through the gate-drain capacitance, especially as the CMOS technology getting more and more advanced. Moreover, the substrate coupling network of the input transistor also comes into play when the drain impedance of the input transistor is high enough compared to the substrate coupling network. In order to make input matching easier, it is desirable to know the details of the substrate coupling network. Unfortunately, designers generally do not have enough information about the technology they have used, not to mention knowing the details concerning the substrate coupling network. As a matter of fact, designers generally do have foundry provided component models that contain information about the substrate coupling network. This gives us the chance to minimize its effect and predict the input impedance of a low noise amplifier more accurately. In this paper, we show that the effect of the substrate coupling network can be ignored by keeping the drain impedance of the input transistor low enough and a proper drain impedance can then be chosen to achieve input matching without the need of iteration steps. Simulation results of a 2.4 GHz CMOS low noise amplifier using foundry provided component models are also presented to demonstrate the validation of the proposed input matching method.

We investigate the effects of the performance of sensor networks on network availability and in turn evaluate the impact of protocols and network configuration on these effects. The typical wireless sensor network of the future consists of a large number of micro-sized sensors that are equipped with batteries of limited capacity. In such a network, energy consumption is one of the most important issues. Several representative protocols that are applied in ring and linear network configurations are analyzed, and explicit formulae for network availability are derived for each of them. Numerical values derived by using these formulae yielded the surprising result that backup routes do not always improve network availability. This is because the loads imposed by the backup routes on network segments that do not include dead sensor nodes reduce sensor-node lifetimes in these segments.