We consider the routing for a multicast in a WDM all-optical network. We prove a min-max theorem on the number of wavelengths necessary for routing a multicast. Based on the min-max theorem, we propose an efficient on-line algorithm for routing a multicast.

We propose herein a motion detection artificial vision model which uses analog electronic circuits. The proposed model is comprised of four layers. The first layer is a differentiation circuit of the large CR coefficient, and the second layer is a differentiation circuit of the small CR coefficient. Thus, the speed of the movement object is detected. The third layer is a difference circuit for detecting the movement direction, and the fourth layer is a multiple circuit for detecting pure motion output. When the object moves from left to right the model outputs a positive signal, and when the object moves from right to left the model outputs a negative signal. We first designed a one-dimensional model, which we later enhanced to obtain a two-dimensional model. The model was shown to be capable of detecting a movement object in the image. Using analog electronic circuits, the number of connections decrease and real-time processing becomes feasible. In addition, the proposed model offers excellent fault tolerance. Moreover, the proposed model can be used to detect two or more objects, which is advantageous for detection in an environment in which several objects are moving in multiple directions simultaneously. Thus, the proposed model allows practical, cheap movement sensors to be realized for applications such as the measurement of road traffic volume or counting the number of pedestrians in an area. From a technological viewpoint, the proposed model facilitates clarification of the mechanism of the biomedical vision system, which should enable design and simulation by an analog electric circuit for detecting the movement and speed of objects.

Compatibility of conventional lossless discrete cosine transforms (LDCTs) with the discrete cosine transform (DCT) is not high due to rounding operations. In this paper, we design an LDCT which has high compatibility with the DCT. We first design an 8-point DCT (DCT3) by changing the order of row of the transform matrix and also the way of decomposing the DCT in order to obtain an 8-point LDCT which has high compatibility with the DCT. Next we design an 88-point nonseparable 2D LDCT based on a 4-point lossless Walsh-Hadamard Transform (LWHT) which is multiplier-free. The DCT3 is used, when the nonseparable 2D LDCT is designed. Simulation results show that compatibility of the nonseparable 2D LDCT with the separable 2D DCT is high. We also design an 88-point nonseparable 2D LWHT which is multiplier-free and indicate that its compatibility with the separable 2D Walsh-Hadamard Transform is high.

Existing research related to RSVP with mobility support has mainly focused on maintaining reservation state along the routing path, which changes continuously with the movements of mobile host (MH), without much overhead and delay. However, problems such as deepening RSVP's inherent scalability problem and requiring significant changes in the existing network infrastructure have not been adequately addressed. In this paper, we propose a new approach, known as Concatenation and Optimization for Reservation Path (CORP), which addresses these issues. In CORP, each BS pre-establishes pseudo reservations to its neighboring BSs in anticipation of the MH's movement. When the MH moves into another wireless cell, the associated pseudo reservation is activated and concatenated to the existing RSVP session to guarantee continuous QoS support. Because a pseudo reservation is recognized as a normal RSVP session by intermediate routers, little change is required in the current Internet environment to support both movements within a single routing domain and between two different routing domains. CORP also dynamically optimizes the extended reservation path to avoid the infinite path extension problem. Multicast addressing is used to further reduce resource consumption in the optimization process. The experimental results of the CORP implementation demonstrate that it significantly reduces the delay and overhead caused by handoffs compared to the case of establishing a new RSVP session. The improvement increases as the distance between the MH and its correspondent host (CH) grows.

Unicasting video streams over TCP connections is a challenging problem, because video sources cannot normally adapt to delay and throughput variations of TCP connections. This paper describes a method of extending TCP so that TCP connections can effectively carry hierarchically-encoded layered video streams, while being friendly to other competing connections. We call the method Receiver-based Delay Control (RDC). Under RDC, a TCP connection can slow down its transmission rate to avoid congestion by delaying ACK packet generation at the TCP receiver based on congestion notifications from routers. We present the principle behind RDC, argue that it is TCP-friendly, describe an implementation that uses 1-bit congestion notification from routers, and demonstrate by simulations its effectiveness in streaming hierarchically-encoded layered video.

In the Internet, flow analysis and network monitoring have been studied by various methods. Some methods try to make TCP (Transport Control Protocol) traces more readable by showing them graphically. Others such as MRTG, NetScope, and NetFlow read the traffic counters of the routers and record the data for traffic engineering. Even if all of the above methods are useful, they are made only to perform a single task. This paper describes an improved TCP Protocol Machine, a multipurpose tool that can be used for flow analysis, intrusion detection and link congestion monitoring. It is developed based on a finite state machine (automaton). The machine separates the flows into two main groups. If a flow can be mapped to a set of input symbols of the automaton, it is valid, otherwise it is invalid. It can be observed that intruders' attacks are easily detected by the use of the protocol machine. Also link congestion can be monitored, by measuring the percentage of valid flows to the total number of flows. We demonstrate the capability of this tool through measurement and working examples.

