In this paper, we describe the implementation of the proposed single user type CDMA adaptive interference canceller (AIC) with RAKE structure in the developed testbed for the base station, and evaluate its performance in the multiuser and multipath fading environment. Laboratory experiment demonstrates that the AIC receiver is much more near-far resistant than the conventional matched filter (MF) receiver in the multiuser case. When the power of the other users is 6 dB larger than that of the desired user, the AIC receiver can achieve the BER of 10-3 at C/PG = 33. 3 % in the 2-path fading channel, while the MF receiver cannot achieve the BER at C/PG of more than 20. 8%. Furthermore, we evaluate the effect of transmission power reduction in the transmitter with transmission power control (TPC). The experimental result shows that the required transmission power can be greatly reduced by 3. 0 dB and 9. 2 dB with the AIC receiver at C/PG = 29. 2 % and 33. 3%, respectively.

One of unique features of CDMA slotted ALOHA (CDMA S-ALOHA) is that user must synchronize his transmission to given slot. Thus orthogonal sequence as spreading sequence would achieve ideal throughput if each of packets accomplish perfect synchronization. In the presence of any ambiguity in synchronizations, however, quasi-synchronous (QS) sequences suit well with CDMA S-ALOHA system. In this paper, we introduce new QS-sequences obtained from the orthogonal Gold sequences and discuss their performance when applying to CDMA S-ALOHA systems. As a result, withstanding to access timing error, good performance is ensured with this sequence under the environment of AWGN, MAI (multiple access interference) and frequency non-selective fading, that is, micro or pico cellular systems and indoor wireless LANs.

A convenient signaling scheme, termed orthogonal on-off BPSK (O3BPSK), along with a simple one-shot linear decorrelating detector (LDD) has been proposed by Zheng and Barton as a technique for near-far resistant detection in the asynchronous DS/CDMA systems. The temporally adjacent bits from different users in the received signals are decoupled by using the on-off signaling, and the data rate is maintained with no increase in transmission rate by adopting an orthogonal structure. The system performance of this signaling scheme in terms of bit error rate (BER) has been analyzed over an AWGN channel by Zheng and Barton. In this paper, we further study the system performance over Nakagami-m fading channel. A closed form for the BER of such a scheme is successfully derived. Numerical results show that the O3BPSK signal scheme along with the LDD receiver still offers a good near-far resistant property over Nakagami-m channel.

The binary parallel concatenated codes called turbo codes provide relatively large coding gains with reasonable computation complexity. The application of turbo codes to a coherent DS-CDMA mobile radio link with antenna diversity and coherent RAKE combining is considered. A soft-in/soft-out Viterbi decoder that requires less computation complexity is employed instead of maximum a posteriori probability (MAP) decoder. The effect of turbo codes on the achievable bit error rate (BER) performance in frequency selective multipath fading channels is evaluated by computer simulation. It is demonstrated that turbo codes can achieve better BER performance than convolutional codes having the same code rate for the relatively large interleaver size. How the coding gains are impacted by the interleaver size and constraint length of the turbo codes and by the propagation channel condition (power delay profile, the number of resolvable propagation paths, and the maximum Doppler frequency) is discussed.

CEFLAR is one way of realizing ATM-ABR with no cell loss. This paper shows that the transition characteristics of CEFLAR(transition time to achieve fair share), important when addressing network fairness, strongly depend on the acceleration-ratio coefficient, not the rate decrease factor or the distance between source and congestion estimation nodes. This paper also shows that the average throughput of a transmission line in transition degrades as the rate decrease factor decreases and as the distance between the source and congestion estimation nodes increases.

This paper describes a factorization-based algorithm that reconstructs 3D object structure as well as motion from a set of multiple uncalibrated perspective images. The factorization method introduced by Tomasi-Kanade is believed to be applicable under the assumption of linear approximations of imaging system. In this paper we describe that the method can be extended to the case of truly perspective images if projective depths are recovered. We established this fact by interpreting their purely mathematical theory in terms of the projective geometry of the imaging system and thereby, giving physical meanings to the parameters involved. We also provide a method to recover them using the fundamental matrices and epipoles estimated from pairs of images in the image set. Our method is applicable for general cases where the images are not taken by a single moving camera but by different cameras having individual camera parameters. The experimental results clearly demonstrates the feasibility of the proposed method.

