A dynamic pre-allocated connection (DPC) scheme is proposed to support fast handoff and to effectively utilize wireline links. Since the proposed scheme uses pre-allocated switched virtual connections (PSVCs), handoff can be quickly executed in real-time with reduced connection overhead. This dynamic resource management scheme increases utilization of wireline links due to statistical multiplexing effects. For a heterogeneous traffic environment the probabilities of new call blocking, handoff call blocking, and fast handoff failure due to a lack of PSVCs are analyzed using a birth-death approximation.

This paper proposes a new distributed connection establishment scheme involving several competing network providers in a multimedia telecommunications environment. This connection establishment scheme, which is based on the concept of open competitive bidding, enables mutual selection by users and network providers. By employing this proposed scheme, both network providers and users can pursue their own objectives, according to their own bidding and awarding strategies. In this paper, a simple bidding strategy for network providers is presented, and the effectiveness of this strategy is evaluated by means of computer simulation. It is shown that each network provider can improve its profit by adopting this strategy. In this paper, an example of utility functions for users is presented, and the effectiveness of the mechanism with which users can select a network provider is also evaluated by means of computer simulation. Each user can improve his/her utility by selecting an appropriate network provider based on this utility function.

This paper discusses the generalized mutual exclusion problem defined by H. Kakugawa and M. Yamashita. A set of processes shares a set of resources of an identical type. Each resource must be accessed by at most one process at any time. Each process may have different accessible resources. If two processes have no common accessible resource, it is reasonable to ensure a condition in resource allocation, which is called allocation independence in this paper, i. e. , resource allocation to those processes must be performed without any interference. In this paper, we define a new structure, sharing structure coterie. By using a sharing structure coterie, the resource allocation algorithm proposed by H. Kakugawa and M. Yamashita ensures the above condition. We show a necessary and sufficient condition of the existence of a sharing structure coterie. The decision of the existence of a sharing structure coterie for an arbitrary distributed system is NP-complete. Furthermore, we show a resource allocation algorithm which guarantees the above requirement for distributed systems whose sharing structure coteries do not exist or are difficult to obtain.

This paper proposes an adaptive microphone array using blind deconvolution. The method realizes an signal enhancement based on the combination of blind deconvolution, synchronized summation and DSA (Delay-and-Sum Array) method. The proposed method improves performance of estimation by the iterative operation of blind deconvolution using a cost-function based on the coherency function.

In this paper, we consider new and general models for imperfect sources of randomness, and show how to obtain quasi-random sequences from such sources. Intuitively, quasi-random sequences are sequences of almost unbiased elements over a finite set. Our model is as follows: Let A be a finite set whose number of elements is a power of 2. Let 1/|A| δ 1 be a constant. The source outputs an element on A with probability at most δ, depending on outputs made by itself so far. From the definition, our sources output at least two elements with nonzero probability. This model is very general, because the source may output only two elements of A with nonzero probability, and the other elements with probability 0. This ability becomes a big difficulty for generating quasi-random sequences. All the methods for the existing models such as PRB-models and δ-sources fail to generate quasi-random sequences from our models. We here give a new algorithms which generates almost unbiased elements over A from such models.

We have developed a fabrication technique for high-performance high-thermal-stability InP/InGaAs heterojunction bipolar transistors (HBTs) for use in 40-Gb/s ICs. The HBT's T-shaped emitter electrode structure simplifies the fabrication process and enables high controllability of spacing between the emitter and the base electrodes. A highly-C-doped base, grown by gas-source MBE, and a new Pt-based metal system results in a low base resistance. An InP subcollector suppresses thermal runaway of HBTs at high collector current better than a conventional InGaAs subcollector does. Using these techniques, we fabricated a very-high-performance HBT with an extremely high cutoff frequency fT of 235 GHz. The RF measurements show that the collector current at the peak cutoff frequency is inversely proportional to collector thickness. We also fabricated a static 1/2 frequency divider, that can be used for 40-Gb/s optical transmission systems, operating up to 44 GHz. This divider confirmed that the developed HBT is applicable to 40-Gb/s optical transmission ICs.

