CRL (Communications Research Laboratory, Independent Administrative Institution Japan) is developing a road to vehicle multiple-service communication system based on RoF (Radio over Fiber) technology in a millimeter-wave frequency region of 36-37 GHz. In the experimental system, vehicle can receive three wireless services such as PHS (Personal Handy-phone System), ETC (Electronic Toll Collection system), SB (Satellite Broadcasting). In this paper, the system concept and experimental system configuration are introduced. Furthermore, SDR (Software Defined Radio) mobile terminal technology is mentioned and a new concept for a next generation mobile communication network system based on RoF is proposed.

As a method of analyzing the wave scattering from a finite periodic surface, this paper introduces a periodic approach. The approach first considers the wave diffraction by a periodic surface that is a superposition of surface profiles generated by displacing the finite periodic surface by every integer multiple of the period . It is pointed out that the Floquet solution for such a periodic case becomes an integral representation of the scattered field from the finite periodic surface when the period goes to infinity. A mathematical relation estimating the scattering amplitude for the finite periodic surface from the diffraction amplitude for the periodic surface is proposed. From some numerical examples, it is concluded that the scattering cross section for the finite periodic surface can be well estimated from the diffraction amplitude for a sufficiently large .

This paper considers a high-rate turbo code which employs high-rate convolutional codes as component codes, and presents a novel method of reducing the decoding complexity of the codes. By eliminating some of branches that have the lowest reliabilities among all the branches entering each node, the proposed algorithm reduces the complexity in the process of the add-compare-select (ACS) between the consecutive stages of iterative decoding. That is, the complexity gradually decreases as the number of iterations increases. We compare the unpunctured high-rate turbo code with a classical punctured high-rate turbo code in terms of performance/complexity trade-off under the same code rate. Simulation results show that the proposed approach with a good trade-off provides an alternative coding scheme to the classical punctured high-rate turbo coding for the application to high-data-rate wireless communication systems.

This paper investigates the stochastic property of the packet destinations and proposes an address generation algorithm which is applicable for describing various Internet access patterns. We assume that a stochastic process of Internet access satisfies the stationary condition and derive the fundamental structure of the address generation algorithm. Pseudo IP-address sequence generated from our algorithm gives dependable cache performance and reproduces the results obtained from trace-driven simulation. The proposed algorithm is applicable not only to the destination IP address but also to the destination URLs of packets, and is useful for simulation studies of Internet performance, Web caching, DNS, and so on.

Recently, the Guaranteed Frame Rate (GFR) service was proposed as a new service category of ATM to support non-realtime data applications and to provide the minimum rate guarantee. To keep the simplicity of GFR as much as possible and overcome defects of FIFO-based mechanisms, we propose a FIFO-based algorithm extending DFBA one to improve the fairness and provide the minimum rate guarantee for a wider range of Minimum Cell Rate (MCR). The key idea is controlling the number of CLP1 cells which are occupying more buffer space than the fair share even when the queue length is below Low Buffer Occupancy (LBO).

In the past, a number of scheduling algorithms that approximate GPS, such as WFQ, have been proposed and have received much attention. This class of algorithms provides per-flow QoS guarantees in terms of the bounded delay and minimum bandwidth guarantee. However, with O(log N) computational cost for each new arrival scheduling, where N is the number of backlogged flows, these algorithms are expensive to implement (e.g., in terms of scalability). Moreover, none of them addresses the issues of delay distribution and jitter. In this paper, we propose a new traffic scheduling discipline called Jitter Control Frame-based Queueing (JCFQ) that provides an upper bound for delay jitter in the case of rate-controlled connections, such as packet video streams and IP telephony, while guaranteeing bounded delay and worst-case fair weighted fairness, such as in the WF2Q algorithm, but with O(1) complexity in selecting the next packet to serve, assuming that the number of flows is fixed. Three different algorithms for slot or service order assignment between flows are proposed: Earliest Jitter Deadline First (EJDF), Rate Monotonic (RM) and Maximum Jitter First (MJF). In these algorithms, delay jitter is formulated into the virtual finish time calculation. We compare the fairness, delay and jitter performance of the JCFQ with that of the MJF algorithm with WF2Q via simulation. The results show that with proper choice of the slot size, JCFQ can achieve better flow isolation in delay distribution than can WF2Q.

