This paper conducts performance evaluation for a code division multiple access (CDMA) system when channel bands of multiple neighboring CDMA/DSSS are overlapped in frequency domain. It is assumed that all systems adopt direct-sequence spread-spectrum (DSSS) technique and are BPSK modulated by the different carrier frequencies. Automatic power control (APC) is also applied in the interfered system such that the receiver gets the same power from all users. Without loss generality, an additive white Gaussian noise (AWGN) channel is also assumed during analysis. In this paper, the analytic solution of the signal to noise ratio (SNR) is first derived in which both CDMA systems are modulated by different carrier frequencies. This analysis is good for general cases; and the result shows an excellent computational performance. In particular, the result is very close to Pursly's result, when the systems have the same code length with no carrier difference.

We present three-wave mixing devices useful for signal processing functions in WDM and TDM systems, including wavelength conversion, spectral inversion, and gated mixing. These mixers exhibit extremely wide bandwidth, low noise, high efficiency, and format transparency.

A simple phase compensation technique with improved power supply rejection ratio (PSRR) for CMOS opamps is proposed. This technique is based on feeding back a current proportional to a derivative of the voltage difference between an output and an input, and does not require a common-gate circuit or a noise-free bias for the circuit. The proposed technique requires only two additional transistors, which are connected to the differential pair of transistors in a cascade manner, and the compensation capacitor is connected to the source node of the additional transistor. Experimental results show an improvement of more than 20 dB in the PSRR at high frequencies, comparing the technique with a Miller compensation. This technique also improves the unity gain frequency and the phase margin from 0.9 MHz and 17 to 1.8 MHz and 44 for 200 pF load capacitance, respectively.

Design patterns which Erich Gamma advocates is expected as an effective approach for the reuse of designs. So, design patterns are predicted to be used frequently in object-oriented software development. In such circumstance, tools to support applying design patterns to the design diagrams of the system under development are thought to be useful. This research develops Object-Oriented Pattern Applying Support tool OOPAS. It consists of a library of Gamma design patterns with very familiar examples and adrem explanation, and of a function to generate the correctly modified design diagrams of the application system when a design pattern was applied to evolve that system. Actually, these functions are installed in the structured object modeling environment SOME, which is an object-oriented design diagram editor made previously in our laboratory. This design diagram evolving function is formalized as a Join operation of the recursive graph. As a result of the evaluation experiment, the join operation can be applied to the almost of the twenty three Gamma design patterns excluding the six patterns such as Iterator and Command, which are stated at too abstract level to be represented by the design diagrams.

Software radio base and personal station prototypes are proposed and implemented. The prototypes are composed of RF/IF, A/D and D/A, pre- and post-processors, CPU, and DSP parts. System software is partitioned into CPU program and DSP program to use processor resources effectively. They support various air interfaces, some of which are equivalent to the 384 kbit/s transmission rate PHS (personal handy phone system) and a 96 kbit/s transmission rate system. The base station can also be used as a communication bridge between two systems. In order to ease IF filter requirements, the zero-stuff method is employed. Basic transmission and receiving performances are evaluated in an experiment and their results agree well with those expected.

In this paper, we propose an idea of the generalization of threshold signature and authenticated encryption for group communications. The concept of the (t, n) threshold signature with (k, l) shared verification is implemented in group-oriented cryptosystems. In the system, any t members can represent a group to sign a message and any k verifiers can represent another group to authenticate the signature. By integrating the cryptographic techniques of data encryption, digital signature and message recovery, a group-oriented authenticated encryption scheme with (k, l) shared verification is also proposed. The message expansion and communication cost can also be reduced in our schemes.

The sign-language can be used as a communication means between avatars having no common language. As a trial to overcome the linguistic barrier, we have previously developed a 2D model-based sign-language chatting system between Korean and Japanese on the the Internet. In that system, there have been some problems to be solved for natural animation and real-time transmission. In this paper, we employ a 3D character model for stereoscopic gestures in the sign-language animation. We also utilize CG animation techniques which use the variable number of frames and a cubic spline interpolation in order to generate realistic gestures. For real-time communication, on the other hand, we make use of an intelligent communication method on a client-server architecture. We implement a preliminary communication system with Visual C++ 5.0 and Open Inventor on Windows platforms. Experimental results show a possibility that the system could be used for avatar communications between different languages.

