Capacitor mismatch is an important device parameter for precision analog applications. In the last ten years, the floating gate measurement technique has been widely used for its characterization. In this paper we describe the impact of leakage current on the technique. The leakage can come from, for example, thin gate oxide MOSFETs or high dielectric constant capacitors in advanced technologies. SPICE simulation, bench measurement, analytical model and numerical analyses are presented to illustrate the problem and key contributing factors. Criteria for accurate capacitor systematic and random mismatch characterization are developed, and practical methods of increasing measurement accuracy are discussed.

This paper presents a closed form solution to a problem of constructing the best lower bound of a convex function under certain conditions. The function is assumed (I) bounded below by -ρ, and (II) differentiable and its derivative is Lipschitz continuous with Lipschitz constant L. To construct the lower bound, it is also assumed that we can use the values ρ and L together with the values of the function and its derivative at one specified point. By using the proposed lower bound, we derive a computationally efficient deep monotone approximation operator to the level set of the function. This operator realizes better approximation than subgradient projection which has been utilized, as a monotone approximation operator to level sets of differentiable convex functions as well as nonsmooth convex functions. Therefore, by using the proposed operator, we can improve many signal processing algorithms essentially based on the subgradient projection.

Based on the clonal selection principle proposed by Burnet, in the immune response process there is no crossover of genetic material between members of the repertoire, i.e., there is no knowledge communication during different elite pools in the previous clonal selection models. As a result, the search performance of these models is ineffective. To solve this problem, inspired by the concept of the idiotypic network theory, an expanded lateral interactive clonal selection algorithm (LICS) is put forward. In LICS, an antibody is matured not only through the somatic hypermutation and the receptor editing from the B cell, but also through the stimuli from other antibodies. The stimuli is realized by memorizing some common gene segment on the idiotypes, based on which a lateral interactive receptor editing operator is also introduced. Then, LICS is applied to several benchmark instances of the traveling salesman problem. Simulation results show the efficiency and robustness of LICS when compared to other traditional algorithms.

ZigBee recently has been used a lot in wireless sensor networks because of its low power consumption and affordable chips. However, ZigBee's existing hierarchical routing algorithm has a disadvantage in that a node may communicate with a nearby node over several hops. In this letter we propose a Quasi-Hierarchical Routing (QHR) algorithm that can improve the ZigBee hierarchical routing method's inefficiency by using brief information on neighbors within radio range. The network simulation evaluates this QHR's performance by comparing it to other ZigBee routing schemes.

We propose an IP broadcasting system architecture using passive optical networks (PON) utilizing the optical broadcast links of a PON with a downstream bandwidth allocation algorithm to provide a multi-channel IP broadcasting service to home subscribers on single broadband IP network infrastructures. We introduce the design and adaptation of the optical broadcast links to effectively broadcast video contents to home subscribers. We present a performance analysis that includes the downstream bandwidth utilization efficiency of the broadcast link and the bandwidth control of the IP broadcasting and Internet data. Our analysis and simulation results show that the proposed system can provide 100 HDTV channels to every user over fiber lines. We also propose an IPTV channel selection mechanism in an ONT by selecting a broadcast stream. We developed and evaluated a prototype that can achieve a 15-msec IPTV channel selection speed.

Lightweight single-layer slotted waveguide array antennas are fabricated using plastic materials with metal-plating. A plastic material that has good heat-radiation properties is investigated. Three types of antennas are fabricated by milling, using ABS resin, heat-radiating plastic, and aluminum alloy. In measurements, all three types of antennas are confirmed to have almost the same VSWR and gain in the 25 GHz frequency band.

We present design procedures for using conducting wires in A-sandwich junctions to achieve high transmission performance; bench-test results validate the procedures. The scattering characteristics of the junction are obtained by solving the electric field integral equation of volumetric equivalent currents. The transmission performance is evaluated by subtracting the scattered fields of the same-sized A-sandwich panel in order to offset the effect of edge diffraction. Optimum wire width is determined by examining transmission performance with different arrangements. The designed junction achieves high transmission performance. The measured scattering characteristics of a bench model demonstrate the validity of the presented method.

This letter presents a 0.5 V low-voltage op-amp in a standard 0.18 µm CMOS process for switched-capacitor circuits. Unlike other two-stage 0.5 V op-amp architectures, this op-amp consists of CMOS inverters that utilize floating voltage sources and forward body bias for obtaining high-speed operation. And two improved common-mode rejection circuits are well combined to achieve low power and chip area reduction. Simulation results indicate that the op-amp has an open-loop gain of 62 dB, and a high unity gain bandwidth of 56 MHz. The power consumption is only 350 µW.

