The adaptive base station antenna is an attractive candidate for establishing high-speed and highly-reliable wireless communication systems. From a commercial viewpoint, since the cost and complexity of adaptive antennas depend on the number of elements, optimizing the antenna configuration while considering the propagation environment is necessary to reduce the number of elements. This paper first presents the Angle of Arrival (AOA) characteristics of delayed waves in a street microcell environment, typically used in urban microcell systems. Then the antenna configuration and antenna spacing suitable for the street microcell are investigated utilizing bit error rate (BER) performance simulations using practical delay profiles and AOAs. The effectiveness of bidirectional elements with respect to the BER performance is also investigated. As the results, we found that broadside array with the spacing of 2.5 wavelengths is suitable for adaptive base station antennas for high data-rate wireless systems placed in a street microcell environment. We also found that bidirectional elements alleviate the BER degradation due to the grating lobe of the antenna with wide element spacing without increasing the antenna size.

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.

Jan and Tseng, in 1999, proposed two efficient digital signature schemes with subliminal channels. However, we show that a malicious subliminal receiver can forge subliminal messages that will be accepted by other subliminal receivers in Jan and Tseng's two schemes. Moreover, we also present a modification of Jan and Tseng's schemes to repair the security flaw.

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.

This paper shows an extensive software performance analysis of dedicated hash functions, particularly concentrating on Pentium III, which is a current dominant processor. The targeted hash functions are MD5, RIPEMD-128 -160, SHA-1 -256 -512 and Whirlpool, which fully cover currently used and future promised hashing algorithms. We try to optimize hashing speed not only by carefully arranging pipeline scheduling but also by processing two or even three message blocks in parallel using MMX registers for 32-bit oriented hash functions. Moreover we thoroughly utilize 64-bit MMX instructions for maximizing performance of 64-bit oriented hash functions, SHA-512 and Whirlpool. To our best knowledge, this paper gives the first detailed measured performance analysis of SHA-256, SHA-512 and Whirlpool.

This paper describes truncated and impossible differentials of Feistel block ciphers with round functions of 2-layer SPN (Substitution and Permutation Network) transformation modules such as the 128-bit block cipher Camellia, which was proposed by NTT and Mitsubishi Electric Corporation. Our work improves on the best known truncated and impossible differentials, and has found a nontrivial 9-round truncated differential that may lead to a possible attack against a reduced-round version of Camellia without input/output whitening, FL or FL-1 (Camellia-NFL), in the chosen plain text scenario. Previously, only 6-round differentials were known that may suggest a possible attack of Camellia-NFL reduced to 8-rounds. We also show a nontrivial 7-round impossible differential, whereas only a 5-round impossible differential was previously known. We also consider the truncated differential of a reduced-round version of Camellia (Camellia-DS) whose round functions are composed of D-S (Diffusion and Substitution) transformation modules and without input/output whitening, FL or FL-1 (Camellia-DS-NFL), and show a nontrivial 9-round truncated differential, which may lead to a possible attack in the chosen plain text scenario. This truncated differential is effective for general Feistel structures with round functions composed of S-D (Substitution and Diffusion) or D-S transformation.

This paper proposes an Orthogonal Frequency Division Multiplexing system with Grouping Adaptive Modulation method (GAM-OFDM). The salient feature of the proposed system is to enable the reduction of required transmission bits for adaptive modulation information (AMI) that is required in the demodulation process at the receiver. This paper also proposes an efficient AMI transmission method for the GAM-OFDM system to enable the efficient transmission of AMI bits by using only two preamble symbols, and the Multi-Carrier Spectrum Spreading (MC-SS) technique to achieve the excellent performance of AMI transmission even under severe multi-path fading environments. This paper presents the various computer simulation results to verify the performance of proposed GAM-OFDM system.

Traditionally, UNIX has been weak in data sharing. By data sharing, we mean that multiple cooperative processes concurrently access and update the same set of data. As the degree of sharing (the number of cooperative processes) increases, the existing UNIX virtual memory systems run into page table thrashing, which causes a major performance bottleneck. Once page table thrashing occurs, UNIX performs miserably regardless of the hardware platforms it is running on. This is a critical problem because UNIX is increasingly used in environments such as banking that require intensive data sharing. We consider several alternatives to avoid page table thrashing, and propose a solution of which the main idea is to share page tables in virtual memory. Extensive experiments have been carried out with real workloads, and the results show that the shared page table solution avoids the page table thrashing and improves the performance of UNIX by an order of magnitude.