In this paper, Orthogonal Multicode OFDM-DS/CDMA system using Partial Bandwidth Transmission is proposed. By using the flexible carrier allocation of OFDM, Partial Bandwidth Transmission is considered for high quality communication. Furthermore, multicode packet data transmission is presented. Multicode packet data transmission is very effective to handle variable data. Since the proposed system can detect the header information without complex control, it is also suitable for packet data transmission. The computer simulation results show that the BER performance of the proposed system with the ideal channel estimation is improved compared with the case of the conventional Orthogonal Multicode DS/CDMA system with ideal RAKE receivers. Moreover the proposed system with the channel estimation by MLS algorithm also shows the good BER performance. In packet data transmission, the delay and throughput performances are also improved in the proposed system.

The performance of AC plasma displays has been improved in the area of brightness and contrast, while significant advances in image quality are still required for the HDTV quality. In particular, in full color motion video, motion artifacts and lack of color depth are still visible in some situations. These motional artifacts are mitigated as the number of the subfields increases, usually at the cost of losing brightness or increasing driving circuitry. Therefore, it is still one of our great concerns to find out the optimized subfield configuration through weighting and order of each subfield, and their coding of combination. For evaluation and improvement of motion picture disturbance, we have established a procedure that fully simulates the image quality of displays which utilize the subfield driving scheme. The simulation features virtually located sensor pixels on human retina, eye-tracking sensor windows, and a built-in spatial low pass filter. The model pixelizes the observers retina like a sensor chip in a CCD camera. An eye-tracking sensor window is assigned to every light emission from the display, to calculate the emissions from one to four adjoining pixels along the trajectory of motion. Through this model, a scene from original motion picture without disturbance is transformed into the still image with simulated disturbance. The integration of the light emission from adjoining pixels through the window, also functions as a built-in spatial low pass filter to secure the robust output, considering the MTF of the human eye. Both simulation and actual 42-in-diagonal PDPs showed close results under various conditions, showing that the model is simple, but reasonable. Through the simulation, general properties of the subfield driving scheme for gray scale have been elucidated. For example, a PWM-like coding offers a better performance than an MSB-split coding in many cases. The simulation also exemplifies the motion picture disturbance as a non-linear filter process caused by the dislocation of bit weightings, suggesting that tradeoffs between disturbance and resolution in motion area are mandatory.

M-ary/SS systems are compared with DS/SS systems applied the multicarrier systems and the RAKE receiver in the presence of AWGN, frequency selective Rayleigh fading and partial-band interference. In particular, the BER performance and SSMA capability are evaluated. Consequently, the M-ary/SSMA system using the multicarrier techniques is subject to the M-ary/SSMA system with the RAKE receiver in the presence of partial-band interference. The BER performance of the M-ary/SSMA system is better than that of the DS/SSMA system when the number of users is smaller than 20. And the spectral efficiency of the multicarrier M-ary/SSMA system is best in the four systems when JSR=20 [dB] and BER=10-3.

An automatic defect classification system (ADC) for use in visual inspection of semiconductor wafers is introduced. The methods of extracting the defect features based on the human experts' knowledge, with their correlations with the defect classes are elucidated. As for the classifier, Hyperellipsoid Clustering Network (HCN) which is a layered network model employing second order discrimination borders in the feature space, is introduced. In the experiments using a collection of defect images, the HCNs are compared with the conventional multilayer perceptron networks. There, it is shown that the HCN's adaptive hyperellipsoidal discrimination borders are more suited for the problem. Also, the cluster encapsulation by the hyperellipsoidal border enables to determine rejection classes, which is also desirable when the system will be in actual use. The HCN with rejection achieves, an overall classification rate of 75% with an error rate of 18%, which can be considered equivalent to those of the human experts.

