Multiple TDMA bursts assignment between a base station and a personal terminal will be required for multimedia communications that offers high speed signal transmission such as voice and data simultaneous transmission. This paper proposes a reliable packet transmission method for TDMA based wireless multimedia communications. The proposed method employs an adaptive transmission rate control according to the packet length and a burst diversity technique is applied to improve the frame error rate of a packet. The frame error rate performance has been approximated theoretically by using fade- and infade-duration statistics of a Rayleigh fading channel and a computer simulation has been carried out for two control channels, FACCH/SACCH (Fast/Slow Associated Control CHannel) in the PHS as well as GSM. Both results indicate that the frame error rate is dramatically improved, about one order, when two bursts have different frequency and improved by about 25% when the two bursts have the same frequency.

In an adaptive load balancing, the location policy to determine a destination node for transferring tasks can be classified into three categories: dynamic selection, random selection, and state polling. The dynamic selection immediately determines a destination node by exploiting the state information broadcasted from other nodes. It not only requires the overheads of collecting the state information, but may cause an unpredictable behavior unless the state information is accurate. Also, it may not guarantee even load distribution. The random selection determines a destination node at random. The state polling determines a destination node by polling other nodes. It may cause some problems such as useless polling, unachievable load balancing, and system instability. A new Sender-initiated Adaptive LOad balancing scheme (SALO) is presented to remedy the above problems. It determines a destination node by exploiting the predictable state knowledge and by polling the destination node. It can determine a good destination with minimal useless polling and guarantee even load distribution. Also, it has an efficient mechanism and good data structure to collect the state information simply. An analytic model is developed to compare with other well known schemes. The validity of the model is checked with an event-driven simulation. With the model and the simulation result, it is shown that SALO yields a significant improvement over other schemes, especially at high system loads.

An efficient full-wave approach for the accurate characterization of a H-plane waveguide π-junction with an inductive post and a waveguide cross-junction is proposed. By employing the port reflection coefficient method (PRCM), the analysis and solution procedures of these complex waveguide junctions are greatly simplified and only the calculation of field reflections caused by the simplest waveguide step-junction discontinuities are required. The reflections are easily determined by the mode-matching technique. Scattering parameters of these junctions are provided and discussed in terms of the working frequency and the geometrical dimensions of the junctions. Calculated results are compared with those of other papers and measurements, all show good agreement.

A new dynamic channel allocation algorithm which is integrated with transmitting power control is proposed. By introducing a new threshold, referred to as TPC threshold (Transmitting Power Control threshold), which is added some margin to the threshold of channel allocation, the subsequent transmitting power control can be performed effectively. This DCA algorithm can achieve a cellular system with both high traffic capacity and high service quality such as interference frequency performance simultaneously. The computer simulation shows that this DCA algorithm improves blocking probability performance 4 times better than that of DECT system at 14 Erlang, while keeping the same interference frequency and forced termination performances.

This paper proposed a method of slot allocation in a multislot TDMA system when multiple service priorities are supported. The algorithm is tested both in Variable Rate Reservation Access (VRRA) and Advanced TDMA protocols. We exploit the multislot reservation capability to achieve the delay requirements of each priority level. The channel allocation algorithm assumed that all data terminals are capable of multislot reservation. In this case the delay variance can be controlled based on the packet length information and the accumulated delay of each data user. The performance of the system is evaluated using the cumulative delay distribution and mean overall delays for the different user types.

This paper presents a method of employing a priority scheme in a random access environment. A prioritized nonblocked stack collision resolution algorithm with binary feedback is developed and tested using simulations. The algorithm accommodates an n-level priority scheme which makes it attractive in mobile data systems. The effectiveness of the algorithm is described on its ability to first, reject the lowest priority class when the system load is near or on the maximum value and second, minimize the delay spread of the higher class users. The performance of the algorithm is characterized using the throughput/delay and cumulative delay for each class of users.

This paper reviews Dynamic Channel Allocation (DCA) in TDMA cellular systems. The emphasis is on distributed DCA, which features decentralized control and adaptability to interference. Performance measures are discussed not only from a theoretical viewpoint but also from a practical viewpoint. Major techniques to enhance the capacity of cellular systems are channel segregation, reuse-partitioning, and transmitter power control. In addition to the performance of conventional cellular systems, differing performance in microcellular systems and multi-layer cellular systems is also discussed.