In recent years, there has been increasing demand to miniaturize wiring harness connectors in automobiles due to the increasing volume of electronic equipment and the reduction of the installation space allocated for the electronic equipment in automobiles for the comfort of the passengers. With this demand, contact failure caused by the fretting corrosion is expected to become a serious problem. In this report, we examined micro-structural observations of fretting contacts of two different tin plating thicknesses using Scanning Electron Microscopy (SEM) and Transmission Electron Microscopy (TEM) and so on. Based on the results, we compared the microstructure difference of fretting contact caused by the difference of the tin plating thickness.

This paper describes a novel optical fiber line testing system operating at 1.65 µm using test light bypass modules. We show a new testing configuration for add/drop multiplexer (ADM) ring networks. The test light bypass modules were installed in individual customer buildings so the test light can bypass the ADMs. We evaluated the bit-error performance with a 2.48832 Gbit/s ADM ring network using a prototype test light bypass module. We confirmed that this testing system can monitor the optical fiber cables of an ADM ring network, and that it causes no degradation in transmission quality. We show the operating area provided by the system dynamic range expressed in terms of fiber length and customer building number. The prototype system could monitor an ADM ring network linking five buildings with a 5 km loop. We also performed an in-service monitoring field trial in a 2.6 km ring network with three ADM nodes. This testing system enables us to reduce the operating, administration, and maintenance cost and improves the transmission quality of ADM ring networks.

In this paper, we propose a novel classifier-based object tracker. Our tracker is the combination of Rectangle Feature (RF) based detector [17],[18] and optical-flow based tracking method [1]. We show that the gradient of extended RFs can be calculated rapidly by using Integral Image method. The proposed tracker was tested on real video sequences. We applied our tracker for face tracking and car tracking experiments. Our tracker worked over 100 fps while maintaining comparable accuracy to RF based detector. Our tracking routine that does not contain image I/O processing can be performed about 500 to 2,500 fps with sufficient tracking accuracy.

Sensor networks that carry heterogeneous traffics and are responsible for reporting very time-critical important events necessitate an efficient and robust data dissemination framework. Designing such a framework, that can achieve both the reliability and delay guarantee while preserving the energy efficiency, namely multi-constrained QoS (MCQoS), is a challenging problem. Although there have been many research works on QoS routing for sensor networks, to the best of our knowledge, no one addresses the above three service parameters all together. In this paper, we propose a new aggregate routing model and a distributed aggregate routing algorithm (DARA) that implements the model for achieving MCQoS. DARA is designed for multi-sink, multipath and location aware network architecture. We develop probabilistic models for multipath reliability constraint, sojourn time of a packet at an intermediary node and node energy consumption. Delay-differentiated multi-speed packet forwarding and in-node packet scheduling mechanisms are also incorporated with DARA. The results of the simulations demonstrate that DARA effectively improves the reliability, delay guarantee and energy efficiency.

In networked control systems, uncontrollable events may unexpectedly occur in a plant before a proper control action is applied to the plant due to communication delays. In the area of supervisory control of discrete event systems, Park and Cho [5] proposed the notion of delay-nonconflictingness for the existence of a supervisor achieving a given language specification under communication delays. In this paper, we present the algebraic properties of delay-nonconflicting languages which are necessary for solving supervisor synthesis problems under communication delays. Specifically, we show that the class of prefix-closed and delay-nonconflicting languages is closed under intersection, which leads to the existence of a unique infimal prefix-closed and delay-nonconflicting superlanguage of a given language specification.

Using Bloom filters is one of the most popular and efficient lookup methods in P2P networks. A Bloom filter is a representation of data item indices, which achieves small memory requirement by allowing one-sided errors (false positive). In the lookup scheme besed on the Bloom filter, each peer disseminates a Bloom filter representing indices of the data items it owns in advance. Using the information of disseminated Bloom filters as a clue, each query can find a short path to its destination. In this paper, we propose an efficient extension of the Bloom filter, called a Deterministic Decay Bloom Filter (DDBF) and an index dissemination method based on it. While the index dissemination based on a standard Bloom filter suffers performance degradation by containing information of too many data items when its dissemination radius is large, the DDBF can circumvent such degradation by limiting information according to the distance between the filter holder and the items holders, i.e., a DDBF contains less information for faraway items and more information for nearby items. Interestingly, the construction of DDBFs requires no extra cost above that of standard filters. We also show by simulation that our method can achieve better lookup performance than existing ones.

