Coding scheme is discussed for M-Choose-T communication in which at most T active users out of M potential users simultaneously transmit their messages over a common channel. The multiple-access channel considered in this paper is assumed to be a time-discrete noiseless adder channel without feedback with T binary inputs and one real-valued output, and is used on the assumption of perfect block and bit synchronization among users. In this paper a new class of uniquely decodable codes is proposed in order to realize error-free M-Choose-T communication over the adder channel described above. These codes are uniquely decodable in the sense that not only the set of active users can be specified but also their transmitted messages can be recovered uniquely as long as T or fewer users are active simultaneously. It is shown that these codes have a simple decoding algorithm and can achieve a very high sum rate arbitrarily close to unity if exactly T users are active.

Damgrd defined the notion of a collision intractable hash functions and showed that there exists a collection of collision intractable hash functions if there exists a collection of claw-free permutation pairs. For a long time, the necessary and sufficient condition for the existence of a collection of collision intractable hash functions has not been known, however, very recently Russell finally showed that there exists a collection of collision intractable hash functions iff there exists a collection of claw-free pseudo-permutation pairs. In this paper, we show an alternative necessary and sufficient condition for the existence of a collection of collision intractable hash functions, i.e., there exists a collection of collision intractable hash functions iff there exists a collection of distinction intractable pseudo-permutations.

A queueing model suitable for multimedia packets with Poisson and batch Poisson arrivals is studied. In the queueing model, priority is given to the packets with batch Poisson arrival, and the packets with Poisson arrival, accumulated in a buffer, are routed by utilizing intervals of the packets with priority. The queueing performance of the proposed model is evaluated by the mean system delay. We also consider the effect of batch size and the ratio of the traffic with batch Poisson arrival and the one with Poisson arrival on the mean system delay. It is found that the proposed queueing model is useful to reduce the mean system delay of the packets with Poisson arrival, while maintaining the means system delay of the packets with batch Poisson arrival.

This paper describes the circuit design and experimental results of a video-rate 10-b analog-to-digital converter (ADC) suitable for consumer video products, such as high-definition TV sets. Triple-stage conversion scheme combined with two new conversion methods, "Dynamic Sliding Reference Method" and "Triangular Interpolation Method," and an internal Bi-CMOS Sample/Hold circuit have been developed. These conversion methods require no adjustment circuit to fit reference voltages between conversion stages and realize small active area. As a result, a maximum conversion frequency of 16 MHz, acceptable SNRs of 56 dB and 48 dB for 10 kHz and 8 MHz input frequency respectively and small DNLE of 0.75 LSB have been achieved. This ADC is fabricated with 1.2 µm Bi-CMOS technology and integrates very small number of bipolar transistors of 2 K on a small active area of 2.52.7 mm2 and consumes 350 mW.

This paper proposes the concept of Tool-Based Direct Deformation Method (TB-DDM) which supports networked CAD (Computer Aided Design) systems with virtual reality technologies. TB-DDM allows designers to sculpt free forms directly with tools; each tool has its deforming characteristics, such as, the area and the shape of deformation. TB-DDM's direct deformation interface is independent of form representations because the system automatically calculates appropriate deformation according to its form representation when a tool pushes" a form. The deformation with TB-DDM is concisely described by the initial shape, types of tools, and thier loci; the description enables cooperative CAD systems with narrow bandwidth network to share design process rapidly and to distribute computational load.

We introduce a generalized cln grammar (gclng), a generalization of a completely linearly nested context-free grammar (clncfg), of which variables are partitioned linearly and each rule satisfies similar conditions as those of clncfg related to its partition. We show that the class of languages generated by gclng's coincides with the class of quasi-rational languages, and consider the inclusion relations between languages generated by gclng's and those generated by clncfg's.

The double-stage threshold-type foreground-background congestion control for the common-store queueing system with multiple nonpreemptive priority classes is proposed to improve the transient performance, where the numbers of accepted priority packets in both foreground and background stores are controlled under the double-stage threshold-type scheduling. In the double-stage threshold-type congestion control, the background store is used for any priority packets, and some parts of the background store are reserved for lower-priority packets to accommodate more lower-priority packets in the background store, whereas some parts of the foreground store are reserved for higher-priority packets to avoid the priority deadlock. First, we derive the general set of coupled differential equations describing the system-state, and the expressions for mean system occupancy, throughput and loss probability. Second, the transient behavior of system performance is evaluated from the time-dependent state probabilities by using the Runge-Kutta procedure. It is shown that when the particular traffic class becomes overloaded, high throughputs and low loss probabilities of other priority classes can be obtained.

