We present a low power architecture that dynamically controls wordlengths in a wireless OFDM demodulator. Finding the optimum wordlength for digital circuit systems is difficult because the trade-off between the hardware cost and system performance is not conclusive. Actual circuit systems have large wordlengths at the circuit design level to avoid calculation errors caused by a lack of dynamic range. This indicates that power dissipation can still be reduced under better conditions. We propose a tunable wordlength architecture that dynamically changes its own wordlength according to the communication environment. The proposed OFDM demodulator measures error vector magnitudes (EVMs) from de-modulated signals and tunes the wordlength to satisfy the required quality of communication by monitoring the EVM performance. The demodulator can reduce dissipated energy by a maximum of 32 and 24% in AWGN and multipath fading channels.

We study a modification method for constructing low-density parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results that the performance of codes permuted by our method are better than that of the original codes, especially with two or more solid burst erasures.

A high-speed drive technique is introduced in which addressing is done by eliminating, instead of accumulating, the wall charges. In the proposed scheme, wall charges are accumulated in all the cells in advance, and then the address discharges take place in selected cells to eliminate the wall charges. Sustain discharges are generated in these cells. In order to realize the proposed address scheme, re-designing of a setup waveforms was necessary. The data pulse of 1.33 µs wide and 84 V was realized in a Ne+10%Xe PDP. A contrast of 3,600:1 was obtained by providing one setup period in a TV field.

