This paper provides a novel normalized sign least-mean square (NSLMS) algorithm which updates only a part of the filter coefficients and simultaneously performs sparse updates with the goal of reducing computational complexity. A combination of the partial-update scheme and the set-membership framework is incorporated into the context of L∞-norm adaptive filtering, thus yielding computational efficiency. For the stabilized convergence, we formulate a robust update recursion by imposing an upper bound of a step size. Furthermore, we analyzed a mean-square stability of the proposed algorithm for white input signals. Experimental results show that the proposed low-complexity NSLMS algorithm has similar convergence performance with greatly reduced computational complexity compared to the partial-update NSLMS, and is comparable to the set-membership partial-update NLMS.

We present a low-complexity complementary pair affine projection (CP-AP) adaptive filter which employs the intermittent update of the filter coefficients. To achieve both a fast convergence rate and a small residual error, we use a scheme combining fast and slow AP filters, while significantly reducing the computational complexity. By employing an evolutionary method which automatically determines the update intervals, the update frequencies of the two constituent filters are significantly decreased. Experimental results show that the proposed CP-AP adaptive filter has an advantage over conventional adaptive filters with a parallel structure in that it has a similar convergence performance with a substantial reduction in the total number of updates.

In this paper we propose a novel RFID anti-collision technique that intelligently combines polling and random access schemes. These two fundamentally different medium access control protocols are coherently integrated in our design while functionally complementing each other. The polling mode is designed to enable fast collision-free identification for the tags that exist within reader's coverage across the sessions. In contrast, the random access mode attempts to read the tags uncovered by the polling mode. Our proposed technique is particularly suited for a class of RFID applications in which a stationary reader periodically attempts to identify the tags with slow mobility. Numerical results show that our proposed technique yields much faster identification time against the existing approaches under various operating conditions.

Broadband subscriber loop system and ATM switching system are the key equipment for construction of Broadband networks. In this paper, we describe the architecture of access network and the implementation of ATM switching system with multi-service interface for construction of broadband access network. We also represent the design of MAIN-AN (Multi-service Access Integrated Network--Access Node) system as integrated access network platform which enables to accommodate ATM/SDH-based and ATM/PON-based FTTx (Fiber-To-The-x) access architecture simultaneously. The system has a Cross-point ATM Switch Fabric with 10 Gbits/sec throughput and it has been implemented using 0.5 µm CMOS technology. For performance evaluation of it, we simulate it under burst traffic conditions. In addition, we show the implementation of prototype of ASIC (Application Specific Integrated Circuit), MAIN system and its core PBA (Printed circuit Board Assembly) and so on.

MEMS storage devices are new non-volatile secondary storages that have outstanding advantages over magnetic disks. MEMS storage devices, however, are much different from magnetic disks in the structure and access characteristics in the following ways. They have thousands of heads called probe tips and provide the following two major access facilities: (1) flexibility : freely selecting a set of probe tips for accessing data, (2) parallelism: simultaneously reading and writing data with the set of probe tips selected. Due to these characteristics, it is nontrivial to find data placements that fully utilize the capability of MEMS storage devices. In this paper, we propose a simple logical model called the Region-Sector (RS) model that abstracts major characteristics affecting data retrieval performance, such as flexibility and parallelism, from the physical MEMS storage model. We also suggest heuristic data placement strategies based on the RS model. To show the usability of the RS model, we derive new data placements for relational data and two-dimensional spatial data by using these strategies. Experimental results show that the proposed data placements improve the data retrieval performance by up to 4.7 times for relational data and by up to 18.7 times for two-dimensional spatial data of approximately 320 Mbytes compared with those of existing data placements. Further, these improvements are expected to be more marked as the database size grows.

3D virtual environment provides a limited amount of information, mainly focusing on visual information. This is the main cause of users losing the sense of direction in the environment. Many researches for developing a navigation tools that address this problem have been carried out. In this study, a navigation tool is designed by applying topic map, one of the technologies for semantic web construction, to a 3D virtual environment. Topic map constructs a semantic link map by defining the connection relation between topics. According to an experiment done to evaluate the proposed navigation tool, the tool was more helpful in finding detailed object than highly represented objects. Also, it could be seen that providing the surrounding knowledge is effective for object selection by users when that target for searching is not defined.

