In a wireless OFDM-CDMA system, the data-modulated symbol of each user is spread over multiple subcarriers in the frequency domain using a given spreading code. For the downlink (base-to-mobile) transmissions, a set of orthogonal spreading codes defined in the frequency domain is used so that different users data can be transmitted using the same set of subcarriers. The frequency selectivity of the radio channel produces the orthogonality destruction. There are several frequency equalization combining techniques to restore orthogonality, i.e., orthogonal restoration combining (ORC), control equalization combining (CEC) that is a variant of ORC, threshold detection combining (TDC), and minimum mean square error combining (MMSEC). The ORC can restore orthogonality among users but produces noise enhancement. However, CEC, TDC, and MMSEC can balance the orthogonality restoration and the noise enhancement. In this paper, we investigate, by means of computer simulation, how the BER performances achievable with ORC, CEC, TDC, and MMSEC are impacted by the propagation parameters (path time delay difference and fading maximum Doppler frequency), number of users, pilot power used for channel estimation, and channel estimation scheme. To acquire a good understanding of ORC, CEC, TDC, and MMSEC, how they differ with respect to the combining weights is discussed. Also, the downlink transmission performances of DS-CDMA and OFDM-CDMA are compared when the same transmission bandwidth is used. How much better performance is achieved with OFDM-CDMA than with DS-CDMA using ideal rake combining is discussed.

This paper presents a cell search scheme embedded with carrier frequency synchronization for inter-cell asynchronous orthogonal frequency-division multiplexing code-division multiplexing (OFDM-CDM) systems. Several subcarriers are dedicated to a differentially encoded synchronization channel (SCH). In the other subcarriers, data symbols and pilot symbols are two-dimensionally spread in the time-frequency domain. The cell search scheme consists of a three-stage cell search and a two-stage carrier-frequency synchronization, that is, coarse carrier-frequency acquisition, fast Fourier transform window-timing detection, SCH frame-timing detection, fine carrier-frequency synchronization, and cell-specific scrambling code (CSSC) identification. Simulation demonstrated that this scheme can identify the CSSC with high detection probability while precisely synchronizing the carrier frequency in severe frequency-selective fading channels.

This paper proposes a three-step cell search algorithm that utilizes only the common pilot channel (CPICH) in the forward link and employs spreading by a combination of a cell-specific scrambling code (CSSC) and an orthogonal short code for Orthogonal Frequency and Code Division Multiplexing (OFCDM) broadband packet wireless access. In the proposed cell search algorithm, the OFCDM symbol timing, i.e., Fast Fourier Transform (FFT) window timing, is estimated by detecting the guard interval timing in the first step. Then, in the second step, the frame timing and CSSC group are simultaneously detected by taking the correlation of the CPICH based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC within the group is identified in the third step. The most prominent feature of the proposed cell search algorithm is that it does not employ the conventional synchronization channel (SCH), which is exclusively used for the cell search. Computer simulation results elucidate that when the transmission power ratio of the CPICH to one code channel of the traffic channel (TCH) is 12 dB, the proposed cell search method achieves faster cell search time performance compared to the conventional method using the SCH with the transmission power ratio of the SCH to one code channel of the TCH of 6 dB. Furthermore, the results show that it can accomplish the cell search within 1.7 msec at 95% of the locations in a 12-path Rayleigh fading channel with the maximum Doppler frequency of 80 Hz and the r.m.s. delay spread of 0.32 µs.

