This paper investigates transmission power control for packet transmissions by using code division multiplexing (CDM) in the downlink common (shared) channel of CDMA cellular packet systems and proposes a transmission power control scheme to improve throughput performance and geographical fairness of communication services. In the proposed scheme, downlink transmission power is controlled based on the signal-to-interference ratio predicted at mobile stations. Throughput performance and transmission delay are evaluated under perfect power control conditions. Simulation results show that by using site diversity technique the proposed scheme improves the downlink throughput for light load conditions and geographical fairness for all offered channel loads under both non-fading and fading environments.

Access control involves a check to see if a user has an access right to a resource and then a decision is made as to whether his/her access to the resource is to be allowed or denied. Typical access control models are the Discretionary Access Control Model, the Mandatory Access Control Model, and the Role-Based Access Control Model. Today, the Role-Based Access Control Model has become popular and is recognized as an effective method. However, until now, the Role-Based Access Control Model was adequate only for bureaucracy organizations, in which some roles are standardized and organizational hierarchy is stable. Team-Based Access Control models that were designed for team-based organizations have been proposed, but they do not reflect some features of an adhocracy organization, which are organic, temporary, not standardized, changeable, and obscure in terms of hierarchical relationship, such as a Task Force Team in the company. This study shows the characteristics of an adhocracy organization that differ from the existing bureaucracy organization, and then shows why existing access control models have caused some problems. Finally, a revised Role-Based Access Control model is proposed to solve those problems and is analyzed according to main evaluation standards.

Batch verification is a useful tool in verifying a large number of cryptographic items all at one time. It is especially effective in verifying predicates based on modular exponentiation. In some cases, however the items can be incorrect although they pass batch verification together. Such leniency can be eliminated by checking the domain of each item in advance. With this in mind, we introduce the strict batch verification and investigate if the strict batch verification can remain more effective than separate verification. In this paper, we estimate the efficiency of such strict batch verification in several types of groups, a prime subgroup of Zp with special/random prime p and prime subgroups defined on elliptic curves over Fp, F2m and Fpm, with are often used in DL-based cryptographic primitives. Our analysis concludes that the efficiency differs greatly depending on the choice of the group and parameters determined by the verifying predicate. Furthermore, we even show that there are some cases where batch verification, regardless of strictness, loses its computational advantage.

We investigated single flux quantum sinc filters with multistage decimation structure in order to realize high-speed sinc filter operation. Second- and third-order (k=2, 3) sinc filters with a decimation factor N=2 were designed and confirmed their proper operations. These sinc filters with N=2 are utilized as elementary circuit blocks of our multistage decimation sinc filters with N=2M, where M indicates the number of the stage of the decimation. As an example of the multistage decimation filter, we designed a k=2, N=4 sinc filter which was formed from a two-stage decimation structure using k=2, N=2 sinc filters, and confirmed its proper operation. The k=2, N=4 sinc filter consisted of 1372 Josephson junctions with the power consumption of 191 µW.

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.

Many types of adaptive algorithms based on the MMSE criterion for co-channel interference suppression in DS/CDMA systems have been studied in great detail. However, these algorithms have such a problem that the training speed is greatly dropped under the strong near-far problem. In this paper, we propose and analyze an adaptive filter based on the Maximum Signal to Interference and Noise Ratio (MSINR) criterion, called adaptive MSINR filter. This filter is basically equivalent to the adaptive filter based on the MMSE criterion. However, due to the structual difference, the convergence speed is greatly improved. Specifically, the de-spreading vector in this filter is so renewed as to maximize the Signal to Interference and Noise Ratio (SINR) by minimizing the de-spread interference and noise power under the condition that the de-spread desired signal power keeps constant. So the proposed filter uses the estimated interference and noise signal calculated by subtracting the estimated desired signal from the received signal. It is just the reason why the adaptive MSINR filter shows remarkable convergence speed. And to satisfy the constant signal power condition, the projection matrix onto the orthogonal complement of the desired signal space is used for the de-spreading vector. For the proposed filter, we analyze the convergence modes and also investigate the de-spread interfernce and noise power for calculating the theoretical SINR curve. Then, we conduct some computer simulations in order to show the difference between this filter and the conventional one in terms of the SINR convergence speed. As the result, we confirm that the adaptive filter based on the MSINR criterion achieves significant progress in terms of the SINR convergence speed.