In memory design, the issue is smaller size and low power. Most power used in the ROM is consumed in line capacitance such as address lines, word lines, bit lines, and decoder. This paper presents ROM design of a novel HG (Half Grouping) compression method so as to reduce the parasitic capacitance of bit lines and the area of the row decoder for power consumption and chip area reduction. ROM design result of 512 point FFT block shows that the proposed method reduces 40.6% area, 42.12% power, and 37.82% transistor number respectively in comparison with the conventional method. The designed ROM with proposed method is implemented in a 0.35 µm CMOS process. It consumes 5.8 mW at 100 MHz with a single 3.3 V power supply.

In this paper, we present a recently developed pattern search method called Genetic Pattern Search algorithm (GPSA) for the global optimization of cost function subject to simple bounds. GPSA is a combined global optimization method using genetic algorithm (GA) and Digital Pattern Search (DPS) method, which has the digital structure represented by binary strings and guarantees convergence to stationary points from arbitrary starting points. The performance of GPSA is validated through extensive numerical experiments on a number of well known functions and on robot walking application. The optimization results confirm that GPSA is a robust and efficient global optimization method.

In this paper, based on the variation of the modified Booth encoding method, an efficient modified Booth multiplier design method for predetermined coefficient groups is proposed. In the case of pulse-shaping filter design used in CDMA, it is shown that by the proposed method, area and power consumption can be reduced up to 44% and 48%, respectively, compared with the conventional designs. Also, it is shown that in the case of 128-point radix-24 FFT, the area and power consumption can be reduced by 18% and 36%, respectively.

The performance of a cellular CDMA system operating over a flat-Rayleigh fading channel was previously considered, where it was assumed that the coherent bandwidth of a channel exceeded the spread bandwidth of a signal. This assumption may not be correct for a large degree of spreading. Therefore, the channel is modeled as exhibiting frequency-selectivity. In this paper, we consider a cellular radio DS/CDMA system operating over a frequency-selective fading channel. The base-to-mobile link is modeled as a Rician fading channel, with all signals transmitted from a given base station fading in unison. A similar model for the mobile-to-base link is used, except that the waveforms from all users are assumed to experience independent fading. The capacity of the cellular radio DS/CDMA system operating over a frequency-selective fading channel is evaluated and compared to that over a flat Rayleigh fading channel.

In modems for burst transmission of digital data, rapid carrier and clock synchronization are essential. Typically, frequency correction occurs prior to phase recovery since estimators are sensitive to frequency offsets. In this paper, we derive the bit error rate (BER) performance of a M-ary phase shift keying (MPSK) receiver in a closed form when there is no frequency offset estimator. Then we derive a relationship of the required burst length for certain BER with frequency offset estimator. To obtain the BER=10-4, approximately we need the burst length of 101 at Eb/N0=10 dB and 69 at Eb/N0=15 dB.

A 116 arrayed waveguide grating multiplexer operating around 1550 nm has been realized using newly synthesized fluorinated poly(arylene ethers). The channel spacing is 0.8 nm (100 GHz). The insertion loss of the multiplexer is 17-20 dB and the cross talk is less than -15 dB. The propagation loss of a rib waveguide is less than 0.5 dB/cm at 1550 nm.

To enhance the extinction ratio (ER) of NRZ-to-inverted-RZ converter based on cross-gain compression of a semiconductor optical amplifier (SOA), a modified terahertz optical asymmetric demultiplexer (TOAD) is cascaded. ER is improved from 1.6-6.7 dB to 5.4-14.5 dB, depending on the intensity of input optical NRZ signal. The proposed NRZ-to-inverted-RZ converter enhances and regulates ER to a high value (14.5 dB) for very wide optical NRZ signal intensity range.