A simple numerical method for calculating paths of creeping rays around an arbitrary convex object is presented. The adventage of this method is that the path of creeping ray is iteratively determined from initial values of incident point and incident direction of the creeping ray without solving differential equation of geodesic path. As the numerical examples, the path of creeping ray on the prolate spheroid and the resonance path of natural modes are shown.

We propose and demonstrate an excellent linearly frequency-swept laser diode (LD) for sensing system utilizing frequency-moduleted continuous-wave (FMCW) technique. In order to linearly sweep the optical frequency, we adopt a reference interferometer and an electric phase comparator. The interference beat signal of the reference interferometer is phase-compared with an external reference rectangular signal having a fixed frequency near the interference beat signal frequency by a lock-in amplifier. The error signal from the lock-in amplifier is fed back to the modulating signal of the injection current of the LD. Thus, a phase-locked loop composed of optical and electric circuits can be established, and the beat signal frequency is locked to the frequency of the reference signal. The optical frequency of the LD is, therefore, excellently linearly swept in time. In order to experimentally confirm the linearlity of the proposed method, we apply this light source to the FMCW reflectometry. Resultingly, the improvement of the linearity is estimated to be about 10 dB. And the theoretically limited spatial resolution of the FMCW reflectometry is achieved.

Precise measurements of temperature dependence of the Andreev reflection current for the N–I–S junctions were carried out. Au and Pb were used as N (normal metal) and S (superconducting material), respectively. The experimental results agreed with the analyses based on the Arnold theory.

We propose two methods to fuse auditory information and visual information for accurate sppech recognition. The first method fuses two kinds of information by using linear combination after calculating two kinds of probabilities by HMM for each word. The second method fuses two kinds of information by using the histogram which expresses the correlation of them. We have performed experiments comparing the proposed methods with the conventional method and confirmed the validity of the proposed methods.

A three-dimensional analysis of Whispering-Gallery modes (W. G. modes) in a coaxial dielectric resonator is proposed and presented. The coaxial dielectric resonator is constructed from a lossy dielectric disk and ring which have diameters of several tens times as large as wavelength. Eigenvalue equations of the W. G. modes are derived rigorously from field expressions and boundary conditions. The resonant frequencies, unloaded Q values and field distributions are calculated numerically from the eigenvalue equations. These calculated results are in good agreement with experimental ones for an X band model. As a result, it is shown that a considerable quantity of modal energy can be confined in a loss-less gap between the disk and ring, and then the unloaded Q value is higher than that of a conventional dielectric disk and ring resonator.

This paper presents a novel and successful logic synthesis method for optimizing ternary logic functions of any given number of input variables. A new optimization algorithm to synthesize and minimize an arbitrary ternary logic function of n-input variables can always lead this function to optimal or very close to optimal solution, where [n (n1)/2]1 searches are necessary to achieve the optimal solution. Therefore, the complexity number of this algorithm has been greatly reduced from O(3n) into O(n2). The advantages of this synthesis and optimization algorithm are: (1) Very easy logic synthesis method. (2) Algorithm complexity is O(n2). (3) Optimal solution can be obtained in very short time. (4) The method can solve the interconnection problems (interconnection delay) of VLSI and ULSI processors, where very fast and parallel operations can be achieved. A transformation method between operational and polynomial domains of ternary logic functions of n-input variables is also discussed. This transformation method is very effective and simple. Design of the circuits of GF(3) operators, addition and multiplication mod-3, have been proposed, where these circuits are composed of Josephson junction devices. The simulation results of these circuits and examples show the following advantages: very good performances, very low power consumption, and ultra high speed switching operation.

This paper describes the optical characteristics and static fatigue reliability of a zirconia alignment sleeve, which is a component part of an optical connector with zirconia ferrules. This combination of sleeve and ferrules hardly generates any wear debris during connector insertion and removal cycles. This has reduced the cleaning frequency of the ferrule endface during cycles and greatly improved the return loss stability of the optical connectors. The zirconia alignment sleeve enables stable return loss characteristics to be achieved over a wide temperature range as it has the same thermal expansion coefficient as the zirconia ferrule. Furthermore, the gauge retention force for the zirconia alignment sleeve is defined with a view to its practical use. This force must be between 2.0 and 3.9 N to allow stable optical connections to be made under various mechanical and environmental conditions. We also clarify the conditions for a proof test by which to prevent the occurrence of static fatigue fractures in the sleeve, and we confirm the validity of the test. The static fatigue parameters for zirconia ceramics and derived from the static fatigue theory for brittle materials and fracture testing. We use these static fatigue parameters to predict the lifetime of a zirconia sleeve under working stress. An appropriate stress level for the proof test which eliminates weak sleeves, is about 3 times greater than working stress. The strength of the sleeve as demonstrated in the proof test is confirmed by accelerative stress aging. The performance of this sleeve is superior to that of a conventional copper alloy sleeve and the proof test confirms its reliability; under 0.1 FIT for 20 years of use.