The purpose of this paper is to provide a practical tool for performing a shift operation in orthonormal compactly supported wavelet bases. This translation τ of a discrete sequence, where τ is a real number, is suitable for filter bank implementations. The shift operation in this realization is neither related to the analysis filters nor to the synthesis filters of the filter bank. Simulations were done on the Daubechis wavelets with 12 coefficients and on complex valued wavelets. For the latter ones a real input sequence was used and split up into two subsequences in order to gain computational efficiency.

Network functions (NFs) such as network reflection and transmission coefficients are discussed about an interconnected network consisting of a lumped distributed N-port N non-commensurate line junction network (N-port) and a M-port. The derivation of the NFs can be done quite easily regardless of the complexity of the network by considering the flow of the traveling waves and conditions of the interconnected interface of the two multi-ports. The theory of this paper has been examined with respect to interconnected networks consisting of two 3-ports in both the time and frequency domains, and has shown good results consistent with other papers. The network functions described here can be used not only for the analysis of high-speed pulse propagation in digital systems with branches but also for the analysis of microwave distributed line networks such as hybird rings. In that sense, a new analysis method is presented in this paper.

We present a formula of short-circuit power dissipation for static CMOS logic gates. By representing short-circuit current by a piece-wise linear function and considering a current flowing from input node to output node through gate capacitances, the accuracy is improved significantly. The error of our formula in a CMOS inverter is less than 15% from circuit simulation in many cases of our experiments. A improved circuit simulation technique for short-circuit power dissipation is presented. Since this formula calculate the short-circuit power dissipation accurately and quickly, it will be applied to power sensible CAD tools.

This paper presents implicit representation of binary decision diagrams (implicit BDDs) as a new effecient data structure for Boolean functions. A well-known method of representing graphs by binary decision diagrams (BDDs) is applied to BDDs themselves. Namely, it is a BDD representation of BDDs. Regularity in the structure of BDDs representing certain Boolean functions contributes to significant reduction in size of the resulting implicit BDD repersentation. Since the implicit BDDs also provide canonical forms for Boolean functions, the equivalence of the two implicit BDD forms is decided in time proportional to the representation size. We also show an algorithm to maniqulate Boolean functions on this implicit data structure.

This letter proposes evolutionary digital filters (EDFs) as new adaptive digital filters. The EDF is an adaptive filter which is controlled by adaptive algorithm based on the evolutionary strategies of living things. It consists of many linear/time-variant inner digital filters which correspond to individuals. The adaptive algorithm of the EDF controls and changes the coefficients of inner filters using the cloning method (the asexual reproduction method) or the mating method (the sexual reproduction method). Thus, the search algorithm of the EDF is a non-gradient and multi-point search algorithm. Numerical examples are given to show the effectiveness and features of the EDF such that they are not susceptible to local minimum in the multiple-peak performance surface.

This letter presents an efficient design method of multiplierless 2-D state-space digital filters (SSDFs) based on a genetic algorithm. The resultant multiplierless 2-D SSDFs, whose coefficients are represented as the sum of two powers-of-two terms, are attractive for high-speed operation and simple implementation. The design problem of multiplierless 2-D SSDFs described by Roesser's local state-space model is formulated subject to the constraint that the resultant filters are stable. To ensure the stability for the resultant 2-D SSDFs, a stability test routine is embedded in th design procedure.

We present a new method to cancel interfering sinusoidal signals. In this method, the Interpolated FFT (IpFFT) algorithm is used to estimate the parameters of the interference signal: frequency, amplitude and phase. The cancellation is then performed in the time domain. In order for the IpFFT to perform reliably, accurate spectral information about the interference signal is needed. Since, the information signal masks the interference signal, it becomes difficult to estimate the parameters of the interference signal. To alleviate this masking effect, two techniques are discussed here. These techniques involve frame update of interference spectral information of the interference signal, and adaptive averaging. Significant improvement over conventional frequency domain filterings is achieved. The price paid is only little, beyond the computation of the FFT. Comparison with the conventional frequency domain filter shows that our system has approximately 5dB better cancellation capability for a single interfering signal.

This paper proposes a tool to analyze complicated phenomena from a simple hysteresis network. The simple hysteresis network is described by a piecewise liner ordinal differential equation and has only two parameters: self feedback and DC team. Then this simple system exhibits various kinds of attractors: stable equilibria, periodic orbits, tori and chaos. In order to perform the numerical analysis, we derive return map and propose a fast calculation algorithm for the return map and its Lyapunov exponents based on the exact solutions. Using this algorithm, we have clarified chaos generation and related bifurcation phenomena. Also, we give theoretical formula that give fundamental bifurcation set.