A 3D display using super high-density multi-view images should enable reproduction of natural stereoscopic views. In the super multi-view display system, viewpoints are sampled at an interval narrower than the diameter of the pupil of a person's eye. With the parallax produced by a single eye, this system can pull out the accommodation of an eye to an object image. We are now working on a real-time view-interpolation system for the super multi-view 3D display. A multi-view camera using convergence capturing to prevent resolution degradation captures multi-view images of an object. Most of the data processing is used for view interpolation and rectification. View interpolation is done using a high-speed image-processing board with digital-signal-processor (DSP) chips or single instruction stream and multiple data streams (SIMD) parallel processor chips. Adaptive filtering of the epipolar plane images (EPIs) is used for the view-interpolation algorithm. The multi-view images are adaptively interpolated using the most suitable filters for the EPIs. Rectification, a preprocess, converts the multi-view images in convergence capturing into the ones in parallel capturing. The use of rectified multi-view images improves the processing speed by limiting the interpolation processing in EPI.

OFDM transmission performance in mobile communications suffers severe degradation caused by multipath delay difference greater than the Guard Interval (GI). This is because the excess delay results in considerable Inter-Symbol Interference (ISI) between temporally adjacent symbols and Inter-Carrier Interference (ICI) among subcarriers in the same symbol. This paper proposes a robust OFDM receiver for the scattered pilot OFDM signal that can effectively suppress both ISI and ICI by using two types of equalization and a smoothed FFT-window. In order to verify the performance of the proposed receiver, computer simulations are conducted in accordance with the scattered pilot OFDM signal format of the Digital Terrestrial Television Broadcasting (DTTB). The simulation results demonstrate that the proposed receiver shows much better performance than the conventional receiver in multipath fading environments with the delay difference greater than GI duration.

We have designed a 44 Banyan switch using SFQ logic circuits. The switch is composed of three parts; one is an input buffer, the second is a contention solver which checks packet contention in a distribution network, and the third is a packet distribution network which distributes contention-free packets to their destination address. The packet distribution network is composed of Batcher-Banyan switch with the input buffer. The contention solver decides to send a data packet to the distribution network, using only internal routing tags which are added to packets in the switch. As the circuit is composed of two parts, the contention solver and the packet distribution network, the transfer rate is raised because it doesn't need to wait any more while a data packet passes through the distribution network. Simulation results using JSIM show that the switch circuit can operate at a clock frequency of 40 GHz.

A new distributed medium access control (MAC) protocol--Soft Reservation Multiple Access with Priority Assignment (SRMA/PA) protocol--is introduced for supporting the integrated services of real-time and non-real-time applications in mobile ad-hoc networks. The SRMA/PA protocol allows the distributed nodes to contend for and reserve time slots with RTS/CTS-like "collision-avoidance" handshake and "soft reservation" mechanism augmented with distributed and dynamic access priority control. The SRMA/PA protocol realizes distributed scheduling for guaranteeing QoS requirements of integrated services and maximizes statistical multiplexing gain. We have demonstrated by simulation studies that the multiplexing gain can be improved significantly without unduly compromising on system complexity. Moreover, we have shown that the proposed back-off mechanism designed for delay-constrained services is useful for further improving utilization of the channel.

We study the influence of decoding order on the capacity of multimedia DS-CDMA system employing imperfect successive interference cancellation. We prove that the capacity is maximized by decoding users according to the ascending order of cancellation errors. We also prove that this capacity-optimal decoding order makes total residual interference minimum at the same time.

This paper presents a performance comparison of the channel-interleaving method in the frequency domain, i.e., bit interleaving after channel encoding, symbol interleaving after data modulation, and chip interleaving after spreading, for Variable Spreading Factor-Orthogonal Frequency and Code Division Multiplexing (VSF-OFCDM) wireless access with frequency domain spreading, in order to reduce the required average received signal energy per symbol-to-background noise power spectrum density ratio (Es/N0) and achieve the maximum radio link capacity. Simulation results show that, for QPSK data modulation employing turbo coding with the channel coding rate R=3/4, the chip-interleaving method decreases the required average received Es/N0 the most for various radio parameters and propagation model conditions, where the number of code-multiplexing, Cmux, the spreading factor, SF, the r.m.s. delay spread, σ, the number of multipaths, L, and the maximum Doppler frequency, fD, are varied as parameters. For example, when Cmux=12 of SF=16, the improvement in the required average received Es/N0 from the case without interleaving at the average packet error rate (PER) of 10-2, is approximately 0.3, 0.3, and 1.4 dB for the bit, symbol, and chip interleaving, respectively, in a L=12-path exponential decayed Rayleigh fading channel with σ of 0.043 µsec and fD of 20 Hz. This is because the chip interleaving obtains a higher diversity gain by replacing the chip assignment over the entire bandwidth. Meanwhile, in 16QAM data modulation with R=1/2, the performance of the chip interleaving is deteriorated, when Cmux/SF>0.25, due to the inter-code interference caused by different fading variations over the spreading duration since the successive chips during the spreading duration are interleaved to the separated sub-carriers. Thus, bit interleaving exhibits the best performance although the difference between bit interleaving and symbol interleaving is slight. Consequently, we conclude that the bit-interleaving method is the best among the three interleaving methods for reducing the required received Es/N0 considering the tradeoff between the randomization effect of burst errors and the mitigation of inter-code interference assuming the application of adaptive modulation and channel coding scheme in OFCDM employing frequency domain spreading.