Methods usually employed for carrying out division in logic are based on algebraic or Boolean techniques. Algebraic division is fast but results may be less than optimal. Boolean division will yield better results but generally it is much slower because a minimization step is required. In [4], Kim and Dietmeyer proposed a new type of division, called extended algebraic division, and described a heuristic algorithm for it. A feature is that, unlike Boolean division, it does not require a minimization step. The present paper is concerned with an efficient algorithm for exact extended algebraic division. The algorithm was developed within the SIS environment, a program for logic synthesis developed at U.C. Berkeley. Experiments on factoring PLA's demonstrate a significant improvement in quality with a reasonable increase in run time.

Approximately synchronized CDMA (AS-CDMA) can reduce the inter-channel interference in a cell to zero. This property of AS-CDMA is an advantage over the conventional DS-CDMA. However, the inter-cell interference of the AS-CDMA cellular system has not been sufficiently examined previously. Therefore, the synthetic performance of AS-CDMA cellular system also has not been sufficiently clarified previously. Some factors that affect the inter-cell interference of the AS-CDMA cellular system were theoretically examined, and evaluated by using computer simulation. As the result, we found that transmission power control is effective for reducing the inter-cell interference of the AS-CDMA cellular system. In addition, the synthetic performance of AS-CDMA cellular system was clarified for the first time. Consequently, it was also found that the synthetic performance of the AS-CDMA cellular system is higher than that of the conventional DS-CDMA cellular system.

This paper proposes a space division multiplexed - coded orthogonal frequency division multiplexing (SDM-COFDM) scheme for multi-input multi-output (MIMO) based broadband wireless LANs. The proposed scheme reduces inter-channel interference in SDM transmission with a simple feed-forward canceller which multiplies the received symbols by the estimated propagation inverse matrix for each OFDM subcarrier. This paper proposes a new preamble pattern in order to improve power efficiency in the estimation of the propagation matrix. Moreover, the proposed likelihood-weighting scheme, which is based on signal-to-noise power ratio (SNR) of each OFDM subcarrier, improves the error correction performance of soft decision Viterbi decoding. Computer simulation shows that the proposed SDM-COFDM scheme with two transmitting/receiving antennas doubles the transmission rate without increasing the channel bandwidth and achieves almost the same PER performance as the conventional single-channel transmission in frequency selective fading environments. In particular, it achieves more than 100 Mbit/s per 20 MHz by using 64QAM with the coding rate of 3/4.

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.

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.

An adaptive channel access control method for CDMA/PRMA protocol is proposed. The proposed method utilizes a load and backlog based access control. Dynamic optimal channel loads by which the required packet loss probability can be satisfied are obtained. The number of contending terminals is also estimated more accurately, using statistical characteristics of source models. Permission probability is then calculated based on the dynamic optimal channel load and the estimated number of contending terminals such that the mean channel load (the mean number of packets transmitted in each time slot) can be maintained at the optimal channel load. By maintaining the mean channel load at the dynamic optimal channel load, the radio channel can be very effectively utilized, satisfying the required packet loss probability. A backlog based data transmission using a mixed mode of contention and reservation mode is also proposed to reduce redundant contention and corruption. Simulations are carried out in an isolated cell environment and a cellular environment. The simulation results show that the system capacity can be improved significantly by the proposed method compared with the conventional permission control methods.

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.

This paper presents laboratory and field experimental results of the coherent adaptive antenna array diversity (CAAAD) receiver employing receiver antenna-weight generation common to all Rake-combined paths (hereafter path-common weight generation method) in the W-CDMA reverse link, in order to elucidate the suitability of the path-common weight generation method in high-elevation antenna environments such as cellular systems with a macrocell configuration. Laboratory experiments using multipath fading simulators and RF phase shifters elucidate that even when the ratio of the target Eb/I0 of the desired to interfering users is Δ Eb/I0=-12 dB, the increase in the average transmit Eb/N0 employing the CAAAD receiver coupled with fast transmission power control (TPC) using outer-loop control from that for Δ Eb/I0=0 dB is within only 1.0 dB owing to the accurate beam and null steering associated with fast TPC. Furthermore, field experiments demonstrate that the required transmission power at the average block error rate (BLER) of 10-2 employing the CAAAD receiver with four antennas is reduced by more than 2 dB compared to that using a four-branch space diversity receiver using maximum ratio combining (MRC) with the fading correlation between antennas of 0 when Δ Eb/I0=-15 dB and that the loss in the required transmission power of the CAAAD receiver in the same situation as that in a single-user environment is approximately 1 dB. The field experimental results in an actual propagation environment suggest that the CAAAD receiver is effective in suppressing multiple access interference, thus decreasing the required transmission power when the gap in the direction of arrival between the desired user and interfering users is greater than approximately 20 degrees.