Several distances between trees have been proposed. However, most of the reports on distances have dealt with rooted and ordered trees. This paper proposes two distances between unrooted and cyclically ordered trees (CO-trees) and their computing methods. A CO-tree is a tree embedded in a plane. These distances are defined based on Tai's mapping (TM) and a strongly structure preserving mapping (SSPM) between CO-trees. The time complexities to compute the distances between two CO-trees Ta and Tb are OT (N 2aN 2b) for the distance based on a TM and OT(mambNaNb) for that on an SSPM, respectively, where ma(mb) and Na(Nb) are the largest degree of a vertex and the number of vertices of Ta(Tb), respectively. The space complexities of both methods are Os(NaNb). Those distances can be applied to the clustering of CO-trees.

As a generalization of the tree automaton, tree automata with various types of memory are introduced and their relation to context-free grammars with memory is studied. Relations between computation trees of tree automata with memory and derivation trees of context-free grammars with memory are established, and as a consequence, the languages generated by context-free grammars with memory are characterized in terms of the sets of trees recognizable by tree automata with memory. Also various types of traversal of labeled trees recognizable by tree automata with memory are considered.

The methodology for latchup-free design in bipolar and PMOS merged gates, so-called BiPMOS gates, is considered. Although BiPMOS gates can provide higher switching characteristics than conventional, individually drawn, BiCMOS gates even when the supply voltage is reduced, the general methodology to prevent latchup has been lacking. This paper presents an approximate, but sufficiently correct, mathematical technique to solve the Laplace equation, which gives the distribution of latchup trigger current for the given BiPMOS drawings. It is shown that the resistances of the collector plug and the spreading resistance under the base-collector junction greatly influence latchup, and that the well-emitter overlapping space becomes a problem in the case of a single collector. The distribution of latchup triggering current for the double-emitter double collector NPN transistor indicates the optimum position of the source diffusion area.

A new method for the accurate extraction of glottal source parameters is proposed. This method, called Heuristic Analysis-by-Synthesis (HAbS), has been developed specifically to overcome the weaknesses of other methods of glottal source parameter extraction. The specific features of this method are the use of the AbS method for extraction of glottal source and vocal tract parameters, the use of a parametric glottal source model during vocal tract analysis, the use of alternating glottal source and vocal tract analyses, and simultaneous, time-domain analysis of the glottal source parameters and the first formant. This method has been implemented in such a way that user interaction is not required. The performance of the HAbS method is evaluated using both synthetic-speech and natural-speech data. Error is measured in both the time domain and the spectral domain, and the standard deviation of extracted parameter values is computed. In addition, the error in analysis of each glottal-source parameter is computed using synthetic-speech data. In order to assess the accuracy of the HAbS method as compared to other methods, three other methods (LPC, AIF, and AbS) are evaluated using the same data methods of error measurement. From these evaluations, it is clear that the HAbS method yields results that are more accurate than these other methods.

In the conventional protocol synthesis, it is generally assumed that primitives in service specifications cannot be executed simultaneously at different Service Access Points (SAPs). Thus if some primitives are executed concurrently, then protocol errors of unspecified receptions occur. In this paper, we try to extend a class of service specifications from which protocol specifications are synthesized by the previous methods. We first introduce priorities into primitives in protocol specification so that it always selects exactly one primitive of the highest priority from a set of primitives that can be executed simultaneously, and executes it. Then, based on this execution ordering, we propose a new protocol synthesis method which can avoid protocol errors due to message collisions, communication competitions and so on. By applying the proposed synthesis method, we can automatically synthesize a protocol specifications from a given service specification which includes an arbitraty number of processes and allows parallel execution of primitives.

Parallel processing in speech recognition is described, which is carried out at each frame on time axis. We have already proposed a parallel processing algorithm for HMM (Hidden Markov Model)-based speech recognition using Markov Random Fields (MRF). The parallel processing is realized by modeling the hidden state sequence by an MRF and using the Iterated Conditional Modes (ICM) algorithm to estimate the optimal state sequence given an observation sequence and model parameters. However this parallel processing with the ICM algorithm is applicable only to the standard HMM but not to the improved HMM like the linear predictive HMM which takes into account the correlations between nearby observation vectors. In this paper we propose a parallel processing algorithm applicable to the correlation-considered HMM, where a new deterministic relaxation algorithm called the Generalized ICM (GICM) algorithm is used instead of the ICM algorithm for estimation of the optimal state sequence. Speaker independent isolated word recognition experiments show the effectiveness of the proposed parallel processing using the GICM algorithm.