The design of a liner decorrelating detector for multi-processing gain code-division multiple-access (MPG-CDMA) systems is proposed, and its performance is discussed. As the result, the performance improvement by this detector is confirmed. Also, it is found that that the degrees of the noise enhancement depend on the processing gains of the signals.

Traffic management schemes such as Connection Admission Control (CAC), policing, and traffic shaping are important to provide multimedia communications with better Quality of Service (QoS). In the conventional model, admission control and policing are done at intermediate nodes, and traffic shaping is done at the edge of a network. However, QoS of communications should be defined between tasks or threads rather than between hosts. Therefore traffic management inside a host is as important as that in networks. We propose software-based traffic management architecture over a real-time microkernel. The architecture focuses on the interface between a network driver and user threads calling the driver. We categorized services of communication threads into three classes: Real-Time at Guaranteed Rate (RT-GR), Real-Time at Available Rate (RT-AR), and Best-Effort (BE). Our architecture is designed for an environment containing a mixture of these services. In the architecture, a sender periodic thread of RT-GR or RT-AR is executed such that the sending rate matches a user-specified rate. The network driver monitors the per-flow rate of injected data and discards the data if the injected rate exceeds the user-specified rate. To avoid the continuous discarding of data, the sending thread can adjust its sending rate by periodically looking at logged data concerning the rate. RT-AR service can achieve more than the specified rate when bandwidth is available. The scheme of software traffic management is effective in attaining higher throughput not only for full-duplex Ethernet but also for ATM because the difference of rate between hardware and software is reduced. In this paper, we describe the design and implementation of the software-based traffic management architecture on Real-Time Mach. The results of performance evaluations demonstrate that our traffic management scheme performs well for full-duplex Ethernet.

In this paper we present a Quality of Service (QoS) management architecture for distributed multimedia applications in heterogeneous communication environments of wired and wireless networks. Gaps in network performance such as bandwidths and error rates between wired and wireless networks, as well as gaps in terminal performance in media handling between desktop computers and handheld computers, bring about heterogeneities. Furthermore, even performance gaps among various desktop computers cause heterogeneities. As a result of these heterogeneities in network and terminal performances and various user preferences, the QoS requirement from each receiver is different. Therefore, mechanisms that adjust and satisfy each QoS requirement are needed. We propose a proxy server called Communication Coordination Server (CCS), which intermediates a video server and a receiver and manages the QoS coordination. The CCS performs QoS admission, adjustment, and allocation mechanisms to satisfy the user's QoS requirement. Then transcoding is used to realize the allocated QoS, and it decodes the input video stream from the video server and encodes it within the CCS. A QoS mapping mechanism that translates application-level QoS into resource-level QoS is needed for the QoS admission. We also propose a new QoS mapping mechanism using spline functions that enables a continuous QoS translation. We have built a CCS prototype in our laboratory testbed, and have verified that the CCS can resolve the heterogeneities between the server and receiver by the QoS adjustment mechanism of the transcoding and the QoS admission.

We investigated the reflection of light caused by sharp bends in optical fiber experimentally. The position distribution of reflection power was measured using an OTDR and an OLCR. We found that the reflection power increased linearly as the logarithm of the bending loss increased, which agrees with expectation from a simple theoretical model. We believe that the light we observed was part of the leaked light, which was reflected between the primary and secondary coatings.

Multimedia service users can require multi-services according to their own environment for accessing to public networks. For copying with customer-oriented service requirements, network providers have to prepare multi-layer service networks. This paper deals with frame relay, ATM and IP networking services on multi-layer networks. In order to provide multiple data services, network provider needs to define and make use of client-server and interworking relationships between these networks. In this paper, we propose a service management architecture in order to efficiently manage multiple services and network resources from service point of view. The proposed service management architecture includes functionalities such as subscription management, customer-network management, communication session management, and business layer support management. Especially, it describes an information model for managing multi-layer networks by way of the interworking or client-server relationship. The proposed functionalities are modeled in accordance with the object-oriented modeling concept and implemented on a CORBA platform. The applications on the proposed architecture include VPN services and various statistical services for customers and the carrier. The realized system is to be used for Koera Telecom's high speed networks mainly for supporting Internet services.

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.