This paper presents a constant-scale-factor radix-2-4-8 CORDIC algorithm for fast vector rotation and sine/cosine computation. The CORDIC algorithm is a well-known hardware algorithm for computing various elementary functions. Due to its sequential nature of computation, however, significant reduction in processing latency is required for real-time signal processing applications. The proposed radix-2-4-8 CORDIC algorithm dynamically changes the radix of computation during operation, and makes possible the reduction in the number of iterations by 37% for 64-bit precision. This paper also describes the hardware implementation of radix-2-4-8 CORDIC unit that can be installed into practical digital signal processors.

We propose a novel Bragg grating filter synthesis method using a Fourier transform of the target scattering matrix. Multiple scattering processes are taken into account by iteration to improve the synthesis accuracy.

In December 1996, JR East introduced "ATOS" the latest Autonomous Decentralized System, on its Chuo Line. This system, named after Athos, the mountain which is sacred to the Greek Orthodox Church, is considered as a sanctuary of the railway technology in the current information society. ATOS or the Autonomous Decentralized System is not only an application, on a huge scale, of the concept of an epoch making network computing to the downsizing, but is also highly innovative in terms of the diversity and complexity of the technology applied, of its capacity for expansion, and of its complementary functions. The system not only controls the day-to-day operation of 6,200 trains over 1,100 kilometers of track, delivering information which is essential to the company's passengers and work force, but also serves as a safety system covering maintenance work, including track repairs and the inspection of electrical facilities. Total investment in ATOS is expected to reach $360 million. This railway operation control system, which is a comprehensively revamped version of the CTC system used on many lines including the Shinkansen, is a digital application of analog technology at its best. It is among the most sophisticated and interesting applications of an autonomous decentralized system in the industry.

This paper proposes an electronic soccer lottery protocol suitable for the Internet environment. Recently, protocols based on public-key schemes such as digital signature have been proposed for electronic voting systems or other similar systems. For a soccer lottery system in particular, it is important to reduce the computational complexity and the amount of communication data required, because we must expect that a large number of tickets will be purchased simultaneously. These problems can be solved by introducing hash functions as the core of protocol. This paper shows a practical soccer lottery system based on bit commitment and hash functions, in which the privacy of prize-winners is protected and illegal acts by the lottery promoter or lottery ticket shops can be revealed.

This paper presents a novel technique for analyzing and designing local communication systems for distributed mobile robotic systems (DMRS). Our goal is to provide an analysis-base guideline for designing local communication systems to efficiently transmit task information to the appropriate robots. In this paper, we propose a layered methodology, i. e. , design from spatial and temporal aspects based on analysis of information diffusion by local communication between robots. The task environment is classified so that each analysis and design is applied in a systematic way. The spatial design gives the optimal communication area for minimizing transmission time for various cooperative tasks. In the temporal design, we derive the information announcing time to avoid excessive information diffusion. The designed local communication is evaluated in comparison with global communication. Finally, we performed simulations and experiments to demonstrate that the analysis and design technique is effective for constructing an efficient local communication system.

Packet concentrators are used in many high-speed computer communication systems such as fast packet switches. In these systems, the time available for concentration is very short. It is therefore desirable to realize the packet concentrators as hardware chips for fast concentration. The knockout concentrator was proposed for hardware realization. In this paper, we improve this concentrator to reduce the probability of packet loss, and the improved concentrator is called wraparound knockout concentrator. This concentrator has several wraparound paths within it, and it does not require any additional pin per chip. After contention among the packets in a slot, each winner goes to a distinct output, some losers circulate along the wraparound paths for contention in the subsequent slot, and the remaining losers are discarded. In this manner, some losers are not discarded immediately and they still have the chance to go to the outputs in the subsequent slot, thereby reducing the probability of packet loss. We analyze the number of logic gates required and the probability of packet loss. The numerical results show that if the proposed concentrator has a few wraparound paths, the probability of packet loss can already be reduced by orders of magnitude.

