2-Factor covering designs, a type of combinatorial designs, have recently received attention since they have industrial applications including software testing. For these applications, even a small reduction on the size of a design is significant, because it directly leads to the reduction of testing cost. In this letter, we report ten new designs that we constructed, which improve on the previously best known results.

This paper presents a case study of synthesis of the industrial embedded microcontroller HT48100 and analysis of performance, cost and software compatibility for its implementation alternatives, using the hardware/software co-design system for microcontrollers/microprocessors PIPER-II. The synthesis tool accepts as input the instruction set architecture (behavioral) specification, and produces as outputs the pipelined RTL designs with their simulators, and the reordering constraints which guide the compiler backend to optimize the code for the synthesized designs. A compiler backend is provided to optimize the application software according to the reordering constraints. The study shows that the co-design approach was able to help the original design team to analyze the architectural properties, identify inefficient architecture features, and explore possible architectural improvements and their impacts in both hardware and software. Feasible future upgrades for the microcontroller family have been identified by the study.

This paper presents an active vision system for on-line traffic sign recognition. The system is composed of two cameras, one is equipped with a wide-angle lens and the other with a telephoto lens, and a PC with an image processing board. The system first detects candidates for traffic signs in the wide-angle image using color, intensity, and shape information. For each candidate, the telephoto-camera is directed to its predicted position to capture the candidate in a larger size in the image. The recognition algorithm is designed by intensively using built-in functions of an off-the-shelf image processing board to realize both easy implementation and fast recognition. The results of on-road experiments show the feasibility of the system.

The two-sample locally optimum rank detector test statistics for composite signals in additive, multiplicative, and signal-dependent noise are obtained in this letter. Compared with the structure of the one-sample locally optimum rank detector, that of the two-sample locally optimum rank detector is shown to be simpler, although it needs more computations. It is known that there is a trade-off of computational complexity and structural simplicity between the one- and two-sample detectors.

This letter presents text-independent speaker identification results for telephone speech. A speaker identification system based on Karhunen-Loeve transform (KLT) derived from codebook design using genetic algorithm (GA) is proposed. We have combined genetic algorithm (GA) and the vector quantization (VQ) algorithm to avoid typical local minima for speaker data compression. Identification accuracies of 91% were achieved for 100 Mandarin speakers.

In this letter, our proposed approach exploits the use of original and simplest Cellular Neural Network (CNN) for 2D Doubly Complementary (DC) Infinite Impulse Response (IIR) filter banks design. The properties of feedback and feedforward templates are studied for this purpose. Through some examples it is shown how generalizations of these templates can be used for DC IIR filter banks design. We modify Lagrangian function which is used for optimizing a low-pass filter design considering the constraint for stability of CNN. The brief conclusions with design examples that illustrate the proposed method and an image enhancement and restoration applications of designed filter banks are presented.

This paper proposes a new blind adaptive algorithm for computing the weight vector of an antenna array system. The new technique utilizes a Generalized On-Off algorithm to obtain the weight vector from the pilot channel of IS2000 1X system, of which the processing gain can be controlled arbitrarily. The proposed algorithm generates a suboptimal weight vector maximizing the SINR (signal to interference plus noise ratio) with a linear computational load. Based on the analysis obtained from various simulations, it is observed that the proposed algorithm is suitable for the practical IS2000 1X mobile communication environments.

The one-sample locally optimum rank detector test statistics for composite signals in multiplicative and signal-dependent noise are obtained. Since the one-sample locally optimum rank detector makes use of the sign statistics of observations as well as the rank statistics, both 'even' and 'odd' score functions have to be considered. Although the one-sample locally optimum rank detector requires two score functions while the two-sample detector requires only one score function, the one-sample detector requires fewer calculations since it has to rank fewer observations.

In this paper a new MOS charge pump architecture is presented, where a clock generator is used in each pump stage of the charge pump circuit to elevate voltage exponentially with stages. This charge pump with a clock level shifter is designed to run at an optimized operation frequency, which can make an excellent compromise between the rise time and the dynamic power dissipation. With less stages than the linear-cascade circuit, the power dissipation and the area of the novel charge pump circuit are markedly decreased. The simulating comparison results based on 1.2 µm CMOS, p-substrate double-poly double-metal process parameters show that the nonlinear charge pump with a high pumping efficiency can supply a steady 1 mA, 16 v output for portable LCDs.

Wang et al., in 2000, proposed a generalized group-oriented threshold signature scheme and a generalized authenticated encryption scheme with shared verification. Tseng et al., in 2001, showed that both schemes are insecure, because any attacker is able to reveal the group secret keys from two previously valid threshold signatures. They further presented two improvements on Wang et al.'s schemes to against the attacks. Unfortunately, this paper will show that the improved schemes are still breakable.

In this paper, we propose an improved CDMA/PRMA protocol named CDMA/CAC (Code Assignment Control). In the proposed protocol, each terminal can be assigned spreading code by simple control before packet transmission. We introduce the permission probability for code request. The permission probability for code request restricts the number of terminals requesting code in order to avoid the collision of request signal adaptively to traffic load. In the proposed protocol with enhanced mode, the voice terminals have priority in initial access by setting the permission probability to 1. Also in this protocol, the data terminals can transmit packets continuously if necessary. We carry out the performance evaluation of the protocols by computer simulation and confirm their validity.