A new data-I/O scheme with a hidden writing-recovery architecture has been developed for the megabit-class high operating frequency SRAMs. Read-out nodes in the memory cell are separated from bitline-connected writing nodes so as not to delay sensing initiation due to uncompleted bitline recovery. The data stored in a memory cell are read-out by sensing the differential current signal on a double-rail virtual-GND line along bitlines. Each pair of virtual-GND lines is imaginarily short-circuited by a sense amplifier, so that the read-out circuitry would have large immunity against virtual-GND-line noises. The critical noise level associated with data destruction is analyzed at various supply voltages. The virtual-GND-line-sensed memory cell with the squashed topology, the swing-suppression-type low-power writing circuitry, and the current-sense amplifier with extra negative feedback loops, --which are used in the data-I/O scheme are also mentioned. Assuming a sub array in megabit-class SRAMs, 4 K-words 6 -bits test chip was fabricated with a 0.5-µm CMOS process. The SRAM achieved 180-MHz operation at a typical 3.3-V, 25 condition. The power dissipation at the practical operating frequency of 133-MHz was 50-mW.

The Matrix-Pencil (MP) method is applied to the estimation of the undesired radiation from the microstrip line discontinuities. The Q factors are obtained from the complex resonant frequencies estimated from FDTD transient field by using MP. The number of the damped oscillations is estimated by using MDL which is widely used as an information theoretic criterion for the model order estimation.

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.

This paper proposes an implementation of the Telecommunications Information Networking Architecture (TINA) connection management system, based on our involvement of The TINA Trial (TTT). The system is used for managing ATM networks, which consist of network elements with SNMP interfaces. It provides setup, configuration, and release of ATM connection with a GUI-based network design tool that generates network resource data used for deploying TINA software components. This paper reports on a method of implementing TINA components over a Distributed Processing Environment (DPE) and an effective way to manage computational objects with multiple interfaces by using the Trading Service.

The design of high performance-circuits using Field-Programmable Gate Arrays (FPGAs) requires a balance between the FPGA's architecture and CAD algorithms. Conventional FPGAs and CAD algorithms are developed independently, which makes it difficult to implement application circuits. To solve this problem, we developed a CAD-verified FPGA whose architecture was designed at the same time as the CAD algorithms. This paper shows how a CAD-verified FPGA architecture can simplify a routing algorithm. The algorithm is studied in terms of computational complexity and is simplified using the properties of our FPGA (switch module structure and the number of routing resources). The routing algorithm is almost one hundred times faster than that of the conventional router, and the quality of its circuits is also improved.

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.

The growth and saturation characteristics of an electromagnetic (EM) wave in a Smith-Purcell free-electron laser (FEL) with a Bragg cavity are investigated in detail with the aid of numerical simulation based upon the fluid model of the electron beam. To analyze the problem, a two-dimensional (2-D) model of the Smith-Purcell FEL is considered. The model consists of a planar relativistic electron beam and a parallel plate metallic waveguide, which has a uniform grating carved on one plate. For confinement and extraction of EM waves, a Bragg cavity is formed by a couple of reflector gratings with proper spatial period and length, which are connected at both ends of the waveguide. The results of numerical simulation show that a compact Smith-Purcell FEL can be realized by using a Bragg cavity composed of metallic gratings.

Motivated by intention to evaluate asymptotically multiple-burst-error-correcting codes on channels with memory, we will derive the following fact. Let {Zi } be a hidden Markov process, i. e. , a functional of a Markov chain with a finite state space, and Wb(Z1Z2Zn) denote the number of burst errors that appear in Z1Z2Zn, where the number of burst errors is counted using Gabidulin's burst metric , 1971. As the main result, we will prove the almost sure convergence of relative burst weight Wb(Z1Z2Zn)/n, i. e. , the relative frequency of occurrence of burst errors, for a broad class of functionals { Zi } of finite Markov chains. Functionals of Markov chains are often adopted as models of the noises on channels, especially on burst-noise channels, the most famous model of which is probably the Gilbert channel proposed in 1960. Those channel models described with Markov chains are called channels with memory (including channels with zero-memory, i. e. , memoryless ones). This work's achievement enables us to extend Gilbert's code performance evaluation in 1952, a landmark that offered the well-known Gilbert bound, discussed its relationship to the (memoryless) binary symmetric channel, and has been serving as a guide for the-Hamming-metric-based design of error-correcting codes, to the case of the-burst-metric-based codes (burst-error-correcting codes) and discrete channels with or without memory.