This paper proposes an adaptive radio parameter control scheme that utilizes an optimum radio parameter set comprising the maximum number of retransmissions in hybrid automatic repeat request (HARQ) in addition to the data modulation and channel coding scheme (MCS) according to the Quality of Service (QoS) requirements (i.e., the required packet error rate and delay) and propagation conditions such as the delay spread in the forward link of Orthogonal Frequency and Code Division Multiplexing (OFCDM) broadband wireless access. We elucidate by simulation evaluation that most of the optimum MCSs are common regardless of the delay requirement of traffic data, i.e., common between non-real time (NRT) and real-time (RT) class data. Concretely, the three MCSs of QPSK with the coding rate of R=1/2, 16QAM with R=1/2 and 3/4 are optimum ones, although the additional MCS of QPSK with R=1/3 is effective only for the RT class data in the lower received average received signal energy per symbol-to-background noise power density ratio (Es/N0) region. Furthermore, application of a much higher MCS set, 16QAM with R=5/6 and 64QAM with R=3/4, in addition to the three common MCSs improves the throughput under much higher Es/N0 conditions in a small delay spread environment. The simulation results show that the delay requirement, i.e., the maximum number of retransmissions, in HARQ does not affect the key radio parameter such as MCS, because of informative results such as a smaller number of retransmissions associated with a less-efficient MCS achieves a higher throughput than does using a more highly-efficient MCS allowing a larger number of retransmissions. Consequently, it is concluded that the proposed adaptive radio parameter control according to the QoS requirements substantially results in the selection of the optimum MCS irrespective of the delay requirement except for the extreme case where no retransmissions are allowed and for special propagation channel conditions.

In this paper, we evaluate the average bit error rate (BER) and bits per symbol (BPS) performances of CDMA system employing the adaptive modulation according to the position of mobile station since the performance of CDMA system is highly dependent on user location especially in the downlink, and further we evaluate the overall performance by considering the user distribution at the level of cell. To evaluate the performance of the considered system in the forward link, we derive the distribution of the received signal to noise ratio (SNR) by Mobile Station located at arbitrary cell position with which we investigate the average BER and BPS performances of the common shared channel, one of the downlink channels of beyond IMT-2000 systems such as 1xEV-DO, 1xTEME and HSPDA. As a result, we observe that the CDMA system adopting the adaptive modulation can get about 2.47 bits per symbol at the cell level, while satisfying the required BER performance over all cell area.

Software obfuscation is a promising approach to protect intellectual property rights and secret information of software in untrusted environments. Unfortunately previous software obfuscation techniques share a major drawback that they do not have a theoretical basis and thus it is unclear how effective they are. Therefore we propose new software obfuscation techniques in this paper. The techniques are based on the difficulty of interprocedural analysis of software programs. The essence of our obfuscation techniques is a new complexity problem to precisely determine the address a function pointer points to in the presence of arrays of function pointers. We show that the problem is NP-hard and the fact provides a theoretical basis for our obfuscation techniques. Furthermore, we have already implemented a prototype tool that obfuscates C programs according to our proposed techniques and in this paper we describe the implementation and discuss the experiments results.

This paper presents a new method to evaluate time stamping schemes from three viewpoints: integrity of a time stamp, cost of issuing and verifying a time stamp and availability of the schemes. The main advantage of the proposed evaluation method is to clarify whether or not a certain scheme is optimal under certain prioritized requirements. Therefore, the proposed method can help potential users of time stamping services select an appropriate one which meets their prioritized requirements. In this paper, we explain the basic idea of the evaluation method and show how to use it by applying it to seven existing schemes.

This paper proposes a flexible tree-based key management framework for a terminal to connect with multiple content distribution systems (called as CDSs in this paper). In an existing tree-based key management scheme, a terminal keeps previously distributed node keys which are used for decrypting contents from a CDS. According to our proposal, the terminal can calculate its node keys of a selected CDS as the need arises, using the "public bulletin board" of the CDS. The public bulletin board is generated by a management center of the individual CDS, depending on a tree structure which it determines in its convenience. After the terminal calculates its node keys, it can get a content of the CDS using the calculated node keys.

A digit-recurrence algorithm for computing reciprocal square-root which appears frequently in multimedia and graphics applications is proposed. The reciprocal square-root is computed by iteration of carry-propagation-free additions, shifts, and multiplications by one digit. Different specific versions of the algorithm are possible, depending on the radix, the redundancy factor of the digit set, and etc. Details of a radix-2 version and a radix-4 version and designs of a floating-point reciprocal square-root circuit based on them are shown.

