This paper treats weight distributions of the coset leaders of binary linear block codes. We first present a method for computing the weight distribution of the coset leaders of a given code using two tables each of which stores the weights of the coset leaders of a related code of the code. Then, the weight distributions of the coset leaders of the (N,K) Reed-Muller codes, binary primitive BCH codes, and their extended codes with N 128 and 29 N-K 42 that are obtained by using the computing method are given.

A simplified analysis is presented for the reverse link maximum capacity trade-offs between each layer, spectrum efficiency and its multi-rate features of TDMA/W-CDMA and N-CDMA/W-CDMA overlaid systems with the perfect power control based on the measurement of signal-to-interference ratio (CIR). In order to suppress the multi-cross interference, the other important techniques used in the analysis are the ideal notch filtering and the signal level clipper for W-CDMA system transmitters and receivers. We firstly propose the concepts of the notch filtering depth and signal level clipping depth in the paper. The numerical results can be adopted as a guideline in designing the overlaid systems in the various cases as well as a means to investigate the flexibility of sharing of the spread spectrum and their feasibility in the future mobile communication system.

To reduce an amount of computation of full search algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images. The computational reduction without any degradation comes from adaptive matching scan algorithm according to the image complexity of the reference block in current frame. Experimentally, we significantly reduce the computational load compared with conventional full search algorithm.

Many experimentally and theoretically based models have been proposed to predict, quantitatively evaluate, and combat the fading phenomenon in mobile communication systems. However, to the best of the authors' knowledge, up to now there is no objective method to determine which is the most suitable distribution to model the fading phenomenon based on experimental data. In this work, the Minimum Description Length (MDL) criterion for model selection is proposed for that purpose. Furthermore, the MDL analysis is performed for some of the most widely used fading models based on measurements taken in a sub-urban environment.

Voltage follower is one of the most useful building blocks in analog circuits. This paper proposes a voltage follower composed of a complementary pair of p-channel MOS(PMOS) and n-channel MOS (NMOS) differential amplifiers which operates under low power supply. The proposed circuit has a rail-to-rail dynamic range by combining complementary differential amplifiers.

Many researchers have used hypercube interconnection networks for their good properties to construct many parallel processing systems. However, as the number of processors increases, the probability of occurrences of faulty nodes also increases. Hence, for hypercube interconnection networks which have faulty nodes, several efficient dynamic routing algorithms have been proposed which allow each node to hold status information of its neighbor nodes. In this paper, we propose an improved version of the algorithm proposed by Chiu and Wu by introducing the notion of full reachability. A fully reachable node is a node that can reach all nonfaulty nodes which have Hamming distance l from the node via paths of length l. In addition, we further improve the algorithm by classifying the possibilities of detours with respect to each Hamming distance between current and target nodes. We propose an initialization procedure which makes use of an equivalent condition to perform this classification efficiently. Moreover, we conduct a simulation to measure the improvement ratio and to compare our algorithms with others. The simulation results show that the algorithms are effective when they are applied to low-dimensional hypercube interconnection networks.

