Optical code division multiplexing (OCDM) is the other class of multiplexing techniques than time division multiplexing (TDM), wavelength division multiplexing (WDM) and space division multiplexing (SDM). OCDM has been proposed in mid '70s. It has been long since OCDM remains outside the mainstream of research community of optical communications, however, possible scarcity of the wavelength resource in future photonic networks, the simple access protocol as well as versatility of optical codes motivate recent growth of OCDM research activities. In this paper, first, fundamentals of OCDM concept are presented, highlighting optical encoding and optical time gate detection which realize time spreading/despreading. Next, current research activities of OCDM are reviewed by focusing particularly on the optical implementations and the proof-of-concept experiments. It is devoted to three categories; high bit rate point-to-point transmissions, gigabit multiple access, followed by optical path networks using optical code. Finally, future issues are briefly summarized.

We propose a model for fault tolerant 3D processor arrays using one-and-half track switches. Spare processors are laid on the two opposite surfaces of the 3D array. The fault compensation process is performed by shifting processors on a continuous straight line (called compensation path) from a faulty processor to a spare on the surfaces. It is not allowed that compensantion paths are in the near-miss relation each other. Then, switches with only 4 states are needed to preserve the 3D mesh topology after compensating for faults. We give an algorithm in a convenient form for reconfiguring by hardware the 3D mesh arrays with faults. The algorithm can reconfigure the 3D mesh arrays in polynomial time. By computer simulation, we show the survival rates and the reliabilities of arrays which express the efficiencies of reconfiguration according to the algorithm. The reliabilities are compared with those of the model using double tracks for which the near-miss relation among compensation paths is allowed, but whose hardware overhead is almost double of that of the proposed model using one-and-half track. Finally, we design a logical circuit for hardware realization of the algorithm. Using the circuit, we can construct such a built-in self-reconfigurable 3D mesh array that the reconfiguration is done very quickly without an aid of a host computer.

Multi-carrier (MC) signal has a large peak to mean envelope power ratio, so that the MC signal suffers from a high level of inter-modulation distortion due to the nonlinearity of the power amplifier stage. For portable terminals, it is undesirable to use linear amplifiers because high power efficiency is needed. To solve this problem, we propose a time division duplex (TDD)-code division multiple access (CDMA) communication system which uses an asymmetric modulation scheme between the forward and reverse links. The system consists of multicarrier modulation for the forward link and single carrier modulation for the reverse link. A pre-equalization method for the forward link transmission is also presented in this paper. In frequency selective fading, the system achieves a path diversity effect without any channel estimation unit at the mobile station by using the pre-phase equalizer. From the simulation results, it it found that the proposed system achieves better BER performance than the conventional MC-CDMA system and the single carrier RAKE system equipped at the mobile unit since the proposed system has the ability to suppress other user interfering signals.

To improve frequency efficiency or user capacity in multi-path fading environments, we introduce and investigate an orthogonal multi-carrier frequency hopping-code division multiple access (FH-CDMA). These improvements are achieved by combining the orthogonal frequency division multiplexing (OFDM) and FH-CDMA schemes. The basic idea has been previously proposed by the authors. The aim of study in this paper is to evaluate the performance of this scheme in various environments. The theoretical analysis of bit error rate (BER) performance in this paper includes the effects of frequency selective fading in land mobile communications and of nonlinear amplification in satellite communications. A modified scheme of controlling transmission power to be controlled according to the number of simultaneously accessing users is also discussed. This modified scheme improves BER performance for frequency selective fading when the number of simultaneously accessing users in a cellular zone is small. Furthermore, an error-correcting code and its erasure decoding are applied in order to reduce errors due to hits in asynchronous FH/CDMA for reverse link as well as errors due to fading and noise.

This paper proposes a novel spread spectrum (SS) modem for random access satellite communication systems that employs digital matched filters. The proposed modem employs a parallel structure to ensure detection of packet arrival. Code timing detection with a combination of a coarse detector and a fractional error detector reduces the sampling rate while maintaining the BER performance. An in-symbol pilot multiplexing scheme is also proposed for fast and stable carrier synchronization with a simple hardware. A performance evaluation shows that the proposed modem achieves the UW miss-detection probability of 10-4 at the Eb/No of 0 dB. The overall BER performance achieved in experiments well agrees simulation.

Due to the large number of I/O's in a Ball-Grid-Array (BGA) package, routing becomes more and more an important work. A ring-based router for the BGA package is presented in this paper to interconnect each I/O pad of a chip to a corresponding ball distributed on the substrate area. The major phases for the router consist of layer assignment, topological routing, and physical routing. Using this router, we can generate an even distribution of planar and any-angle wires to improve manufacturing yield. We have also conducted various testing examples to verify the efficiency of this router. Experiments show that the router produces very good results, far better than the manual design, thus it can be applied to the practical packaging of integrated circuits.