Explicit Congestion Notification (ECN) supports the binary congestion information of the network for adjusting the window size. However, this results in the oscillation of the window size and the queue length due to the insufficient congestion information. In this paper, we propose the window-based congestion control mechanism with the modified ECN mechanism. The proposed scheme is based on extracting the network status from the consecutive binary congestion information provided by ECN. From the explicit network information, we estimate the allowable window size to achieve better performance. Through the simulations, the effectiveness of the proposed algorithm is shown as compared with the ECN algorithm.

A key problem under imperfect power control in multimedia DS-CDMA networks is how to guarantee the differentiated outage probabilities of different traffic classes resulted from the uncertainty of received powers. In addition, in order to utilize the scarce wireless resource efficiently, as many users as possible should be admitted into the network while providing guaranteed quality-of-service support for them. In this work, a call admission control scheme, Differentiated Outage Probabilities CAC or DOP-CAC, is proposed to achieve the above goals for imperfectly power-controlled multimedia CDMA networks. Two important features of CDMA systems are considered in our scheme: one is the power multiplexing among bursty traffics and the other is the power allocation scheme employed at the physical layer. The validity and efficiency of DOP-CAC are verified by numerical examples. Two power allocation schemes, Limited Optimal Power Allocation (LOPA) proposed in [3] and Quasi-Optimal Power Allocation (QOPA) we proposed in [6], are considered respectively and compared in the performance evaluation of DOP-CAC. The results show that DOP-CAC achieves much better resource utilization under QOPA than it does under LOPA. By employing QOPA at the physical layer and DOP-CAC at the link layer, our work suggests a high efficiency solution for QoS support of multimedia traffic under imperfect power control environment.

This paper proposes a multipath interference canceller (MPIC) employing multipath interference (MPI) replica generation (MIG) utilizing previously transmitted packet combining (PTPC), which is well-suited to incremental redundancy, in order to achieve a peak throughput of nearly 8 Mbps in a multipath fading environment in high-speed downlink packet access (HSDPA). In our scheme, more accurate MPI replica generation is possible by generating MPI replicas utilizing the soft-decision symbol sequence of the previously transmitted packets in addition to that of the latest transmitted packet. Computer simulation results elucidate that the achievable throughput of the MPIC employing MIG-PTPC is increased by approximately 100 kbps and 200 kbps and the required average received signal energy per symbol-to-background noise power spectrum density ratio (Es/N0) per antenna at the throughput of 0.8 normalized by the maximum throughput is improved by about 0.3 and 0.7 dB compared to that of the MPIC using the soft-decision symbol sequence after Rake combining of the last transmitted packet both in 2- and 3-path Rayleigh fading channels for QPSK and 16QAM data modulations, respectively. Furthermore, we clarify that the maximum peak throughput using the proposed MPIC with MIG-PTPC coupled with incremental redundancy achieves approximately 7 Mbps and 8 Mbps with 16QAM and 64QAM data modulations in a 2-path Rayleigh fading channel, respectively, within a 5-MHz bandwidth.

A number of results on the estimation of direction of arrival have been obtained based on the assumption that the signal sources are point sources. Recently, it has been shown that signal source localization can be accomplished more adequately with distributed source models in some real surroundings. In this paper, we consider modeling of three-dimensional distributed signal sources, in which a source location is represented by the center angles and degrees of dispersion. We address estimation of the elevation and azimuth angles of distributed sources based on the proposed distributed source modeling in the three-dimensional space using two linear arrays. Some examples are included to more explicitly show the estimation procedures under the model: numerical results obtained by a MUSIC-based method with two uniform linear arrays are discussed.

We propose and demonstrate a novel method to measure the polarization mode dispersion (PMD) of optical devices. The device under test (DUT) is installed in a fiber laser cavity which can operate at multiwavelength. PMD can be evaluated by the wavelength spacing of the multiwavelength laser output spectrum. In our method, the maximum extrema wavelength is easier to be identified than in the conventional fixed-analyzer (FA) method. We measure the PMD of polarization maintaining fibers (PMFs) and the ITU-T round robin KDD samples.

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.