The IEEE 1500 standard wrapper requires that its inputs and outputs be interfaced directly to the chip's primary inputs and outputs for controllability and observability. This is typically achieved by providing a dedicated Test Access Mechanism (TAM) between the wrapper and the primary inputs and outputs. However, when reusing the embedded Network-on-Chip (NoC) interconnect instead of the dedicated TAM, the standard wrapper cannot be used as is because of the packet-based transfer mechanism and other functional requirements by the NoC. In this paper, we describe two NoC-compatible wrappers, which overcome these limitations of the 1500 wrapper. The wrappers (Type 1 and Type 2) complement each other to optimize NoC bandwidth utilization while minimizing the area overhead. The Type 2 wrapper uses larger area overhead to increase bandwidth efficiency, while Type 1 takes advantage of some special configurations which may not require a complex and high-cost wrapper. Two wrapper optimization algorithms are applied to both wrapper designs under channel-bandwidth and test-time constraints, resulting in very little or no increase in the test application time compared to conventional dedicated TAM approaches.

A dynamic routing and wavelength assignment (RWA) algorithm encompassing physical impairment due to Four-Wave Mixing (FWM) is proposed, assuming conventional On-Off-Keying (OOK) modulation format. The FWM effect is one of the most severe physical impairments to be considered for the future photonic networks since the accumulation of FWM crosstalk causes a fatal degradation in the wavelength-routed optical network performance. A novel cost function is introduced based upon an impairment-constraint-based routing (ICBR) approach, taking into account the network utilization resources and the physical impairment due to FWM crosstalk. Simulations results show that the proposed algorithm leads to a more realistic system performance compared to those of related approaches of dynamic RWA that fail to consider physical impairments into the routing scheme.

As the performance of each node becomes higher, it is expected that the ad hoc network is used for the community network in which a few thousands of mobile nodes exist. In such a network, the number of hops between a source node and a destination node also becomes longer. However, as the route becomes longer, it is difficult to provide the robust and reliable route for mobile ad hoc networks since the multiple route breaks occur at the same time due to the topology change. Therefore, this paper proposes a Route-Split Routing resilient to simultaneous failure (RSR). RSR sets up multiple Subroute Management Nodes (SMN's) on the route and each SMN manages the subroute between the SMN and the neighboring SMN. When the multiple route breaks occur at the same time, each subroute is repaired by the SMN. Consequently, RSR can reduce the number of control packets used for the route repair and mitigate the network congestion even in case that the number of nodes in the network becomes very larger.

This paper proposes a MAC protocol for efficient broadcasting in wireless ad hoc networks. Pure flooding leads to serious redundant broadcasts, packet contention and packet collisions, known as the broadcast storm problem. This paper focuses on how to reduce the redundant broadcasts. Several protocols to achieve efficient broadcasting have been proposed. However a trade-off exists between the reachability and the broadcasting ratio, which is the ratio of the number of the broadcasting nodes to the number of received nodes. This paper proposes a new MAC protocol for on-demand broadcasting, which is referred to as dialogue-based protocol in order to resolve the trade-off. The dialogue-based protocol employs additional massages which are called as request packets and reply signals. They are exchanged in an on-demand manner, in order that relay candidate nodes recognize its neighbor nodes status whether they have already received the broadcast packets. Finally, by computer simulations, this paper presents that the dialogue-based scheme combines high reachability with low broadcasting ratio by using the low additional massages.

One of the most promising applications of a mobile ad hoc network is a vehicular ad hoc network (VANET). Each vehicle is aware of its position information by GPS or other methods, so position-based routing is a useful approach in VANET. The position-based routing protocol can be classified roughly into a next-hop forwarding method and a directed flooding method. We evaluate performance of both methods by analytic approach and compare them in this paper. From the evaluation results, we conclude that it is effective for the position-based routing to choose either the next-hop forwarding method or the directed flooding method according to the environment. Then we propose the hybrid transmission method which can select one of them according to the environment, and clarify that the proposed method can keep the packet delivery ratio at a high level and reduce the delay time.

A robust routing algorithm was developed based on reinforcement learning that uses (1) reward-weighted principal component analysis, which compresses the state space of a network with a large number of nodes and eliminates the adverse effects of various types of attacks or disturbance noises, (2) activity-oriented index allocation, which adaptively constructs a basis that is used for approximating routing probabilities, and (3) newly developed space compression based on a potential model that reduces the space for routing probabilities. This algorithm takes all the network states into account and reduces the adverse effects of disturbance noises. The algorithm thus works well, and the frequencies of causing routing loops and falling to a local optimum are reduced even if the routing information is disturbed.