This paper presents the transmission performance of a class-IV partial-response signaling SSB system and proposes a method that can improve its power efficiency. A line code that has no dc component has been used in the SSB transmission of digital signals. The type of line code, such as a partial-response signaling, increases the modulation states, and as a result, decreases the power efficiency. To overcome this obstacle, a new demodulation method called "re-filtering and combining" is proposed on the assumption of orthogonal phase detection. The demodulated quadrature channel is re-filtered by a Hilbert filter and is combined with the in-phase channel. It is confirmed by computer simulations that the new demodulation method improves the BER performance and a 3 dB improvement of the power efficiency is obtained.

This paper presents a comprehensive investigation of three optical wavelength-division multiplexed (WDM) mesh network protection approaches, namely minimal cost, single link basis and disjoint path approaches. The operation of each approach is described and their performances are extensively evaluated and compared. Key aspects that are taken into the consideration and comparison of the designs include a spare capacity requirement, ease of operation and practical feasibility. A mathematical model based on integer linear programming is introduced to obtain a lower bound on the spare capacity requirement for full protection against all single link failures. Two heuristic algorithms have also been developed to perform wavelength resource allocation under both normal and failure conditions for both systems with and without wavelength conversion capability. It is shown that the minimal cost approach can accomplish the lowest extra cost requirement for protection, but this approach is considered not appropriate for practical applications due to complicated restoration and management. The single link basis scheme is on the other hand more practical and very cost efficient. For the disjoint path technique, the cost for spare capacity is generally slightly greater than that of the single link basis scheme. Its main advantages lie in the simple re-configuration and inherent protection against node failure for in-transit traffic. Finally, a new framework for obtaining a good spare capacity cost estimate of a mesh restorable network is presented.

This paper deals with formal verification of high-level designs, in particular, symbolic comparison of register-transfer-level descriptions and behavioral descriptions. We use state machines extended by quantifier-free first-order logic with equality, as models of those descriptions. We cannot adopt the classical notion of equivalence for state machines, because the signals in the corresponding outputs of such two descriptions do not change in the same way. This paper defines a new notion of consistency based on signal-transitions of the corresponding outputs, and proposes an algorithm for checking consistency of those descriptions, up to a limited number of steps from initial states. As an example of high-level designs, we take a simple hardware/software codesign. A C program for digital signal processing called PARCOR filter was compared with its corresponding design given as a register-transfer-level description, which is composed of a VLIW architecture and assembly code. Since this example terminates within approximately 4500 steps, symbolic exploration of a finite number of steps is sufficient to verify the descriptions. Our prototype verifier succeeded in the verification of this example in 31 minutes.

We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs O(N) computations, and thus inefficient, where N indicates the divisibility precision. For example, in case of N=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of N=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other N which is more than about 100.

Unlike in existing mobile networks, a variety of services having different quality requirements will be provided in future mobile networks, where any single group of service users can not characterize the whole traffic distribution in the system. Beginning at the mobile network design, the population of service subscribers is estimated and then base stations are located. As the service market evolves, the volume of users might grow or the population of users distributed between the multiple services as well as the located cells might change. In this case, two questions are of interest: how much growth in user population and what change in user distribution can be accommodated in the current cell configuration. If such shifts could not be admitted, current frequency and base station allocations should be expanded or reallocated. In this paper, we provide a framework that can decide whether the present network configuration is able to admit the changes of interest. Admissibility decision rules are addressed with proofs.

Load/unload techniques are widely used in mobile hard disk drives which have to endure external shocks frequently. ABS designs must consider both the load/unload performance and the shock resistance performance. Three ABS designs with different positions of the suction force center are studied in simulation. It is observed that when the position of the suction force center moves frontward, the anti-shock performance improves, but the unload performance degrades, and vice versa. A slider is not necessary to be designed to have its suction force center significantly behind of its geometric center, as the traditional load/unload sliders do. Instead, the suction force center can be designed near the geometric center if the hook limiter is used.

This paper proposes an operation-region model for analyzing and testing analog and mixed-signal circuits, which is based on observation of change in MOSFET operation regions. First, the relation between the change in MOSFET operation regions and the fault behavior of a mixed-signal circuit containing a bridging fault is investigated. Next, we propose an analysis procedure based on the operation-region model and apply it to generate the optimal input combination for testing the circuit. We also determine which transistors should be observed in order to estimate the circuit behavior. Since the operation-region model is a method for modeling circuit behavior abstractly, the proposed method will be useful for modeling circuit behavior and for analyzing and testing many kinds of analog and mixed-signal circuits.

In loudspeaker-based 3D audio systems, there are some acoustic crosstalk cancellation methods to enlarge the 'sweet spot' around a fixed listener position. However, these methods have common defect that most of them can be applied only to the specific narrow frequency band. In this letter, we propose the more robust acoustic crosstalk cancellation method so that we can cancel the crosstalk signal in far wider frequency band and enlarge 'sweet spot. ' For this goal, we apply a sum and difference filter to the conventional three loudspeaker-based 3D audio system.

Using less wavelengths to serve more communication channels is one of the primary goals in the design of WDM networks. By installing wavelength converters at some nodes in a network, the number of wavelengths needed can be reduced. It has been observed that the more converters installed in a network, the less number of wavelengths is needed, given the same network load. In this paper, we study the relationship between the number of converters and the number of wavelengths needed in a system, and propose a suite of theories and results on how to place the minimal number of converters in the system so that the number of wavelengths W is at most a constant α times the maximal link load L (i.e., W α L), where α = 3/2 or 5/3. The results show a significant saving of converters in networks of both special topologies and general topology.