The Internet is a heterogeneous and rapidly evolving environment. New information services have been added, modified, and diversified, while legacy services have been abandoned. Users' requirements for services are also changing very quickly. It is becoming very difficult to find required information services from extremely huge amount of information in the Internet. It is necessary to design information service system, which can meet user's heterogeneous requirements for services, adaptability of services to cope with ever-changing situation and to provide assurance. Faded information field architecture and Push/Pull Mobile Agent (MA) technologies are proposed as basic components of autonomous information service system to achieve these goals. The system is proposed from users' and providers' point of view, therefore we present a technique for balancing users' and providers' communication cost based on `through rate' for faded information field realization. On the basis of this technique, autonomous information allocation algorithm is proposed, in which each node may determine information amount based on push/pull cost. The effectiveness of the proposed algorithm is shown through simulation.

A fully balanced (FB) transconductor using two multi-input single-ended (SE) CMOS transconductors is proposed, where the transconductors use MOS transitors operating in a triode region for achieving a wide linear input-range. SE circuits are easier to design than differential circuits and inherently reject common-mode (CM) signals. The multi-input structure is used to make a CM feedback loop and to determine an output CM voltage. A high-output-resistance current mirror is used in converting a differential signal to a single-ended signal in order to achieve a high common-mode rejection ratio (CMRR) and a high output-resistance of the transconductor. The FB transconductor achieves a 2-Vpp linear input range at a 2.5-V power supply and consumes 1.74 mA. The output resistance of the FB transconductor is 2 MΩ. It operates at 2 V with a linear input-range of 1.2 Vpp and at 1.6 V with a linear input-range of 0.9 Vpp. A 2.5-V 2.5-MHz FB Gm-C filter using the FB transconductors achieved a CMRR of 45 dB and a passband IIP3 of 32 dBm.

We consider a discrete event system controlled by a decentralized supervisor consisting of n local supervisors. Given a nonempty and closed language as the upper bound specification, we consider a problem to synthesize a reliable decentralized supervisor such that the closed-loop behavior is still legal under possible failures of any less than or equal to n-k (1 k n) local supervisors. We synthesize two such reliable decentralized supervisors. One is synthesized based on a suitably defined normal sublanguage. The other is the fully decentralized supervisor induced by a suitably defined centralized supervisor. We then show that the generated languages under the control actions of these two decentralized supervisors are incomparable.

In order to observe temporal distribution of sea clutter, radar echoes were taken from high sea state 7 at a fixed azimuth angle of 317. It is shown that the sea-clutter amplitudes obey the Weibull distribution at a grazing angle of 3.9, and obey both the Weibull distribution and K-distribution at grazing angles of 7.5 and 61.4. As the grazing angle increases, the shape parameters of Weibull distribution and K-distribution increase with both the distributions themselves tending to be closer to the Rayleigh distribution.

The blind separation of sources is a recent and important problem in signal processing. Since 1984, it has been studied by many authors whilst many algorithms have been proposed. In this paper, the description of the problem, its assumptions, its currently applications and some algorithms and ideas are discussed.

This work presents the first comprehensive full-band Monte Carlo model for the simulation of silicon/silicon-germanium devices with arbitrary germanium profiles. The model includes a new CPU and memory efficient method for the discretization of the Brillouin zone based on adaptive nonuniform tetrahedral grids and a very efficient method for transfers through heterointerfaces in the case of irregular -space grids. The feasibility of the FB-MC simulation is demonstrated by application to an industrial HBT with a graded germanium profile and different aspects of the microscopic carrier transport are discussed. Internal distributions of the transistor are calculated with a very low noise level and high efficiency allowing a detailed investigation of the device behavior.

In this paper, we propose an effective SOI yield engineering methodology by practical usage of 2D simulations. Process design for systematic yield of Fully-Depleted SOI MOSFET requires specific consideration of floating-body effects and parasitic channel leakage currents. The influence of varied SOI layer thickness to such phenomena is also complicated and substantial. Instead of time-consuming 3D simulators, 2D simulators are used to optimize the process considering these effects in acceptable turn around time. Our methodology is more effective in future scaled-down process with decreased SOI layer thickness.

The orbital portrait of quasi-periodic oscillation shows transition like change with the amplitude of external force in periodically forced van der Pol oscillator. This phenomenon originates from frequency pulling between self-sustained and periodic external oscillations induced by the frequency shift of former. We estimate this shift and succeed in deriving the transition points at which the portrait changes.

This paper proposes an electronic soccer lottery protocol suitable for the Internet environment. Recently, protocols based on public-key schemes such as digital signature have been proposed for electronic voting systems or other similar systems. For a soccer lottery system in particular, it is important to reduce the computational complexity and the amount of communication data required, because we must expect that a large number of tickets will be purchased simultaneously. These problems can be solved by introducing hash functions as the core of protocol. This paper shows a practical soccer lottery system based on bit commitment and hash functions, in which the privacy of prize-winners is protected and illegal acts by the lottery promoter or lottery ticket shops can be revealed.

There are two distinct types of maintenance action, namely preventive one and corrective one. Preventive maintenance is performed at regular intervals and can contribute significantly towards the increase of reliability and availability. It must be scheduled carefully in order that the availability is maximized through optimizing regular interval. On the other hand, corrective maintenance is performed when the system fails, and so the occurrence of corrective maintenance action is a random variable that cannot be predicted beforehand. From these considerations, it is clear that time is the most important factor in maintainability, and therefore, we classify maintenance data into two groups, that is, scheduled maintenance data and unscheduled maintenance one. Next, based on these classified data, we propose the new availability model which modifies Policy II proposed by R. Barlow and L. Hunter. Finally, we show the usefulness of the new model proposed here by applying these theoretical results to real data of some power plant.

A per-connection end-to-end call admission control (CAC) problem is solved in this paper to allocate network resources to an input session to guarantee its quality of service (Qos) requirements. In conjunction with the solution of the CAC problem, a traffic descriptor is proposed to describe the loss rate and the delay bound Qos requirements of the connection to be set up as well as the statistical characteristics of the associated input traffic which is modeled as a linear mean function plus a (zero-mean) fractional Brownian motion. The information in the traffic descriptor is sufficient to determine the allocation of channel bandwidth and buffer space to the input traffic in a network which employs leaky bucket shapers and scheduling algorithms to guarantee the Qos requirements. The CAC problem is solved by an iterative algorithm of which there are two stages in each iteration: one is responsible for the search of a candidate end-to-end routing path and the other for the verification of the legitimacy of this candidate path to meet the Qos requirements and for the allocation of resources in such a legitimate path.

Let S be a set of n points in the plane and CH(S) be the convex hull of S. We consider the problem of constructing an approximate convex hull which contains CH(S) with strong convexity. An ε-convex δ-superhull of S is a convex polygon P satisfying the following conditions: (1) P has at most O(n) vertices, (2) P contains S, (3) no vertex of P lies farther than δ outside CH(S), and (4) P remains convex even if its vertices are perturbed by as much as ε. The parameters ε and δ represent the strength of convexity of P and the degree of approximation of P to CH(S), respectively. This paper presents the first parallel method for the problem. We show that an ε-convex (8+42)ε-superhull of S can be constructed in O(log n) time using O(n) processors, or in O(log n) time using O(n/log n) processors if S is sorted, in the EREW-PRAM model. We implement the algorithm and find that the average performance is even much better: the results are more strongly convex and much more approximate to CH(S) than the theoretical analysis shows.

A convex hull is one of the most fundamental and interesting geometric constructs in computational geometry. Considerable research effort has focused on developing algorithms, both in serial and in parallel, for computing convex hulls. In particular, there are few problems whose parallel algorithms are so thoroughly studied as convex hull problems. In this paper, we review the convex hull parallel algorithms and their paradigm. We provide a summary of results and introduce several interesting topics including typical techniques, output-size sensitive methods, randomized approaches, and robust algorithms for convex hull problems, with which we may see the highlights of the whole research for parallel algorithms. Most of our discussion uses the PRAM (Parallel Random Access Machine) computational model, but still we give a glance at the results of the other parallel computational models such as mesh, mesh-of-trees, hypercube, recofigurable array, and models of coarse grained multicomputers like BSP and LogP.

Based on a cascode-driver source-follower buffer, and a passive sampling architecture, we have implemented a differential sample-and-hold circuit in a 0.8 µm digital CMOS process. The buffer which eliminates channel length modulation of the driver device behaves very linearly, in low frequencies or sampled-data applications. This is the main reason that this first open-loop CMOS sample-and-hold can achieves very high linearity while functions at very high sampling rate. The circuit achieved -61 dB THD for a 1.42 Vp-p 10 MHz input signal at a 103 MHz sampling rate and -55.9 dB THD for a 1.22 Vp-p 20 MHz at a 101 MHz sampling rate.