This paper cryptanalyzes 128-bit block cipher Xenon, which was designed by Chang-Hyi Lee and has been recently proposed by Korea to ISO 18033-3, an ongoing activity in ISO/IEC JTC1/SC27/WG2 for standardizing block cipher algorithms. We study security of Xenon against linear cryptanalysis and show highly biased linear approximate paths that hold with probability 1/2 2-11 in the full 16-round Xenon. As a result, we can easily derive four-bit subkey information of Xenon using 223 known plaintexts with approximate success rate 84%. We also demonstrate a distinguishing attack of Xenon in a chosen plaintext scenario, which successfully reduces the number of required plaintext/ciphertext pairs of the attack. All these results were confirmed by computer experiments.

In this paper, two types of multi-stage partial parallel interference cancellation (PIC) receivers are considered for multi-rate DS-CDMA system: multi-stage PIC receiver with partial cancellation factors and multi-stage PIC receiver with decision thresholds. Bit error rate (BER) of the multi-stage partial PIC receivers is obtained by simulation in a Rayleigh fading channel. It is shown that the multi-stage partial PIC receivers achieve smaller BER than the matched filter (MF) receiver, multi-stage PIC receiver, group-wise successive interference cancellation (GSIC) receiver, and extended GSIC receiver (EGSIC) for the multi-rate DS-CDMA system in a Rayleigh fading channel.

The purpose of this paper is to derive a novel fractionally spaced Bayesian decision feedback equalizer (FS-BDFE). The oversampling technique changes single input single output (SISO) linear channel to single input multiple output (SIMO) linear channel. The Bayesian decision variable in the FS-BDFE is defined as the product of Bayesian decision variables in the Bayesian decision feedback equalizers (BDFE) corresponding to each channels of the SIMO. It can be shown that the FS-BDFE has less decision error probability than the conventional BDFE. The effectiveness of the proposed equalizer is also demonstrated by the computer simulation.

This paper describes a rhythm pattern accuracy diagnosis system based on the rhythm pattern matching algorithm and a diagnosis feedback method by employing the SVM technique. A beat rhythm pattern is recorded by a PC and analyzed with an algorithm including cluster-analysis-based pattern matching. Rhythm performance is represented by a performance feature vector, which features note length deviation, note length instability, and tempo instability. The performance feature vector is effective for objectively evaluating the accuracy of rhythm patterns objectively. In addition, this system has the music experts' knowledge base, which is calculated from the performance feature vectors associated with the experts' subjective evaluation by listening to the performance. The system generates both an objective measuring report, and experts' comments for learners. Reproductivity of experts' comments is statistically indicated to be excellent for eight rhythm patterns, two tempo levels, and eight users. Reliability of experts' comments are also described considering the threshold of the decision function of SVM. Subjective evaluation of the system is carried out by fifteen users by a questionnaire using the SD method. As a result of factor analysis for the sixteen questions, four factors named "Audio-visual representation," "User-friendliness," "Reliability," and "Window representation," are extracted. Users' four factor scores indicate that the system is reliable and easy to use.

In an order-specified multisignature scheme, one can verify not only a set of signers who have signed the message but also its signing order. Though we have seen several schemes with such properties proposed, none of them is given the security proof against active adversaries. The scheme can be easily modified to be an order-specified multisignature scheme, but still has the restriction that the possible signing orders are only ones of the type of serial signing. In this paper, we propose the first order-specified multisignature scheme, which is shown to be secure against adaptive chosen-message insider attacks in the random oracle model, and which allows the signing orders to form like any series-parallel graphs. The security is shown by using ID-reduction technique, which reduces the security of multisignature schemes to those of multi-round identification schemes. Furthermore, we discuss the efficiency of the proposed scheme and the upper bound of the possible number of participating signers.

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.

It is well known that diversity performance of communication systems using signals with high dimensions in time, frequency and/or spatial domains depends on correlation of the channel characteristics along signal dimensions. On the other hand, it has not been payed due attention how the coherent receiver which combines the signals is greatly affected by the erroneous channel estimation which can undermine the diversity gain. In this paper, assuming that the estimator is given the a priori probability of the channel characteristics, we propose an optimum estimation scheme based on MAP criterion, in an uplink-MC/CDMA system on channels with frequency selective fading, with an array of antennas at the receiver. The MAP estimator effectively takes into account the correlation of the channel characteristics that the conventional estimator neglects. We also propose a signal design in pilot symbol periods that enables the receiver to separately obtain the sufficient statistic for estimating the channel characteristics without MAI. Using computer simulation, we obtained MSE error performances of the proposed estimator compared with the conventional estimator and their effect on BER performances of the diversity combining receiver. It was observed that using the conventional estimator for combining greater number of signals than the effective channel dimension deteriorated the BER performance while using the proposed estimator kept the optimum performance just as the error-free estimator did. Also obtained for MC/CDMA systems are BER performances of the single user matched filter and MMSE receivers using the proposed and the conventional estimators. A considerable improvement of the MMSE performance was achieved owing to the optimum estimator. It remains for the a priori probability of the channel characteristics to be properly assumed and dealt with in sequential estimation.

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.

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 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.

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.