It has been reported that IP packet traffic exhibits the self-similar nature and causes the degradation of network performance. Therefore it is crucial for the appropriate buffer design of routers and switches to predict the queueing behavior with self-similar input. It is well known that the fitting methods based on the second-order statistics of counts for the arrival process are not sufficient for predicting the performance of the queueing system with self-similar input. However recent studies have revealed that the loss probability of finite queuing system can be well approximated by the Markovian input models. This paper studies the time-scale impact on the loss probability of MMPP/D/1/K system where the MMPP is generated so as to match the variance of the self-similar process over specified time-scales. We investigate the loss probability in terms of system size, Hurst parameters and time-scales. We also compare the loss probability of resulting MMPP/D/1/K with simulation. Numerical results show that the loss probability of MMPP/D/1/K are not significantly affected by time-scale and that the loss probability is well approximated with resulting MMPP/D/1/K.

In the future Internet, various kinds of services will rapidly increase its volume and require different qualities. Thus, it is main technical problem to guarantee various QoS to each connection. However, in the current IP networks where most applications use TCP as transport protocol, most typical packet discarding scheme, RED (Random Early Detection), causes unfairness such as the difference of bandwidth sharing among flows traversing the same router. To dissolve this problem, we consider that two viewpoints are important associated with flow-base fairness. One is instantaneous flow condition and the other is historical flow condition. In this paper, we propose the packet discarding scheme considering both instantaneous and historical use of network resources for the purpose of dissolving unfairness of each flow and improving the flow-base QoS. We call this proposal method "Random Early Drop with Dual-fairness metrics (DRED). " DRED can improve whole throughput and transfer completion time of information such as a file, etc.

Using Available Bit Rate (ABR) service of Asynchronous Transfer Mode (ATM) at a backbone link will provide a lossless network. It, however, causes congestion at an edge-router and is reported to show poor end-to-end TCP performance. We consider how to improve the performance of TCP over a backbone ABR network. By using ABR feedback information (ACR) at edge-routers, we can adjust intervals of TCP Acknowledgement packets. This adjustment couples the ABR rate-based control loop and the TCP window-based control loop. Based on this scheme, we can achieve a good end-to-end TCP performance as well as good ATM layer performance over backbone ABR. This paper describes comprehensive study on the proposed mechanism.

The unidirectional transmission links such as broadcast satellite links and cable links are strongly demanding type of link to provide high bandwidth and ubiquitous Internet connectivity with lower cost. In order to provide an internet connectivity, the UDLs, unidirectional links, should be available for the IP service. However, since the current Internet routing and upper layer protocols assume the bi-directional link, the UDLs have been considered as unavailable links for the IP service. This paper proposes an architecture and a mechanism for the IP service over the UDL. The proposed system emulates the bi-directional connectivity between all nodes on the UDL, in order to use the dynamic routing protocol, the TCP/IP protocol, on the UDL system. Receiver uses a link layer tunneling mechanism to forward the IP datagrams to the Feed over an IP cloud, that is not directly connected to the UDL. This proposed architecture enables the dynamic routing capability for UDLs, as well as user applications, without any software modification.

In this paper we study the scalability issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning. We propose and develop a path-oriented, quota-based dynamic bandwidth allocation mechanism for efficient admission control operations under the centralized bandwidth broker model. We demonstrate that this dynamic bandwidth allocation mechanism can significantly reduce the overall number of QoS state accesses/updates, thereby increasing the overall call processing capability of the bandwidth broker. Based on the proposed dynamic bandwidth allocation mechanism, we also extend the centralized architecture with a single bandwidth broker to a hierarchically distributed architecture with multiple bandwidth brokers to further improve its scalability. Our study demonstrates that the bandwidth broker architecture can be designed in such a manner that it scales with the increase in the network capacity.

The current voltage characteristics of the ballistic metal oxide semiconductor field effect transistor (MOSFET) is reviewed. Reducing the carrier scattering by employing e.g. the intrinsic channel structure and the low temperature operation, nanometer to sub-0.1 µm size MOSFETs operation approaches the ballistic transport. The drain current is derived by analyzing the carrier behavior in the vicinity of the potential maximum in the channel. The carrier degeneracy and the predominant carrier distribution in the lowest subband around the maximum point have critical effects on the current value. A convenient approximation of the current in terms of terminal voltages is given. The current control mechanism is discussed with use of the "Injection velocity," with which carriers are injected from the source to the channel. An index to represent the ballisticity is given, and some published experimental data are analyzed. Transport of the quasi-ballistic MOSFET is discussed.