Reinforcement learning is an efficient method for solving Markov Decision Processes that an agent improves its performance by using scalar reward values with higher capability of reactive and adaptive behaviors. Q-learning is a representative reinforcement learning method which is guaranteed to obtain an optimal policy but needs numerous trials to achieve it. k-Certainty Exploration Learning System realizes active exploration to an environment, but, the learning process is separated into two phases and estimate values are not derived during the process of identifying the environment. Dyna-Q architecture makes fuller use of a limited amount of experiences and achieves a better policy with fewer environment interactions during identifying an environment by learning and planning with constrained time, however, the exploration is not active. This paper proposes a RTP-Q reinforcement learning system which varies an efficient method for exploring an environment into time constraints exploration planning and compounds it into an integrated system of learning, planning and reacting for aiming for the best of both methods. Based on improving the performance of exploring an environment, refining the model of the environment, the RTP-Q learning system accelerates the learning rate for obtaining an optimal policy. The results of experiment on navigation tasks demonstrate that the RTP-Q learning system is efficient.

The relationships between lattice orientation of the electron-beam evaporated MgO layer used as protecting layer for ac plasma displays (ac-PDPs) and the discharge characteristics of color ac-PDPs were investigated by the measurements of ion-induced secondary electron emission. It is proved that values of γi for MgO are large in the order of (220) orientation, (200) orientation, and (111) orientation, that is, γi(220) > γi(200) > γi(111). The values of φ for different lattice orientation are obtained by the measurements of thermionic emission and photo emission. The aging measurements for testing panels with the different lattice orientation of MgO layer revealed that performance of those panels are excellent in the order of (220), (200), and (111). In particular, luminance and luminous efficiency become larger in the order of (220), (200), and (111). It is pointed out that the degree of longevity, sustaining voltage, and memory margin for ac-PDPs with protecting materials as MgO are estimated by the measurements of γi.

Tail-biting trellises of linear and nonlinear block codes are addressed. We refine the information-theoretic approach of a previous work on conventional trellis representation, and show that the same ideas carry over to tail-biting trellises. We present lower bounds on the state and branch complexity profiles of these representations. These bounds are expressed in terms of mutual information between different portions of the code, and they introduce the notions of superstates and superbranches. For linear block codes, our bounds imply that the total number of superstates, and respectively superbranches, of a tail-biting trellis of the code cannot be smaller than the total number of states, and respectively branches, of the corresponding minimal conventional trellis, though the total number of states and branches of a tail-biting trellis is usually smaller than that of the conventional trellis. We also develop some improved lower bounds on the state complexity of a tail-biting trellis for two classes of codes: the first-order Reed-Muller codes and cyclic codes. We show that the superstates and superbranches determine the Viterbi decoding complexity of a tail-biting trellis. Thus, the computational complexity of the maximum-likelihood decoding of linear block codes on a tail-biting trellis, using the Viterbi algorithm, is not smaller than that of the conventional trellis of the code. However, tail-biting trellises are beneficial for suboptimal and iterative decoding techniques.

We proposed a soft-decision decoding algorithm for cyclic codes based on energy minimization principle. This letter presents the algorithm which improves decoding performance and decoding complexity of the previous method by giving more initial positions and introducing a new criterion for terminating the decoding procedure. Computer simulation results show that both the decoded block error rate and the decoding complexity decrease by this method more than by the previous method.

This paper shows the method of theoretical analysis for the bit error probability of the trellis-coded partial response continuous phase modulation (TCM-PR-CPM) over the correlated Rician fast frequency nonselective fading channel. In the analysis, the fading correlation of the channel and the effect due to finite interleaver are taken into account. By applying the method to the rate 1/2 (7, 2) trellis code with the raised cosine pulse of length 2 (2RC) partial response signaling, we show that the tighter upper bounds of the bit error rate are obtained than those in the preceding report.

To realize S-band mobile satellite communications and broadcasting systems, the onboard mission system and equipment were designed for the Japanese Engineering Test Satellite VIII. The system performs voice communications using handheld terminals, high-speed data communications, and multimedia broadcasting through a geostationary satellite. To enhance system efficiency and flexibility, the onboard mission system features phased-array-fed reflector antennas with large antenna diameter and baseband switching through onboard processors. Configurations and performance of the subsystems and key onboard equipment, large deployable reflectors, feed arrays, beam forming networks and onboard processors, are presented. The S-band mobile systems and onboard equipment will be verified through in-orbit experiments scheduled for 2002.