In conventional trellis coded modulation (TCM), higher-ary modulation scheme combining with a convolutional code is employed not to expand the transmitted bandwidth. This forces the system to be attended with signal constellation expansion and increasing the average signal power. As the solutions to avoid signal constellation expansion, TCM systems using totally overlapped signal sets (TO-TCM and RU-TCM) were proposed. These schemes can realize a coded modulation system without signal constellation expansion and achieve more coding gain compared with the conventional TCM. However, a problem that the systems with totally overlapped signal sets might be catastrophic has been remained. In this paper, we propose a novel TCM system using partially overlapped signal sets of non-equiprobable signaling (PO-TCM-NE). This scheme employs the partially overlapped signal constellation to control increasing signal points, and to avoid catastrophic error propagation. The non-equiprobable signaling is employed to reduce average signal power. Coding gain of the proposed PO-TCM-NE is considerably improved in consequence the average signal power is reduced much lower than that of other TCM systems with equiprobable signaling.

In this paper a new type of digital proxy signature is proposed. The proxy signature allows a designated person, called a proxy signer, to sign on behalf of an original signer. Classification of the proxy signatures is shown from the point of view of the degree of delegation, and the necessary conditions of a proxy signature are clarified. The proposed proxy signature scheme is based on either the discrete logarithm problem or the problem of taking the square root modulo of a composite number. Compared to the consecutive execution of the ordinary digital signature schemes, it has a direct from, and a verifier does not need a public key of a user other than the original signer in the verification stage. Moreover, it requires less computational work than the consecutive execution of the signature schemes. Due to this efficiency together with the delegation property, an organization, e.g. a software company, can very efficiently create many signatures of its own by delegating its signing power to multiple employees. Another attractive feature is that the proxy signature based on the discrete logarithm problem is highly applicable to other ordinary signature schemes based on the same problem, For instance, designated confirmer proxy signatures can be constructed. As a stronger form of proxy signature for partial delegation, another type of proxy signature scheme is proposed in which even an original signer cannot create a proxy signature. Furthermore, using a proposed on-line proxy updating protocol, the orignal signer can revoke proxies of dishonest proxy signers.

We propose a new QOS routing algorithm for finding a path that guarantees several quality of service (QOS) parameters requested by users, for ATM networks. It is known that a routing problem is NP-complete, if the number of additive QOS parameters, such as delay and cost, are more than or equal to two. Although a number of heuristic algorithms have been proposed recently to solve this problem, the appropriate choice of routing algorithms is still an open issue. In this paper, we propose a new heuristic routing algorithm, while being compliant with PNNI routing and signaling specification in the ATM Forum. The performance of algorithms is evaluated by simulation with a various network topologies and loading scenarios. This simulation results demonstrate that the proposed scheme improves the performance while reducing computational complexity.

A new CMOS analogue transconductor is proposed and simulated. This transconductor is based on the operation of MOS transistors in the linear region and has a good linearity. The simulation result shows that less than 1% distortion can be obtained for the differential input signal of 6.4 Vp-p with IB=80µA and supply voltage of 5V.

The present paper investigates a two-dimensional (2-D) adaptive lattice filter used for modeling 2-D AR fields. The 2-D least mean square (LMS) lattice algorithm is used to update the filter coefficients. The proposed adaptive lattice filter can represent a wider class of 2-D AR fields than previous ones. Furthremore, its structure is also shown to possess orthogonality in the backward prediction error fields. These result in superior convergence and tracking properties to the adaptive transversal filter and other adaptive 2-D lattice models. Then, the convergence property of the proposed adaptive LMS lattice algorithm is discussed. The effectiveness of the proposed model is evaluated for parameter identification through computer simulation.

This paper concerns optimized facility design for VLSI production. The methods proposed are applicable in planning LSI production facilities with a good balance between the number of machines and the number of operators. The sequence in each processing step is analyzed in detail. A new algorithm based on the queueing model is developed for estimating the simultaneous requirements for the two kinds of resources, machines and operators. This estimation system can be applied to complicated fabrication schemes, such as batch processing, continuous processing, and mixed technologies. This methodology yields guidelines for ASIC LSI production system design.