A numerical model of thin-film transistors for circuit simulation has been developed. This model utilizes three schemes. First, the spline interpolation with transformation by y=x+log(x) achieves excellent preciseness for both on-current and off-current simultaneously. Second, the square polynomial supplement solves an anomaly near the points where drain voltage equal to zero. Third, the linear extrapolation achieves continuities of the current and its derivatives as a function of voltages out of the area where the spline interpolation is performed, and improves convergence during circuit simulation.

Array antennas are employed at the receiver for a variety of purposes such as to combat fading or to reduce co-channel interference. To evaluate the performance of a wireless communications system using antenna arrays it becomes necessary to have spatial channel models that describe the Angle of Arrival (AOA), Time of Arrival (TOA) and the Angle Spread (AS) of the multipath components. Among the most widely used radio propagation models is the single bounce scattering geometric model, where propagation between the transmitting and receiving antennas is assumed to take place via single scattering from an intervening obstacle. Currently, several geometric models are available such as circular and elliptical scattering models, with each model being applicable to a specific environment type. This paper addresses the modeling, simulation and evaluation of the angle spread in smart antenna systems taking into account the Gaussian density model, and proves that the model finds use both in a micro cell as well as in a macro cell environment. Moreover, we show statistics for the angle and time of arrival.

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

To improve the CT image degraded by radiographic noise (such as quantum mottle), we propose a method based on the wavelet transform modulus sum (WTMS). The noise and regular parts of a signal can be observed by tracing the evolution of its WTMS across scales. Our results show that most of the quantum mottle in the projections of Shepp-Logan phantom has been removed by the proposed method with the supposed cranium well preserved. The denoised CT images show good signal to noise ratio in the region of interest. We also have investigated the relation between the number of X-ray photons and the quality of images reconstructed from denoised projections. From experimental results, this method shows the possibility to reduce a patient's dose about 1/10 with the same visual quality.

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.

In order to realize a future seamless high-speed road-vehicle communication system, we have proposed using code division multiplexing (CDM) radio transmission scheme by using cyclic shifted-and-extended (CSE) codes as spread codes. As the CSE codes are generated by cyclically shifting and extending a conventionally used code, the number of codes generated from a code is limited to the length of the shift interval and the tolerable period of delayed waves also depends on the length. In this paper, based on CSE codes, we propose a method to minimize the length of the shift interval and a cancellation technique with a simple calculation in order to eliminate the interference from delayed waves caused by the reduction of the length of shift interval. The concept and the BER performances in AWGN, two-paths, and multi-path fading environments are described in this paper. As a result, the maximum transmission rate of CSE-based-CDM transmission per one-code using the newly proposed transmission scheme is 3 times as large as that using conventional CSE codes and DQPSK-CDM transmission scheme.

Analysis of the operation modes of an RF-Field-Driven DC-SQUID (RFDS) is presented. We numerically calculate the current-voltage characteristics (IVC) of the RFDS, where the RF signal is coupled to the SQUID loop magnetically. Under no DC offset flux, the IVC exhibit the enhancement of the even-order steps. We first evaluate the dependence of the maximum 2nd step height of the RFDS upon frequency. Contrary to the results for a single junction, the RFDS maintains its step height at a certain value in the low frequency region. The maintained values of the maximum step height are dependent on βL. The smaller βL is, the larger the maximum step height becomes. Next, we evaluate the dependence of the current positions of the 2nd step upon the amplitude of the RF signal. Under the low frequency condition, the current positions agree with the interference patterns of the SQUID, which means that the operation of the RFDS is based on the quantum transitions in the SQUID loop. Under the high frequency condition, on the other hand, the current positions agree with the results for the single junction, which means that the quantum transitions does not follow the RF signal and that the RFDS behaves like a single junction.