This paper presents a new sliding window algorithm that is well-suited to an elliptic curve defined over an extension field for which the Frobenius map can be computed quickly, e.g., optimal extension field. The algorithm reduces elliptic curve group operations by approximately 15% for scalar multiplications for a practically used curve in compared to Lim-Hwang's results presented at PKC2000, which was the fastest previously reported. The algorithm was implemented on computers. Scalar multiplication can be accomplished in 573 µs, 595 µs, and 254 µs on Pentium II (450 MHz), 21164A (500 MHz), and 21264 (500 MHz) computers, respectively.

The encryption algorithm Camellia is a 128 bit block cipher proposed by NTT and Mitsubishi, Japan. Since the algebraic degree of the outputs after 3 rounds is greater than 128, designers estimate that it is impossible to attack Camellia by higher order differential. In this paper, we show a new higher order differential attack which controls the value of differential using proper fixed value of plaintext. As the result, we found that 6-round F-function can be attacked using 8th order differentials. The attack requires 217 chosen plaintexts and 222 F-function operations. Our computer simulation took about 2 seconds for the attack. If we take 2-R elimination algorithm, 7-round F-function will be attacked using 8th order differentials. This attack requires 219 chosen plaintexts and 264 F-function operations, which is less than exhaustive search for 128 bit key.

We develop efficient precomputation methods of multi-scalar multiplication on ECC. We should recall that multi-scalar multiplication is required in some elliptic curve cryptosystems including the signature verification of ECDSA signature scheme. One of the known fast computation methods of multi-scalar multiplication is a simultaneous method. A simultaneous method consists of two stages; precomputation stage and evaluation stage. Precomputation stage computes points of precomputation, which are used at evaluation stage. Evaluation stage computes multi-scalar multiplication using precomputed points. In the evaluation stage of simultaneous methods, we can compute the multi-scalar multiplied point quickly because the number of additions is small. However, if we take a large window width, we have to compute an enormous number of points in precomputation stage. Hence, we have to compute an abundance of inversions, which have large computational amount. As a result, precomputation stage requires much time, as well known. Our proposed method reduces from O(22w) inversions to O(w) inversions for a window width w, using Montgomery trick. In addition, our proposed method computes uP and vQ first, then compute uP+vQ, where P,Q are elliptic points. This procedure enables us to remove unused points of precomputation. Compared with the method without Montgomery trick, our proposed method is 3.6 times faster in the case of the precomputation stage for simultaneous sliding window NAF method with window width w=3 and 160-bit scalars under the assumption that I/M=30, S/M=0.8, where I,M,S respectively denote computational amounts of inversion, multiplication and squaring on a finite field.

In cryptography, we want a Boolean function which satisfies PC(l) of order k for many (l,k). Let PCn(l,k) be a set of Boolean functions with n input bits satisfying PC(l) of order k. From a view point of construction, it is desirable that there exists (l0,k0) such that PCn(l0, k0) PCn(li,ki) for many i 1. In this paper, we show a negative result for this problem. We prove that PCn(l1,k1) PCn(l2,k2) for a large class of l1, k1, l2 and k2.

Face recognition provides an important means for realizing a man-machine interface and security. This paper presents "Smartface," a PC-based face recognition system using a temporal image sequence. The face recognition engine of the system employs a robust facial parts detection method and a pattern recognition algorithm which is stable against variations of facial pose and expression. The functions of Smartface include (i) screensaver with face recognition, (ii) customization of PC environment, and (iii) real-time disguising, an entertainment application. The system is operable on a portable PC with a camera and is implemented only with software; no image processing hardware is required.

Multiple access interferecnce (MAI) is a major factor limiting the performance of direct-sequence code-division multiple access (DS-CDMA) systems. Since the amount of MAI is dependent on the correlation among user signals, one way to reduce it is to reduce such correlation. In mobile multiuser communication, each user experiences a different time-varying channel response. This user-dependent characteristic in channel variation can be exploited to assist the separation of different user signals, in addition to the capability provided by the spreading codes. As the correlation among different user channels are expected to decrease with increase in time span, enhanced decorrelation among different users' signals can be effected by spacing out the chips of one modulated symbol in time. Thus we consider chip-interleaving DS-CDMA (CI-DS-CDMA) in this study. We investigate its performance through theoretical analysis and computer simulation. Employing only a slightly modified rake receiver structure, CI-DS-CDMA is shown to attain significant performance gain over conventional DS-CDMA, in multiple access communication over single- and multi-path fading channels, without complicated multiuser detection. CI-DS-CDMA also has a lower demand for short-term power control than conventional DS-CDMA, especially in one-path Rayleigh fading. Results of the theoretical analysis and the computer simulation agree well with each other.