Internet communication is increasingly becoming an important element in daily life. Keeping this network safe from malicious elements is an urgent task for network management. To maintain the security level networks are generally, monitored for indications of usage with ill-intentions. Such indications are events which need to be collated, correlated and analyzed in real-time to be effective. However, on an average medium to large size network the number of such events are very large. This makes it practically impossible to analyze the information in real-time and provide the necessary security measures. In this paper, we propose a mechanism that keeps the number of events, to be analyzed, low thereby making it possible to provide ample security measures. We discuss a real-time Intrusion Detection System (IDS) for detecting network attacks. The system looks out for TCP ACK/RST packets, which are generally caused by network scans. The system can extract the tendency of network flows in real-time, based on the newly developed time-based clustering and Dynamic Access Tree creation techniques. The algorithm, implemented and deployed on a medium size backbone network using RMON (Remote MONitoring) technology, successfully detected 195 intrusion attempts during a one month period. The results of the pilot deployment are discussed. In this paper, the proposal, implementation and evaluation will be described.

In this paper, a method of Transmission Power Control (TPC) for Orthogonal Frequency Division Multiplexing Direct Sequence Code Division Multiple Access (OFDM-DS-CDMA), in order to compensate for power attenuation at each subcarrier, is proposed. Instead of assigning same power levels for all-subcarriers, different transmission power levels are assigned to different subcarriers, according to the attenuation of the subcarriers. System performance, in terms of Bit Error Rate (BER), has been evaluated by Monte Carlo simulation. The simulation results presented significant improvement, the proposed system performed much better than the system without TPC. It is shown that the Each Carrier TPC performs better than All Carriers TPC, which all carriers are controlled uniformly, hence Each Carrier TPC is more suitable for OFDM-DS-CDMA system.

In this letter, the probability of error performance improvements by rain fade countermeasure techniques is analyzed in a Ka-band geostationary satellite communication system using synchronous CDMA scheme, when power control and macrodiversity are used as rain fade countermeasures. Numerical results show that the composite power control plus macroscopic selection diversity system is better than that of utilizing only one technique as a countermeasure of rain fading.

A procedure for quickly developing highly integrated multifunctional MMICs by using the three-dimensional masterslice MMIC technology has been developed. The structures and advanced features of this technology, such as miniature transmission lines, a broadside coupler, and miniature function block circuits, enable multifunctional MMICs to be quickly and easily developed. These unique features and basic concept of the masterslice technology are discussed and reviewed to examine the advantages of this technology. As an example of quick MMIC development, an amplifier, a mixer, and a down-converter are fabricated on a newly designed master array.

In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σi,ρi) where σi is the bucket size (or burstiness) and ρi is the leaky rate. Compared with the totally isolated scheme where connection i is allocated a bandwidth ri=max{σi/di,ρi} (di is the delay bound requirement of connection i), the DM/ARR algorithm has a better performance in the sense that it has a larger admission region. We prove that, among all possible scheduling algorithms that satisfy the delay bound requirements of established connections, DM/ARR results in the minimum output burstiness. This is important because a smaller burstiness implies a smoother traffic and thus the receiver (or next switch node in a multihop network) can handle it more easily. Numerical results show that the admission region of the DM/ARR algorithm is close to that of the earliest deadline first algorithm. A packetized version is studied for ATM networks.

At the Information-technology Promotion Agency (IPA), we have been developing a network intrusion detection system called IDA (Intrusion Detection Agent system). IDA system has two distinctive features that most conventional intrusion detection systems lack. First, it has a mechanism for tracing the origin of a break-in by means of mobile agents. Second, it has a new and efficient method of detecting intrusions: rather than continuously monitoring the user's activities, it watches for an event that meets the criteria of an MLSI (Mark Left by Suspected Intruders) and may relate to an intrusion. By this method, IDA described herein can reduce the processing overhead of systems and networks. At present, IDA can detect local attacks that are initiated against a machine to which the attacker already has access and he or she attempts to exceed his or her authority. This paper mainly describes how IDA detects local attacks and traces intrusions.

We present a symbolic language emptiness check algorithm based on forward state traversal. A verification property is given by a set of error traces written in ω-regular expression and is manipulated explicitly as a non-deterministic state transition graph. State space of the design model is implicitly traversed along the explicit graph. This method has a large amount of flexibility for controlling state traversal on the property space. It should become a good framework of incremental or approximate verification of ω-regular properties.

Reducing code size is crucial in embedded systems as well as in high-performance systems to overcome the communication bottleneck between memory and CPU, especially with VLIW (Very Long Instruction Word) processors that require a high-bandwidth instruction prefetching. This paper presents a new approach for dictionary-based code compression in VLIW processor-based systems using isomorphism among instruction words. After we divide instruction words into two groups, one for opcode group and the other for operand group, the proposed compression algorithm is applied to each group for maximal code compression. Frequently-used instruction words are extracted from the original code to be mapped into two dictionaries, an opcode dictionary and an operand dictionary. According to the SPEC95 benchmarks, the proposed technique has achieved an average code compression ratio of 63%, 69%, and 71% in a 4-issue, 8-issue, and 12-issue VLIW architecture, respectively.