We studied a 0.15-µm InGaP/InGaAs/GaAs pseudomorphic HEMT operating under a negative drain bias, using a parameter extraction technique based on an analytical parameter transformation. The bias-dependent data of smallsignal equivalent circuit elements was obtained from Sparameters measured at up to 62.5 GHz at various bias settings. We then described the intrinsic part of the device using a new empirical large-signal model in which charge conservation and dispersion effects were taken into consideration. As far as we know, this is the first report to clarify the behavior of a HEMT operating under negative drain bias. We included our largesignal model in a commercially-available harmonic-balance simulator as a user-defined model, and designed a 60 GHz MMIC oscillator. The fabricated oscillator's characteristics agreed well with the design calculations.

A classs of type 1 linear phase FIR digital filters is proposed. The filter can be realized using a parallel, modular and regular array structure. It is shown that, under some simple constraints, the consisting modules of the array can be realized free of multiplier coefficients. Such two dimensional mesh arrays are specially suitable for realization with special-purpose systolic hardware for high-speed digital signal processing tasks. Compared to the array structure, proposed by the authors, for multiplierless realization of maximally flat FIR digital filters, this class needs less adders to fulfill the same magnitude response requirements. Another attractive property of the proposed array is that a number of highpass or lowpass filters with different passband widths can be realized simultaneously in a very economical way.

This paper proposes a three-dimensional (3-D) band-limiting technique for a conversion of Simple Cubic Sampling into Body-Centered Cubic Sampling. Based on spectral distribution of the original signal, the proposed method adaptively varies the passband shape of a band-limiting filter in order to preserve informations of the original picture. By applying this method to 3-D moving pictures, we can preserve resolution on each axis without introducing heavy aliasing error and avoid degradation of picture quality such as ringing in still pictures or blurring in moving pictures. The examples given in this paper demonstrate these advantages.

In estimating the performances of Distributed control Dynamic Channel Assignment (DDCA) strategies in sector cell layout systems, we find that sector cell layout systems with DDCA achieved a large system capacity. Moreover, we also indicate the problem, which is the increase of occurrences of cochannel interference, raised by using DDCA in sector cell layout systems. The new channel assignment algorithm, which is called Channel Searching on Direction of Sector (CSDS), is proposed to cope with the problem. CSDS assigns nominal channels to each sector according to their direction so that the same frequency channel tends to be used in sectors having the same direction. We show, by simulations, that CSDS is an adequate algorithm for sector cell layout systems because it significantly improves performance on co-channel interference while only slightly decreasing system capacity.

This paper proposes Channel Reservation for Ahead Cells (CRAC)" scheme for street micro-cellular systems. The scheme enables mobiles to reserve the same channel over several cells at once. This paper analyzes both CRAC and FCA (Fixed Channel Assignment) in a ring-shaped service area where high speed mobiles and low speed mobiles move. In the analysis, the priority control which prioritizes hand-off calls and reservation calls over new calls over new calls is also taken into account. Obtained results include the blocking rate, the forced call termination rate, the average number of channel changings and the system utilization. From numerical results, CRAC is found to perform better than FCA with regard to the average number of channel changings and the forced call termination rate.

This paper describes communication traffic characteristics in cellular systems employing the concept of reuse partitioning and Dynamic Channel Assignment. Such systems hava a problem of the spatial unbalance of blocking probability. The objective of this paper is overcoming this problem. To accomplish this objective, we use a method for analyzing communication traffic characteristics. We also show results on traffic characteristics in the systems.

This paper designs recursive least-squares fixed-point smoother and filter, which use the observed value, the probability that the signal exists, and the covariance information relevant to the signal and observation noises, on the estimation problem associated with the uncertain observations in linear continuous-time systems.