We introduce efficient algorithms for the τ-adic sliding window method, which is a scalar multiplication algorithm on Koblitz curves over F2m. The τ-adic sliding window method is divided into two parts: the precomputation part and the main computation part. Until now, there has been no efficient way to deal with the precomputation part; the required points of the elliptic curves were calculated one by one. We propose two fast algorithms for the precomputation part. One of the proposed methods decreases the cost of the precomputation part by approximately 30%. Since more points are calculated, the total cost of scalar multiplication is decreased by approximately 7.5%.

The Quality of Service (QoS) requirements such as delay and cell loss ratio (CLR) are very stringent for video transmission. These constraints are difficult to meet if high network utilization is desired. Dynamic bandwidth allocation in which video traffic prediction can play an important role is thus needed. In this paper, we suggest to predict the variation of I frames instead of the actual size of I frames, and propose an algorithm that can achieve fast convergence and small prediction error, thus imposing QoS and attaining high network utilization. The performance of the scheme is studied using the renegotiated constant bit rate (RCBR) service model. The overall dynamic bandwidth allocation scheme based on our fast convergent algorithm is shown to be promising, and practically feasible for efficient transmission of real time videos.

In this paper, we describe two approaches to optimize the Phase-Mode pipelined parallel multiplier. One of the approaches is reforming a data distribution for an AND array, which is named the hybrid structure. Another method is applying a Booth encoder as a substitute of the AND array in order to generate partial products. We design a 2-bit 2-bit Phase-Mode Booth encoder and test the circuit by the numerical simulations. The circuit consists of 21 ICF gates and operates correctly at a throughput of 37.0 GHz. The numbers of Josephson junctions and the pipelined stages in each scale of multipliers are reduced remarkably by using the encoder. According to our estimations, the Phase-Mode Booth encoder is the effective component to improve the performance of large-scale parallel multipliers.

At present, in the Intelligent Transport Systems (ITS) field, research continues In-The-Vehicle Communication (ITVC), Inter-Vehicle Communication (IVC), Road-to-Vehicle Communication (RVC), etc. All information communications technology, especially radio-communications technology, was applied. For example, wireless 1394 is used in ITVC, millimeter-wave communication is used in IVC, and Radio on Fiber (ROF) communication technology is used in RVC. However, it is actually very difficult to design for and accommodate all of these systems. This research, to simplify a design, equipment, structure, etc. of ITCV, IVC, and RVC, utilizes a wireless Bluetooth technology system which is the global radio-communications standard which is capturing the spotlight from various fields. In recent years, demand for a radio-communications service which can be used anywhere is increasing. Furthermore, demand for information service by the Internet is also increasing. This paper proposes simulation of Bluetooth wireless communication for ITS field such as ITVC, IVC and RVC system combined to the global Internet connection. Of course, there are many aspects should be thought carefully when the simulation system will be applied to the ITS infrastructures later. On this paper we have been designing the whole system and the evaluation of the simulation have been testing carefully.

This paper proposes a new blind algorithm effective for multiuser detection with an adaptive array antenna. The conventional blind algorithm, known as the Constant Modulus Algorithm (CMA), has two major drawbacks: (i) the convergence speed is not sufficiently fast for usual applications in mobile communications, and (ii) the algorithm is very likely to lock on the path with the largest received power, which means the signal with the second largest power can hardly be extracted. This paper introduces the Recursive Least Squares algorithm for CMA (RLS-CMA) in order to speed the convergence up, and additionally introduces the concept of the orthogonal projection into CMA so as to extract signals with weak power. The proposed CMA with Orthogonal Projection (CMA-OP) sequentially calculates the weight vector of each user under a constraint that the weight vector should be orthogonal to the estimated array response vectors of previously extracted users. Computer simulations demonstrate that the proposed scheme can operate properly in the Rayleigh fading channels under the two-user condition.