This paper is concerned with radio resource allocation in multiple-chip-rate (MCR) DS/CDMA systems accommodating multimedia services with different information rates and quality requirements. Considering both power spectral density (PSD) over a radio frequency (RF) band and the effect of RF input filtering on the receiver in MCR-DS/CDMA systems, criteria for capacity estimation are presented and the characteristics of co-channel interference between subsystems are investigated. System performance in MCR-DS/CDMA systems is strongly affected by radio resource assignment. A minimum power-increment-based resource assignment scheme for an efficient resource assignment scheme is proposed herein. The performance of this scheme is compared with that of a random-based resource assignment scheme in terms of blocking probability and normalized throughput. The minimum power-increment-based resource assignment scheme yields a better performance than the random-based resource assignment scheme for multimedia services.

We study resource allocation strategies in ATM switches, which provide quality of service (QoS) guarantees to individual connections. In order to minimize the cell loss rate over a wide range of traffic characteristics, an efficient allocation strategy is necessary. In this paper we introduce a resource allocation strategy, named TP+WRR (Threshold Pushout + Weighted Round Robin) which can fully utilize the buffer space and the bandwidth. We compare the performance of TP+WRR with two typical resource allocation strategies. An exact queueing analysis based on a Markov model is carried out under bursty traffic sources to evaluate their performance. Our results reveal that TP+WRR considerably improves the cell loss probability over the other strategies considered in this paper, especially when many connections are sharing a link.

This paper proposes a high-level synthesis system for datapath design of digital processing hardwares. The system consists of four phases: (1) DFG (data-flow graph) generation, (2) scheduling, (3) resource binding, and (4) HDL (hardware description language) generation. In (1), the system does not generate only one best DFG representing a given behavioral description of a hardware, but more than one good DFGs representing it. In (2) and (3), several synthesis tools can be incorporated into the system depending on the required objectives. Thus we can obtain more than one datapath candidates for a behavioral description with their area and performance evaluation. In (4), the best datapath design is selected among those candidates and its hardware description is generated. The experimental results for applying the system to several benchmarks show the effectiveness and efficiency.

A unified source coding method is highly desired for many systems that deal with images diversifying from 1 bit/pel bi-level documents to SHD (Super High Definition) images of 12 bit/pel for each color component, and progressive coding that allows images to be reconstructed with increasing pixel accuracy or spatial resolution is essential for many applications including World Wide Web, medical images archive, digital library, pre-press and quick look applications. In this paper, we propose a unified continuous-tone and bi-level image coding method with pyramidal and progressive transmission feature. Hierarchical structure is constructed by interlacing subsampling, and each hierarchy is encoded by DPCM combined with reduced Markov model. Simulation results show that the proposed method is a little inferior than JBIG for bi-level image coding but can achieve better lossless compression ratio for gray-level image coding than CREW, in which wavelet transform is exploited to construct hierarchical structure.

In this paper, we analyze the inverse scattering problem by a new deterministic method called "Source and Radiation Field Solution," which has the merit that both the source and the radiation field can be treated at the same time, the effect of which has already shown in ordinary scattering problems.

This paper explores virtual destination (VD)/virtual source (VS)-based available bit rate (ABR) flow control performance, targeting wireless asynchronous transfer mode (WATM) application that can incur long link-delays because of employing radio-medium sharing and/or radio-specific data link control schemes. As this paper reveals, the conventional VD/VS scheme has difficulty in sustaining satisfactory ABR performance, when it is applied to long-delay-causing WATM; it suffers from significant increase in the necessary buffer capacity. To ensure the ABR performance in WATM, this paper proposes a new VD/VS coupling scheme using a feed-forward congestion indication. The proposed scheme controls the allowed cell rate of a source end system in a feed-forward manner by predicting the queue length at the time the WATM-associated-round-trip ahead. Simulation results show that the proposed scheme exhibits excellent ABR performance with a long delay of the divided loop on the radio-link side. It is also verified that the proposed scheme is rather robust against uncertainty and/or time-variation regarding the predetermined radio link delay.

With the introduction of ATM technology, service providers around the world have actively engaged in offering high bandwidth services. Currently, services, such as T1/E1, T3/E3 circuit emulation, are made available to large-volume account users. However, more advanced services, such as multimedia applications, have demanded not just high bandwidth but also flexible rate adaptation with quality-of-service (QoS) guarantee. To support the above service requirements, sophisticated network planning and engineering procedures should be taken. In the past few years, we have conducted various researches on developing the engineering strategies for resource control and management to support multi-rate service offering. We have also looked into the design details of connection control and management for achieving the QoS requirement. We considered the service quality of the underlying transport in regard with the QoS management. In this paper, we will outline those results and give an overview description about the proposed framework.