This paper presents a new approach to computing symbol error probability of fast frequency-hopped M-ary frequency shift keying (FFH/MFSK) systems with majority vote under multitone jamming. For illustrating the applications, we first consider the case in which the source data rate is fixed and the hopping rate is allowed to vary. In this case, the optimum orders of diversity for several values of M are examined. Results show that M=4 outperforms other values. Then, we treat another case in which the hopping rate is fixed and the data rate is adjusted so as to obtain maximum throughput under a given constraint of error probability. In addition to the case of diversity alone, we also evaluate the performances of the fixed hopping rate case with channel coding using convolutional code and BCH code.

This paper describes IDDQ testability for bridging faults in a variety of flip-flops. The flip-flop is a basic element of the sequential circuit and there are various structures even for the same type. In this paper, we use five kinds of master-slave D-type flip-flops as the circuit under test. Target faults are two-line resistive bridging faults extracted from a circuit layout. A flip-flop with a deliberately introduced bridging fault is simulated by the SPICE simulator. Simulation results show that IDDQ testing cannot detect faults existing at specific points in some flip-flops, and this problem depends on the flip-flop structure. However, IDDQ testing has high fault coverage ( 98%) compared with traditional logic testing. We also examine performances of fully IDDQ testable flip-flops.

A method for reconstructing realistic 3D human faces from computer tomography images and color photographs is proposed in this paper. This can be linked easily with the underlying bone and soft tissue models. An iteration algorithm has been developed for automatically estimating the virtual camera parameters to match the projected 3D CT image with 2D color photographs using known point correspondence. An approach has been proposed to select landmarks using a mouse with minimum error. Six landmarks from each image have been selected for front face matching and five for each side face matching.

A fault-tolerant wormhole routing algorithm on mesh-connected processors is proposed. The proposed algorithm is based on the solid fault model and allows the fault polygons to be overlapped. The algorithm compares the position of fault region relative to current channel with the fault direction field of a misrouted message to route around overlapped fault polygons. A node deactivating algorithm to convert non-solid fault region into solid fault region is also proposed. The proposed routing algorithm uses four virtual channels and is deadlock and livelock free.

This paper addresses the problem of determining the 3-D pose of a curved rigid object from a single 2-D image. The surface of the object are assumed to be modeled with several patches, each of which be expressed by an implicit polynomial. Moreover, the sensed data are assumed to be the coordinates of those points that are on the image contours. Based on the idea of contour matching, the algorithm proposed computes the parameters defining the pose of the object, and achieves the segmentation of the sensed data and the recognition of the object.

In this paper we present improved techniques for transmitting M-PSK signals in mobile radio environments. Conventionally an optimal linear combination of the observable fading at the pilot symbols has been used as estimations of all other fading. Recently, an improved technique was proposed by the authors which employs not only the pilot symbols but also the previously estimated fading values on data symbols to extract more information on fading channels. In this paper we present new methods by further improving the above method invented by the authors. The present methods utilize, instead of the estimated fading values on data symbols, the demodulator output normalized by the decided (decoded) data symbols to estimate the fading values in the current frame. We also show by computer simulations for BPSK system that the proposed estimation methods provide better performance than those of the conventional methods.

This paper presents the performance of FH/MFSK systems, which exploit silent gaps in speech to accommodate more users, over Rayleigh fading channels. Two kinds of receivers are considered: one uses a threshold on the received signal strength to declare whether the signals were present or not, and the other is assumed to have perfect transmitter-state information obtained from using additional bandwidth. Results show that, if the codeword dropping and codeword error are assumed to be equally costly, the former can achieve slightly better performance than the latter in the decoding error probability. This finding suggests that, for the system to exploit silent gaps in speech, it is advantageous for the receiver to use a threshold to declare whether signals were present or not instead of relying on the transmitter-state information.

Fitt's law is commonly used to model target selection. But Fitts' law deals with only one kind of selection strategy. Our question is, do changes in target size, distance and direction to a target affect the differences in performance between target selection strategies? We performed the first empirical tests on a pen-based system to evaluate differences in performance between six selection strategies for selecting a target. Three target sizes, eight pen-movement-directions and three pen-movement-distances were applied to all six strategies. The results show that differences between selection strategies are affected by variations in target size but not by the other parameters (distance and direction).

In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicate that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.

In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We define satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.