In cellular systems, autonomous reuse partitioning (ARP) is one of the channel assignment strategy which attains the high spectral efficiency. In the strategy, the movement of mobile stations (MSs) causes the disturbance of reuse partition. Furthermore the smaller cell size causes the spectral efficiency worse. In this paper, we propose a new ARP strategy with reuse partitioning reconstructing, named RP-reconstructing ARP strategy, for microcellular systems. We evaluate the performance of the proposed strategy with blocking rate and forced call termination rate by the computer simulation. The results show that the system with the proposed strategy accommodates 1.5 times as many users as the system with ARP does.

In this paper, a program generator for communication protocol software will be presented. Our program generator takes an extended finite state machine as a domain model and generates a group of C++ classes needed for an implementation. For each state of the FSM, a C++ class is generated, where the interface events are implemented as member functions of the corresponding state object. Protocol data units (PDUs) are embedded as Message objects and specified in the same way as packet filter and is interpreted to generate necessary PDU definition statements and PDU manipulation statements. Also, protocol objects from different layers can be linked together by using an organization model, where a protocol entity is invoked by its upper layer entity or lower layer entity by member function calls.

This paper presents a new design for testing SRAM-based field programmable gate arrays (FPGAs). The original FPGA's SRAM memory is modified so that the FPGA may have the facility to loop the testing configuration data inside the chip. The full testing of the FPGA is achieved by loading typically only one carefully chosen testing configuration data instead of the whole configurations data. The other required configurations data are obtained by shifting the first one inside the chip. As a result, the test becomes faster. This method does not need a large off-chip memory for the test. The evaluation results prove that this method is very effective when the complexity of the configurable blocks (CLBs) or the chip size increases.

A novel protocol scheme is proposed here to compile a program or run a software package. It is a modification where a file can be detected by checking the consistency of the original file with its accompanying digital signature. When an executable program is created it may get infected with some viruses before the signature is attached to it. The infection cannot be detected by signature verification and the origin of the infection cannot be specified either. We propose a signature scheme that let one can sign right in atomic step after the creation of an executable program. Our security-related and cryptographic protocol is used to establish secure communication over insecure open networks and distributed systems. When a server compiles a source program, the compiler automatically creates both the executable program and its signature. Thus no virus can infect the executable programs without being detected. In our proposed signature scheme, the server signature is created a set of proxy secret integers, which is calculated from a compiler maker's secret key. Each server compiler is possessed by its corresponding client user and it is used only when a server secret value is fed into it. The infections of files can be detected by the ordinary server digital signatures. The proposed signature scheme together with the digital signature against infection in the preprocessing step enables us to specify the origin of the infection. Besides that, we also provide the message recovery capability to recover the original file to save the infected files. The most natural extension of this novel protocol scheme is a server-based signature that integrated together with application packages will allow client and the server to commit themselves to one another.

To bridge a wide gap between the end users and the requirements engineers, we propose a business flow diagram for acquiring users' requirements of the object oriented software development in the business application domain. Each field of this diagram shows either a role or a responsibility of a particular person or an organization. This paper proposes a development method that the engineers acquire the requirements by using our diagrams. We have implemented a supporting tool based on this study for collaborating the requirements engineers with their users. At first, the end users of an information system to be developed draw diagrams representing the flows of information and physical objects in their work from their own points of view. Sometimes the engineers write them with the users. If all users submit their diagrams, then our tool collects them and constructs a total diagram. The requirements engineers analyze the total diagram for improving the business flow. After the engineers complete this diagram, our tool can automatically transform it into an initial version of the class diagram. We show the effectiveness of our approach with some experiments. Comparing the related works, we discuss some issues of the practical aspects of this proposal.

This paper discusses the characteristics of human design knowledge. By studying a number of actual human made designs of excellent designers, the most frequent basic mental operations of a typical human designer have been found. They are: a design rule for hierarchical detailing reported previously, a micro design rule for generating a hierarchical expansion, dictionary operations to build a micro design rule and dictionaries. This study assumes a multiplicity of knowledge based on Zipf's theory, "the principle of least effort. " Zipf's principle may be proved and it becomes possible to understand the fundamental nature of human design.

Reverse link performance analysis in single-code and multi-code CDMA systems is presented. Results show that the single-code system yields better performance than does the multi-code system in terms of link capacity and signal power. This improvement increases as spreading bandwidth is reduced and the number of spreading codes assigned to a user is increased.