Ion beam irradiation effects on a novolac positive-tone photoresist and its application to micron-size field emitters have been investigated. Irradiation of Ar and P ions was examined. The electrical resistivity of the photoresist film is found to decrease after Ar ion implantation at doses on the order of 1016 cm-2. Baking of the photoresist prior to irradiation at a high temperature is preferred to produce electrical conductivity. P ions show weaker effects than Ar ions. Raman spectroscopy shows that carbon-carbon bonds such as the graphite bond are produced due to ion bombardment. The field emission of electrons is observed from emitters made of the ion-irradiated photoresist. The emission current is shown to be fairly stable when it is compared with an emission characteristic of synthesized diamond. Fabrication of field emitter arrays using a mold technique is demonstrated. The field emitter array shows emission at a current level of about 40 µA.

This paper explores a relationship between parameters for the context tree weighting and weights for a general model weighting technique. In particular, an algorithm is proposed that approximately computes the parameters from the weights, and a condition under which no error for the approximation occurs is derived.

This paper investigates an ATM multiplexer with a resume level, which uses a selective cell discarding strategy as a priority control, and a Markov-modulated deterministic process (MMDP) as the burst input traffic. Assuming that a system is loaded with a superposition of several independent and homogeneous On-Off bursty sources with two priority classes, we obtain the cell loss probability of each priority class of an ATM multiplexer with a resume level. The performance analysis derived here includes as special cases one without priority and one with a threshold level. From the numerical results, we compare the cell loss probability, the mean queue length, the mean queuing delay, the level crossing rate, and the queue length distribution at the embedded points for the case of a threshold level with those for the case of a resume level. By selecting an appropriate resume level, we can reduce the sensitive state change around the threshold level.

In GSM High Speed Circuit Switched Data (HSCSD), the data rate can be increased by using multiple time slots instead of single time slot. Multiple time-slot assignment results in high blocking rate. To accommodate more users, flexible resource allocation strategies have been proposed. Since GSM follows TDMA/FDMA, the channels (time slots) in a base station are segmented by frequency carriers. The base station must allocate the channels which belong to the same frequency carrier to individual requests. This Flexible Resource Allocation scheme for GSM (FRA-GSM) is contrastive to the scheme proposed in our previous studies where a base station may arbitrarily allocate idle channels in the base station to incoming requests. We define satisfaction indication SI as the measurement to compare the performance of these schemes. Experiment results indicate that FRA-GSM scheme has good performance when the user mobility is high, or when some cost factors are taken into account.

A new broadband buffer circuit technique and its analytical design method are proposed for a high-speed decision circuit featuring both a higher input sensitivity and a larger phase margin. The buffer circuit characteristics are significantly improved by employing a series peaking source follower (SPSF), where a peaking inductor is inserted between the first and second source follower stages. Optimization of the peaking inductance successfully enhances the 3-dB bandwidth of the data-input buffer and the clock buffer by 7 GHz for both, over conventional double-stage source follower SCFL buffers. The proposed circuit technique and design method are applied to a 10-Gbit/s decision circuit by the use of production-level 0. 5 µm GaAs MESFETs. The fabricated decision circuit achieves a data input sensitivity of 43 mVp-p and a phase margin of 240 both at 10-Gbit/s: a 230 mVp-p smaller input sensitivity and a 35 larger phase margin than those of conventional non-peaking inductor types.

We shall generalize B. S. Clarke and A. R. Barron 's analysis of the Bayes method for the FSMX sources. The FSMX source considered here is specified by the set of all states and its parameter value. At first, we show the asymptotic codelengths of individual sequences of the Bayes codes for the FSMX sources. Secondly, we show the asymptotic expected codelengths. The Bayesian posterior density and the maximum likelihood estimator satisfy asymptotic normality for the finite ergodic Markov source, and this is the key of our analysis.

In this paper the performance of the Block Sorting algorithm proposed by Burrows and Wheeler is evaluated theoretically. It is proved that the Block Sorting algorithm is asymptotically optimal for stationary ergodic finite order Markov sources. Our proof is based on the facts that symbols with the same Markov state (or context) in an original data sequence are grouped together in the output sequence obtained by Burrows-Wheeler transform, and the codeword length of each group can be bounded by a function described with the frequencies of symbols included in the group.