In this paper, we show that the conventional BCH codes can be better than the AG codes when the number of check symbols is relatively small. More precisely, we consider an AG code on Cab whose number of check symbols is less than min {g+a, n-g}, where n and g denote the code length and the genus of the curve, respectively. It is shown that there always exists an extended BCH code, (i) which has the same designed distance as the Feng-Rao designed distance of the AG code and the code length and the rate greater than those of the AG code, or (ii) which has the same number of check symbols as that of the AG code, the designed distance not less than that of the AG code and the code length longer than that of the AG code.

In this paper,novel techniques for designing Finite Impulse Response (FIR) digital integrators have been given. The design is based on analytical approach for computing the weights required in the structures. Exact mathematical formulas for computing these weights have been derived.

We present a systematic theory for the optimum sub-band interpolation using a given analysis or synthesis filter bank with the prescribed coefficient bit length. Recently, similar treatment is presented by Kida and quantization for decimated sample values is contained partly in this discussion [13]. However, in his previous treatment, measures of error are defined abstractly and no discussion for concrete functional forms of measures of error is provided. Further, in the previous discussion, quantization is neglected in the proof of the reciprocal theorem. In this paper, linear quantization for decimated sample values is included also and, under some conditions, we will present concrete functional forms of worst case measures of error or a pair of upper bound and lower limit of those measures of error in the variable domain. These measures of error are defined in Rn, although the measure of error in the literature [13] is more general but must be defined in each limited block separately. Based on a concrete expression of measure of error, we will present similar reciprocal theorem for a filter bank nevertheless the quantization for the decimated sample values is contained in the discussion. Examples are given for QMF banks and cosine-modulated FIR filter banks. It will be shown that favorable linear phase FIR filter banks are easily realized from cosine-modulated FIR filter banks by using reciprocal relation and new transformation called cosine-sine modulation in the design of filter banks.

Signal Transition Graphs (STG'S) [1] are Petrinets [2], which were introduced to represent a behavior of asynchronous circuits. To derive logic functions from an STG, the reachability graph should be constructed. In the verification of STG's some method based on Occurrence nets (OCN) and its prefix, called unfollding, has been proposed [3], [4]. OCN's can represent both causality and concurrency between two nodes by net stryctyre. In this paper, we propose an efficient algorithm to derive a logic function by generating sub-state space of a given STG using the structural properties of OCN. The proposed algorithm can be seem as a parallel algorithm for deriving a logic function.

Fundamental microwave key devices used in achieving compact mobile/portable telephones (raidio units) are discussed. The historical development flow of the systems and radio units are introduced, with respect to the 800-/900-MHz and 1.5-GHz Japanese cellular radio systems. The design concept of the developed radio units is briefly described. Tehnical requirements for RF circuits are reviewed and the developed key devices are practically applied to the circuits. Key factors in the requirements are also shown. Finally. future trends fro the key devices are surveyed from the stand point of achieving a smaller and more light weight pocket radio unit.

This paper proposes a design technique for 3-D non-separable QMF banks with Face-Centered Cubic Sampling (FCCS) and Body-Centered Cubic Sampling (BCCS). In the proposed technique, 2-D McClellan transformation is applied to a suitably designed 2-D prototype QMF to obtain 3-D QMFs. The design examples given in this paper demonstrate advantages of the proposed method.

A new adaptive AR spectral estimation method is proposed. While conventional least-squares methods use a single windowing function to analyze the linear prediction error, the proposed method uses a different window for each frequency band of the linear prediction error to define a cost function to be meinemized. With this approach, since time and frequency resolutions can be traded off throughout the frequency spectrum, an improvement on the precision of the estimates is achieved. In this paper, a wavelet-like time-frequency resolution grid is used so that low-frequency components of the linear prediction error are analyzed through long windows and high-frequency components are analyzed through short ones. To solve the optimization problem for the new cost function, special properties of the correlation matrix are used to derive an RLS algorithm on the order of M2, where M is the number of parameters of the AR model. Computer simulations comparing the performance of conventional RLS and the proposed methods are shown. In particular, it can be observed that the wavelet-based spectral estimation method gives fine frequency resolution at low frequencies and sharp time resolution at high frequencies, while with conventional methods it is possible to obtain only one of these characteristics.