Negative differential conductance based on lateral interband tunnel effect is demonstrated in a planar degenerate p+-n+ diode (Esaki tunnel diode). The device is fabricated with the current silicon ultralarge scale integration (Si ULSI) process, paying attention to the processing damage so as to reduce an excess tunnel current that flows over some intermediate states in the tunnel junction. I-V characteristics at a low temperature clearly show an intrinsic electron transport, indicating phonon-assisted tunneling in Si as in the case of the previous Esaki diodes fabricated by the alloying method. In addition, a simple circuit function of bistable operation is demonstrated by connecting the planar Esaki diode with conventional Si metal-oxide-semiconductor field effect transistors (MOSFETs). The planar Esaki diode will be a promising device element in the functional library for enhancing the total system performance for the coming system-on-a-chip (SoC) era.

Linear adaptive digital filters are applied to various fields for their simplicity in the design and implementation. Considering many kinds of nonlinearities inherent in practical systems, however, nonlinear adaptive filtering will be more desirable. This paper presents a design method for multi-input single-output nonlinear adaptive digital filters using recurrent neural networks. Furthermore, in comparison with this method and the method based on the conventional linear theory, if the proposed method is used, better results can be obtained, and, it is possible that the learning efficiency is improved, because the parallel learning is carried out in this method. Finally, the results of computer simulation are presented to illustrate the effectiveness of the proposed method.

This paper presents a new network architecture called LINA that provides node mobility. The basic concept of LINA is separation of the node identifier and the interface locator. Although there are several protocols based on such a concept, they do not address issues that arise when dealing with an entire network architecture. LINA is a holistic architecture covering the network layer to the application layer in order to support node mobility. Overhead incurred by separation of the node identifier and the interface locator is minimized in LINA by introducing the embedded addressing model. This paper also presents a new protocol called LIN6 that supports IPv6 mobility. LIN6 is an application of LINA to IPv6 and is fully compatible with IPv6. It has several advantages in comparison to Mobile IPv6, e.g. less protocol overhead. Our prototype implementation of LIN6 shows minimal overhead compared to a conventional IPv6 implementation.

The formulation of the process of analog system design has been done on the basis of the control theory application. This approach generalizes the design process and produces different design trajectories inside the same optimization procedure. The problem of the optimal design algorithm construction is defined as the minimal-time problem of the control theory. The main equations for the proposed design methodology were elaborated. These equations include the special control functions that are introduced artificially to generalize the design problem. Optimal dependencies of the control functions give the possibility to reduce the total computer design time. This idea was tested with different optimization algorithms of the design process. Numerical results of some simple electronic circuit design demonstrate the efficiency of the proposed approach. These examples show that the traditional design strategy is not time-optimal and the potential computer time gain of the optimal design strategy increases when the size and complexity of the system increase.

This paper presents a digital reaction-diffusion system (DRDS)--a model of a discrete-time discrete-space reaction-diffusion dynamical system--for designing new image processing algorithms inspired by biological pattern formation phenomena. The original idea is based on the Turing's model of pattern formation which is widely known in mathematical biology. We first show that the Turing's morphogenesis can be understood by analyzing the pattern forming property of the DRDS within the framework of multidimensional digital signal processing theory. This paper also describes the design of an adaptive DRDS for image processing tasks, such as enhancement and restoration of fingerprint images.

In this paper, a novel adaptive digital watermarking approach based upon human visual system model and fuzzy clustering technique is proposed. The human visual system model is utilized to guarantee that the watermarked image is imperceptible. The fuzzy clustering approach has been employed to obtain the different strength of watermark by the local characters of image. In our experiments, this scheme allows us to provide a more robust and transparent watermark.

In two- or more-dimensional systems where the components of the sample data are strongly correlated, it is not proper to divide the input space into several subspaces without considering the correlation. In this paper, we propose the usage of the method of principal component in order to uncorrelate and remove any redundancy from the input space of the adaptive neuro-fuzzy inference system (ANFIS). This leads to an effective partition of the input space to the fuzzy model and significantly reduces the modeling error. A computer simulation for two frequently used benchmark problems shows that ANFIS with the uncorrelation process performs better than the original ANFIS under the same conditions.

This paper proposes a measure of coefficient quantization errors for linear discrete-time state-space systems. The proposed measure of state-space systems agrees with the actual output error variance since it is derived from the exact evaluation of the output error variance due to coefficient deviation. The measure in this paper is represented by the controllability and the observability gramians and the state covariance matrix of the system. When the variance of coefficient variations is very small, the proposed measure is identical to the conventional statistical sensitivity of state-space systems. This paper also proposes a method of synthesizing minimum measure structures. Numerical examples show that the proposed measure is in very good agreement with the actual output error variance, and that minimum measure structures have a very small degradation of the frequency characteristic due to coefficient quantization.