This paper proposes a method to construct smaller binary decision diagrams for characteristic functions (BDDs for CFs). A BDD for CF represents an n-input m-output function, and evaluates all the outputs in O(n+m) time. We derive an upper bound on the number of nodes of the BDD for CF of n-bit adders (adrn). We also compare complexities of BDDs for CFs with those of shared binary decision diagrams (SBDDs) and multi-terminal binary decision diagrams (MTBDDs). Our experimental results show: 1) BDDs for CFs are usually much smaller than MTBDDs; 2) for adrn and for some benchmark circuits, BDDs for CFs are the smallest among the three types of BDDs; and 3) the proposed method often produces smaller BDDs for CFs than an existing method.

There are two approaches for formal verification of sequential designs or finite state machines: language containment checking and symbolic model checking. To verify designs of practical size, in these two approaches, designs are represented symbolically, in practice, by ordered binary decision diagrams. In the conventional algorithm for language containment checking, finite automata given as specifications are also represented symbolically. This paper proposes a new method, called partially explicit method for checking language containment. By representing states of finite automata given as specifications explicitly, this method can remove redundant computations, and as a result, provide better performance than the conventional method which uses the product machines of designs and specifications. The experimental results show that this approach is effective in checking language containment symbolically.

Human visual system can perceive 3-D structure of an object by binocular disparity, gradient of illumination (shading), occlusion, textures, perspective and so forth. Among them, binocular disparity seems to be the essentially important cues for the 3-D space perception and it is used widely for displaying 3-D visual circumstances such as in VR (virtual reality) system or 3-D TV. Visual illusions seem to be one of the phenomena which are purely reflecting the mechanism of human visual system. In the recent several years, the authors found several new types of 3-D visual illusions with binocular viewing. Entire 3-D illusory object including volume perception, transparency, dynamic illusions can be perceived only from the visual stimuli of disparity given by some inducing objects arranged with suitable relations. In this report, the authors introduced these newly found visual illusions and made some considerations on the human visual mechanism of 3-D perception and on their exploitation for new effective techniques in 3-D display. They introduced especially on the visual effect in two kinds of arrangement with occlusion and sustaining relationship between the illusory object and inducing objects. In the former case, the inducing objects which provide the stimuli were named as occlusion cues and classified into two types: contour occlusion cues and bulky occlusion cues. In the later case, those inducing objects were named as sustaining cues and a 3-D fully transparent illusory object was perceived. The perception was just like imagined from the scenes of the actions and positions of the pantomimists; then this phenomena was named as "Mime (Pantomime) Effect. " According to the positions of sustaining cues, they played different actions in this perception, and they are classified into three types: front sustaining cues, side sustaining cues and back sustaining cues. In addition, dynamic fusion and separation of volumetrical illusory objects were perceived when the visual stimuli were moving continuously between two structurally different conditions. Then the hysteresis was recognized in geometrical position between the fusion and separation. The authors believe that the occlusion cues and sustaining cues introduced in this paper could be effective clues for exploiting the new techniques for 3-D display.

The minimum mean-squared error (MMSE) linear detector has been proposed to successfully suppress the multiple access interference and mitigate the near-far problem in direct-sequence code-division multiple access communication systems. In the presence of unknown or time-varying channel parameters, the MMSE linear detector can be implemented by the blind Griffiths' algorithm, which uses the desired signal vector instead of a training sequence of symbols for initial adaptation. In this paper, a variable step-size (VSS) Griffiths' algorithm is proposed for accelerating the convergence speed, especially in the presence of strong interference. Numerical results show that the convergence properties of the VSS Griffiths' algorithm are robust against the wide eigenvalue-spread problem of the correlation matrix associated with the received signal vector compared to the Griffiths' algorithm using a fixed step-size.

Since cryptosystem based on the problem of factoring the composite number N can be attacked with P-1 and P+1 methods, it is required that P-1 and P+1 should be difficult to be factored into many small primes, where we assume that the P is a factor of N. In this paper, first, we consider the distribution of secure primes against both P-1 and P+1 methods. Second, we propose two efficient algorithms for generating secure primes against both P-1 and P+1 methods by extending the trial division method.

This paper clarifies two variable-to-fixed length codes which achieve optimum large deviations performance of empirical compression ratio. One is Lempel-Ziv code with fixed number of phrases, and the other is an arithmetic code with fixed codeword length. It is shown that Lempel-Ziv code is asymptotically optimum in the above sense, for the class of finite-alphabet and finite-state sources, and that the arithmetic code is asymptotically optimum for the class of finite-alphabet unifilar sources.