We investigated luminescent properties in combination of red emissive europium complex of tris(dibenzoylmethane)-mono(4,7-dimethylphenanthroline)europium(III) [Eu(dbm)3phen] and blue phosphorescent molecule of bis[(4,6-difluorophenyl)-pyridinato-N,C2'] (picolinate) iridium (III) (FIrpic) doped in poly(N-vinyl-carbazole) (PVK). A sharp red emission from Eu(dbm)3phen was observed in photoluminescence (PL) measurement, whereas, in the case of electroluminescence (EL), emission from FIrpic and Eu compound were observed. The difference of the PL and EL spectra indicates that different energy transfer processes between Eu(dbm)3phen and FIrpic are suggested.

This paper proposes efficient DSP instructions and their hardware architecture for the Viterbi algorithm. The implementation of the Viterbi algorithm on a DSP chip has been attracting more interest for its flexibility, programmability, etc. The proposed architecture can reduce the Trace Back (TB) latency and can support various wireless communication standards. The proposed instructions perform the Add Compare Select (ACS) and TB operations in parallel and the architecture has special hardware, called the Offset Calculation Unit (OCU), which automatically calculates data addresses for acceleration of the trellis butterfly computations. When the constraint length K is 5, the proposed architecture can reduce the decoding cycles about 17% compared with Carmel DSP and about 45% compared with TMS320C55x.

LSI testing is critical to guarantee chips are fault-free before they are integrated in a system, so as to increase the reliability of the system. Although full-scan is a widely adopted design-for-testability technique for LSI design and testing, there is a strong need to reduce the test data Volume, scan-in Power dissipation, and test application Time (VPT) of full-scan testing. Based on the analysis of the characteristics of the variable-to-fixed run-length coding technique and the random access scan architecture, this paper presents a novel design scheme to tackle all VPT issues simultaneously. Experimental results on ISCAS'89 benchmarks have shown on average 51.2%, 99.5%, 99.3%, and 85.5% reduction effects in test data volume, average scan-in power dissipation, peak scan-in power dissipation, and test application time, respectively.

A hardware algorithm for integer division is proposed. It is based on the radix-2 non-restoring division algorithm. Fast computation is achieved by the use of the radix-2 signed-digit (SD2) representation. The algorithm does not require normalization of the divisor, and hence, does not require an area-consuming leading-one (or zero) detection nor shifts of variable-amount. Combinational (unfolded) implementation of the algorithm yields a regularly structured array divider, and sequential implementation yields compact dividers.

A new fast and reliable image objective quality evaluation technique is presented in this paper. The proposed method takes image structure into account and uses a low complexity homogeneity measure to evaluate the intensity uniformity of a local region based on high-pass operators. We experimented with monochrome images under different types of distortions. Experimental results indicate that the proposed method provides better consistency with the perceived image quality. It is suitable for real applications to control the processed image quality.

This paper deals with a synthesis of a nonautonomous system with a stable limit cycle. We propose a synthesis method of a nonautonomous system whose transient trajectories converge to a prescribed limit cycle. We use receding horizon control to control a transient behavior of the nonautonomous system, and confirm its validity by simulation.

Distributed denial-of-service attacks on public servers have recently become more serious. More are SYN Flood attacks, since the malicious attackers can easily exploit the TCP specification to generate traffic making public servers unavailable. To assure that network services will not be interrupted, we need faster and more accurate defense mechanisms against malicious traffic, especially SYN Floods. One of the problems in detecting SYN Flood traffic is that server nodes or firewalls cannot distinguish the SYN packets of normal TCP connections from those of SYN Flood attack. Moreover, since the rate of normal network traffic may vary, we cannot use an explicit threshold of SYN arrival rates to detect SYN Flood traffic. In this paper we introduce a mechanism for detecting SYN Flood traffic more accurately by taking into consideration the time variation of arrival traffic. We first investigate the statistics of the arrival rates of both normal TCP SYN packets and SYN Flood attack packets. We then describe our new detection mechanism based on the statistics of SYN arrival rates. Our analytical results show that the arrival rate of normal TCP SYN packets can be modeled by a normal distribution and that our proposed mechanism can detect SYN Flood traffic quickly and accurately regardless of time variance of the traffic.

An end-user who wants to participate in group communication on the Internet must first resolve the session information including the contents type, data source and destination addresses. An effective session directory system is therefore the necessary component for the delivery of the maximum group communication value to a large number of world-wide users. In this paper, we formalize a distributed session directory system called "Channel Reflector (CR)." The advantage of CR is that, while an end-user can retrieve interesting session information from CR through a regular web interface, there is no contradiction to the dynamic nature of the session announcement scheme and the scoping technique in this architecture. For the deployment purpose, we show the actual implementation and the measurement results on the session synchronization delay given by the PlanetLab overlay network testbed.

CMOS poly-Si thin-film transistors (TFTs) were fabricated through crystallization and GILD processes by a novel selected area laser assisted (SALA) system. The system enables a local area irradiation of small beams of a pulsed solid-state laser of frequency tripled Nd:YAG. The novel TFT process eliminated 3 doping mask steps of the conventional process. On-off current ratios for both types of poly-Si TFTs were improved by SALA. The field effect mobility of n- and p-channel TFTs is 84 cm2/Vs and 75 cm2/Vs, respectively.

Network topology has no direct effect on the correctness of network protocols, however, it influences the performance of networks and their survivability when they are under attack. Recent studies have analyzed the robustness of the Internet in the face of faults or attacks which may cause node failures. However, the effect of link failure or a series of link failures has not been extensively examined, even though such a situation is more likely to occur in the current Internet environment. In this paper, we propose an attack-and-failure graph model and practical techniques for attacking strategies against nodes, edges or paths in order to reflect real-life attack scenarios. The resiliency of Internet topologies is examined under the attacking strategies, with various metrics including path-failure ratio and "attack power," which is defined as the ratio of the failure to attack. The experiments reveal that "path-based" attacks can result in greater damage to the connectivity of a network than the other types of attack. Nonetheless, the effectiveness of an attack depends on the objective that the attacker wants to achieve through the attack. The proposed simple but formalized approach can be a springboard for developing more resilient Internet topologies in a variety of aspects.

Recently, Waters proposed a provably secure signature schemes in the standard model. In this letter, we analyse the security of this signature scheme. We found that the signature scheme is subjected to key substitution attack and is malleable.

Providing multimedia services with a quality-of-service guarantee in mobile wireless networks presents more challenges due to user's mobility and limited bandwidth resource. In order to provide seamless multimedia services in the next-generation wireless networks, efficient call admission control algorithm must be developed. A novel borrowing-based call admission control policy is proposed in this paper as a solution to support quality-of-service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth allocation and call admission by employing attribute-measurement mechanism, dynamic time interval reservation strategy, and service-based borrowing strategy in each base station. We use the dynamically adaptive approaches to reduce the connection-blocking probability and connection-dropping probability, and to increase the bandwidth utilization, while the quality-of-service guarantees can be maintained at a comfortable level for mobile multimedia wireless networks. Extensive simulation results show that our proposed scheme outperforms the previously proposed scheme in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization, while providing highly satisfying degree of quality-of-service in mobile communication systems.

In this article, the security of double-block-length hash functions with the rate 1 is analyzed, whose compression functions are composed of block ciphers with their key length twice larger than their block length. First, the analysis by Satoh, Haga and Kurosawa is investigated, and it is shown that there exists a case uncovered by their analysis. Second, a large class of compression functions are defined, and it is shown that they are at most as secure as those of single-block-length hash functions. Finally, some candidate hash functions are given which are possibly optimally collision-resistant.

The pseudo-transient method is discussed in this paper as one of practical methods to find DC operating points of nonlinear circuits when the Newton-Raphson method fails. The mathematical description for this method is presented and an effective pseudo-transient algorithm utilizing compound pseudo-elements is proposed. Numerical examples are demonstrated to prove that our algorithm is able to avoid the oscillation problems effectively and also improve the simulation efficiency.

Designable task allocation systems which consist of identical agents using stochastic automata are suggested. From the viewpoint of the group response and the individual behavior, the performances of a simple model and an improved one are compared numerically. Robots experiments are performed to compare between the two models.

We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MDBF decoding and compare the proposed MDBF decoding with conventional hard-in decoding.

Gastric cancer is a great part of the cancer occurrence and the mortality from cancer in Korea, and the early detection of gastric cancer is very important in the treatment and convalescence. This paper, for the early detection of gastric cancer, proposes the analysis system of an endoscopic image of the stomach, which detects abnormal regions by using the change of color in the image and by providing the surface tissue information to the detector. While advanced inflammation or cancer may be easily detected, early inflammation or cancer is difficult to detect and requires more attention to be detected. This paper, at first, converts an endoscopic image to an image of the IHb (Index of Hemoglobin) model and removes noises incurred by illumination and, automatically detects the regions suspected as cancer and provides the related information to the detector, or provides the surface tissue information for the regions appointed by the detector. This paper does not intend to provide the final diagnosis of abnormal regions detected as gastric cancer, but it intends to provide a supplementary mean to reduce the load and mistaken diagnosis of the detector, by automatically detecting the abnormal regions not easily detected by the human eye and this provides additional information for diagnosis. The experiments using practical endoscopic images for performance evaluation showed that the proposed system is effective in the analysis of endoscopic images of the stomach.