To realize high-speed computations in a residue number system (RNS), an implementation method for residue arithmetic circuits using signed-digit (SD) number representation is proposed. Integers mp = (2p-1) known as Mersenne numbers are used as moduli, so that modulo mp addition can be performed by an end-around-carry SD adder and the addition time is independent of the word length of operands. Using a binary modulo mp SD adder tree, the modulo mp multiplication can be performed in a time proportional to log2p.

Understanding unknown objects in images is one of the most important fields of the computer vision. We are confronted with the problem of dealing with the ambiguity of the image information about unknown objects in the scene. The purpose of this paper is to propose a new object recognition method based on the fuzzy relation system and the fuzzy integral. In order to deal with the ambiguity of the image information, we apply the fuzzy theory to object recognition subjects. Firstly, we define the degree of similarity based on the fuzzy relation system among input images and object models. In the next, to avoid the uncertainty of relations between the input image and the 2-D aspects of models, we integrate the degree of similarity obtained from several input images by the fuzzy integral. This proposing method makes it possible to recognize the unknown objects correctly under the ambiguity of the image information. And the validity of our method is confirmed by the experiments with six kinds of chairs.

This paper describes a variable multi-level QAM modem applied to a wireless ATM transport network with the aim of effectively offering ATM network services over a terrestrial digital radio system. The concept of the wireless ATM transport network based on a Virtual Path (VP) capacity control system which optimizes both the number of channels and the multi-level QAM scheme for existing traffic variation is discussed. To achieve a hitless switch as a technical requirement of this network, we propose a modem configuration and a modulation scheme control (MSC) signal transmission. In this modem configuration, a multi-level control logic circuit in the modulator is used as the signal formatter. A modulated signal for the modulation scheme is maintained at a constant average power. Decision data and error signal selection for the received signal is carried out in the multi-level control logic circuit in the demodulator. The fluctuation of the demodulator loops due to modulation scheme switch can be reduced by using a fully digitized AGC loop and by converting the received signal to the condition of decision level constant. The MSC signal inserted into the first path data signal is transmitted without error by arranging the maximum amplitude of the signal point set. In this way, switching between the modulator and the demodulator is possible frame by frame. Finally, we present experimental results for a variable multi-level QAM modem employing four modulation schemes: QPSK, 16 QAM, 64 QAM, and 256 QAM. Through experiments, we prove that the modulation scheme is switched without fluctuation of the demodulator control loops by maintaining the signal condition of the decision level constant. The achievement of a hitless switch for multi-level QAM is also confirmed by experiments.

The dynamic channel assignment (DCA) strategy proposed here uses information on the mobile station speed and direction of motion to reduce the number of forced call terminations and channel changes in micro cellular systems. This SMD (speed and moving direction) strategy is compared with the main DCA strategies by simulating a one-dimensional service area covering a road on which there are high-speed mobile stations (HSMSs) and low-speed mobile stations (LSMSs).The simulation results show that the SMD strategy has the best performance in terms of forced call termination and channel change. The performance difference between the SMD strategy and the other DCA strategies increases as cell size decreases and as HSMS speed increases. While the SMD strategy does not yield the best total call blocking rate, its total carried load is the best when cells are small and HSMS speed is high. Also, the SMD performance improves when the HSMS offered load is small and the LSMS offered load is large. Although the SMD strategy requires information on the speed and direction of each mobile station and it increases call blockings somewhat, it reduces the number of forced call terminations and channel changes considerably, which is important in micro cellular systems.

A new matched-filter (MF) acquisition scheme with adaptive threshold is proposed for a frequency-hopped/spread-spectrum multiple-access (FH/SSMA) system. Detection and false alarm probabilities are derived for combined interference environments. The combined interference consists of partialband noise jamming or tone jamming, multiple access interference (MAI), multipath interference, and thermal noise. We use Gaussian approximation for modeling the MAI and multipath interference. Equal power assumption of the users is employed which is typically used in the SSMA system analysis. In the proposed scheme, MF output is compared to an adaptive threshold determined by the number of jammed frequency slots. It is shown that the proposed adaptive-threshold acquisition scheme achieves higher detection probability and lower false alarm probability than a conventional fixed-threshold scheme for each jammed fractional bandwidth, JSR, the number of multipaths, and the number of users. It is also shown that adaptive threshold achieves faster acquisition and higher packet throughput than fixed threshold in application to FH/SSMA packet radio system.