The proposed automated scoring system for English writing tests provides an assessment result including a score and diagnostic feedback to test-takers without human's efforts. The system analyzes an input sentence and detects errors related to spelling, syntax and content similarity. The scoring model has adopted one of the statistical approaches, a regression tree. A scoring model in general calculates a score based on the count and the types of automatically detected errors. Accordingly, a system with higher accuracy in detecting errors raises the accuracy in scoring a test. The accuracy of the system, however, cannot be fully guaranteed for several reasons, such as parsing failure, incompleteness of knowledge bases, and ambiguous nature of natural language. In this paper, we introduce an error-weighting technique, which is similar to term-weighting widely used in information retrieval. The error-weighting technique is applied to judge reliability of the errors detected by the system. The score calculated with the technique is proven to be more accurate than the score without it.

The Android pattern unlock is a popular graphical password scheme, where a user is presented a 3×3 grid and required to draw a pattern on the onscreen grid. Each pattern is a sequence of at least four contact points with some restrictions. Theoretically, the security level of unlock patterns is determined by the size of the pattern space. However, the number of possible patterns is only known for 3×3 and 4×4 grids, which was computed by brute-force enumeration. The only mathematical formula for the number of possible patterns is a permutation-based upper bound. In this article, we present an improved upper bound by counting the number of “visible” points that can be directly reached by a point.

We propose a new channel adaptive distributed video coding algorithm, which is adaptive to time-varying available bitrate and packet loss ratio. The proposed method controls the quantization parameter according to channel condition of especially error-prone mobile channel. Simulation shows that the proposed algorithm outperforms the conventional rate-control-only algorithm.

In this paper, we propose a method of resizing images in the integer DCT domain employed by H.264/AVC. To accomplish this, we first derive the matrix scaling the image resolution, and then factorize the scaled DCT blocks and the post scaling factors (PF) from the matrix obtained from the multiplication of the scaling matrix and the original integer DCT blocks. Then, we separate the scaled DCT blocks into the integer scaling matrix and the scaled integer DCT blocks. The experiments show that the proposed method produces nearly the same performance as those operating in the real DCT domain.

In the H.264 video coding standard, 7 modes {1616, 168, 816, 88, 84, 48, 44} are used to enhance the coding efficiency. The motion vector estimation with 7 modes may require huge computing time. Thus, several efficient ME schemes have been proposed to reduce the complexity of ME module in H.264. In this paper, we propose a ME scheme using a modified early termination technique to speed up the motion vector estimation procedure while maintaining high image quality. We demonstrate the effectiveness of the proposed method by computer simulation. In the simulation results, the CPU time consumed by the proposed scheme is much less than that of the conventional scheme while the encoded video quality remains unchanged. This is due to the fact that the proposed scheme searches MVs from the smallest block mode to the largest block mode, and utilizes the correlation between neighbor MVs. Furthermore, the process of the proposed ME scheme can bypass to the next mode when the MVs of a mode are highly correlated with each other, while the conventional schemes can not skip to other modes.

We analyze the performance of an opportunistic transmission strategy for Wireless Sensor Networks (WSNs). We consider a transmission strategy called Binary Decision-Based Transmission (BDT), which is a common form of opportunistic transmission. The BDT scheme initiates transmission only when the channel quality exceeds the optimum threshold to avoid unsuccessful transmissions that waste energy. We formulate the Markov Decision Process (MDP) to identify an optimum threshold for transmission decisions in the BDT scheme.

A new approach is presented for recovering the 3-D shape from shading image. Photometric Stereo Method (PSM) is generally based on the direct illumination. PSM in this paper is modified with the indirect diffuse illumination method (IDIM), and then applied to hybrid reflectance model which consists of two components; the Lambertian reflectance and the specular reflectance. Under the hybrid reflectance model and the indirect diffuse illumination circumstances, the 3-D shape of objects can be recovered from the surface normal vector extracted from the surface roughness, the surface reflectance ratio, and the intensity value of a pixel. This method is rapid because of using the reference table, simplifies the restriction condition about the reflectance function in prior studies without any loss in performance, and can be applied to various types of surfaces by defining general reflectance function.