This paper proposes a fast encoding algorithm for iterated function system (IFS) coding of gray-level homogeneous fractal images. In order to realize IFS coding of high order fractal images, it is necessary to solve a set of simultaneous equations with many unknowns. Solving the simultaneous equations using a multi-dimensional, numerical root-finding method is however very time consuming. As preprocessing of numerical computation, the proposed algorithm employs univariate polynomial manipulation, which requires less computation time than multivariate polynomial manipulation. Moreover, the symmetry of the simultaneous equations with respect to the displacement coefficients enables us to derive an equation with a single unknown from the simultaneous equations using univariate polynomial manipulation. An experimental result is presented to illustrate that the encoding time of the proposed algorithm is about 5 seconds on a personal computer with a 400 MHz Pentium II processor.

This paper presents a novel dead-beat synchronization scheme and applies it to communications in discrete-time chaotic systems. A well-known Henon system is considered as an illustrative example. In addition, a Henon-based image processing application effectively exploits the proposed scheme's effectiveness.

In this paper, a new feature which is characterized by the extrema density of 2-D wavelet frames estimated at the output of the corresponding filter bank is proposed for texture segmentation. With and without feature selection, the discrimination ability of features based on pyramidal and tree-structured decompositions are comparatively studied using the extrema density, energy, and entropy as features, respectively. These comparisons are demonstrated with separable and non-separable wavelets. With the three-, four-, and five-category textured images from Brodatz album, it is observed that most performances with feature selection improve significantly than those without feature selection. In addition, the experimental results show that the extrema density-based measure performs best among the three types of features investigated. A Min-Min method based on genetic algorithms, which is a novel approach with the spatial separation criterion (SPC) as the evaluation function is presented to evaluate the segmentation performance of each subset of selected features. In this work, the SPC is defined as the Euclidean distance within class divided by the Euclidean distance between classes in the spatial domain. It is shown that with feature selection the tree-structured wavelet decomposition based on non-separable wavelet frames has better performances than the tree-structured wavelet decomposition based on separable wavelet frames and pyramidal decomposition based on separable and non-separable wavelet frames in the experiments. Finally, we compare to the segmentation results evaluated with the templates of the textured images and verify the effectiveness of the proposed criterion. Moreover, it is proved that the discriminatory characteristics of features do spread over all subbands from the feature selection vector.

In this paper, we present a novel architecture named as Window-MSPA architecture which targets to window operations in image processing. We have previously developed a Memory Sharing Processor Array (MSPA) for fast array processing with regular iterative algorithms. Window-MSPA tries to optimize the data I/O ports and the number of processing elements so as to reduce hardware cost. The input scheme of image data is restricted to row by row input which simplifies the I/O architecture. Under this practical I/O restriction, the fastest processings are achieved. In this paper, we present the general Window-MSPA design methodology for wide variety of applications. As an practical application, we have already reported the design of MP@HL MPEG2 Motion Estimator LSI. Design formulas for Window-MSPA architecture are given for various size of window operations in image processing. Thus, the derived architecture is flexible enough to satisfy user's requirement for either area or speed.

In this paper, a new gradient-based adaptive algorithm for the estimation of discrete Fourier coefficients (DFC) of a noisy sinusoidal signal is proposed based on a summed least mean squared error criterion. This algorithm requires exactly the same number of multiplications as the conventional LMS algorithm, and presents much improved performance in both white and colored noise environments at the expense of some additional memories and additions only. We first analyze the performance of the conventional LMS algorithm in colored additive noise, and point out when its performance deteriorates. Then, a summed least mean squared error criterion is proposed, which leads to the above-mentioned new gradient-based adaptive algorithm. The performance of the proposed algorithm is also analyzed for a single frequency case. Simulation results are provided to support the analytical findings and the superiority of the new algorithm.

We have developed a new type of phase interpolation direct digital synthesizer (DDS) with a symmetrically structured delay generator. The new DDS is similar to a sine output DDS in that it produces lower spurious signals, but it does not require a sine look-up table. The symmetrically structured delay generator reduces the periodic jitter in the most significant bit (MSB) of the DDS accumulator. The symmetrical structure enables the delay generator to produce highly accurate delay timing and eliminates the need to adjust the circuit constants. Experimental results confirm frequency synthesizer operation in which the spurious signal level is reduced to less than that of the accumulator.

In order to accommodate periodic and bursty sources into ATM networks effectively, we propose phase assignment control (PAC), which actively controls the phase of the new connection at its connection setup phase. To realize PAC, we develop an algorithm to find a good phase of the new connection in a short time. Simulation results show that the PAC can improve the system performance.

Multi-ary Trellis-Coded Modulation (TCM) schemes have been studied for use with digital radio communication systems. Among these TCM schemes, we have already reported the optimum signal constellation of a rate-3/4 trellis-coded (TC) 16-ary Amplitude and Phase Shift Keying (APSK) scheme and computed the minimum Euclidean distance: dfree. In this paper, we evaluate other performance parameters: Nfree and bit error rate (BER) over an additive white Gaussian noise channel, and further investigate the various signal constellations of rate-4/5 TC 32-APSK schemes. It is found that the BER performances of circular-type signal constellations are superior to that of rectangular-type in the TC 16-APSK, and a (24,8) circular type signal constellation is superior to other constellations in the TC 32-APSK.

We propose a new associative memory named Multi-Winner Associative Memory (MWAM) and study its bidirectional association properties in this paper. The proposed MWAM has two processes for pattern pairs storage: storage process and recall process. For the storage process, the proposed MWAM can represent a half of pattern pair in the distributed representation layer and can store the correspondence of pattern and its representation using the upward weights. In addition, the MWAM can store the correspondence of the distributed representation and the other half of pattern pair in the downward weights. For the recall process, the MWAM can recall information bidirectionally: a half of the stored pattern pair can be recalled by receiving the other half in the input-output layer for any stored pattern pairs.

Cell loss is one of the most important metrics of quality of service in ATM mobile communication systems. This loss can be suppressed by introducing buffer memories in the network, but that sacrifices delay. This paper proposes a lossless handover scheme for ATM mobile communication networks that can suppress delay fluctuations, and presents a subjective evaluation of MPEG2 images with various buffer memory sizes.

This paper presents a prediction of the millimeter-wave multipath propagation characteristics in the typical urban environment. To analyze the propagation in an outdoor environment, the three dimensional model based on the geometrical optics and the uniform geometrical theory of diffraction is employed. Prediction by the three dimensional ray tracing method needs a detailed map, which records locations and shapes of obstacles surrounding a transmitter and a receiver. It is usually difficult to create a complete map because tremendous data is necessary to describe the area structure. We propose, in this report, a three dimensional propagation model to predict the millimeter wave propagation characteristics by using the information available from only a map on the market. This approach gives us much convenience in the actual design. The modeled results are demonstrated and furthermore comparison are made between the simulated results and the experimental data.

In a personal communication system (PCS), a scheme for reforwarding call-terminating setup messages (SETUP messages) from a network or a cell station is used to guard against their loss. We have developed a method for evaluating the loss probability of a reforwarding scheme in which the network monitors the response messages from a personal station after forwarding a SETUP message to that personal station and reforwards the SETUP message only if a response message is not received. We started with a stochastic model in which messages registered in the paging-channel queue in a cell station are cyclically forwarded to the wireless area. This model corresponds to the finite-capacity M/D/1/N model with vacation time. We then added a method for calculating the "timeout" probability. Next we expanded the model into one in which the SETUP messages are reforwarded when a response message is not received by the network. This model corresponds to the M/D/1/N model with vacation time and retrials. We then added an approximate method for calculating the loss probability. Finally, using the proposed methods, we clarified the traffic characteristics of PCS call-terminating control.

In this paper, the performance of dynamic channel assignment for cellular systems with an array antenna is evaluated assuming realistic beamformer. A new dynamic channel assignment algorithm is proposed to improve the performance by forming a directional beam pattern to cancel stronger co-channel interference with higher priority. Performance comparison is carried out by computer simulations. Conventional algorithm shows 2.7 fold capacity increase compared with an omni antenna system, whereas proposed algorithm shows around 3.3 fold capacity increase, at the point of 3 percent blocking probability. The simulation results also denote that a shorter reuse distance can be achieved by the proposed algorithm, which indicates a more efficient utilization of channel resource.

This paper presents the radiation characteristics of a circularly polarized conical beam spherical slot array antenna for applying to the mobile satellite communication subscriber. The structure of the antenna is easy to fabricate i. e. , a ring of perpendicular slot pairs cut on an outer surface of a concentric conducting spherical cavity enclosed by the conducting conical surface with the simple feeding structure, and a linear electric probe excited at the center of the inner surface of the cavity. Radiation fields of a spherical slot array antenna are calculated by superposing the patterns of all the slots. From the numerical results of the radiation pattern, in both elevational and azimuthal planes, it is obvious that the conical beam is realized. The elevational beam direction is low, which is suitable for installing in the land mobile subscriber unit located far from the equator. The tracking system is not necessary because the azimuthal pattern is omnidirectional. Directivity of the antenna for various spherical radii and angles of slot positions are illustrated as the guidelines for the design. Experimental results are in good agreement with the predictions.

Hierarchical macrocell/microcell architectures have been proposed for future cellular mobile communication. The performance analysis for the hierarchical cellular system becomes an important issue. In this paper, extending the analytical methods from[1][2][8], assuming that the imperfect power control follows log-normal statistics, and employing different attenuation models for macrocells and microcells, the capacity plane and outage probability of the system are examined and quantified with and without perfect sectorization. From the numerical results of parameters of IS-95 protocol, the high user capacity and lower outage probability may be expected in the case of relatively tight power control and narrower overlap between sectors. These results are compared with the previously published CDMA nonhierarchical cellular system estimation. When we employ the hierarchical cellular system, we can increase the user capacity 2.3 times with the same bandwidth 1.25 MHz than the one of the nonhierarchical cellular system.

Authentication protocols are necessary for the receiver of a message to ascertain its origin in a distributed environment. Since they exchange cryptographic messages at the beginning of communication, their security is an essential requirement. However, most of the protocols have suffered from several kinds of attacks. A replay attack is one kind of those attacks. Attackers could launch it easily by replaying an eavesdropped message. Moreover, there are many types of replay attacks while most of the formal methods are not capable of detecting them. [3] classified various kinds of replay attacks and proposed a taxonomy. Therefore, it is necessary to verify authentication protocols deliberately with such a taxonomy for a basis. In this paper, at first, we give a clear definition and several remarks on replay attacks. Secondly we review the taxonomy of replay attacks presented in [3], and comment on its minor mistake. Finally we examine on the basis of the taxonomy the password-based authentication protocol, K1P, which was proposed in our earlier papers for protecting weak secrets efficiently. As a result of the examination, we have found that three way mutual K1P shown in [2] was vulnerable to one of replay attacks. Therefore, we improve three way K1P on security against the replay attack. Improved three way K1P is secure against replay attacks as well as guessing attacks and therefore it may be useful for security services of various communication networks.

The concept of controlled resource sharing and dynamic quality of service (QoS) on the next generation Internet has attracted much attention recently. It is suggested that, by imposing real-time revision of shared resource allocated to individual media streams or data flows according to user/application QoS demand and resource availability, more balanced and efficient multimedia services can be provided. In this paper, we present an Adaptive Control Framework (ACF), which is developed for controlled resource sharing and dynamic QoS in real-time multimedia service. We discuss main elements of ACF including 1) Control schemes applicable in the framework, and 2) Control mechanisms used in ACF. It is clearly shown in this paper that, with control schemes and mechanisms incorporated in ACF and supportive algorithms and protocols for ACF applications on the Internet, more flexible service and better overall performance in terms of packet loss, latency, signal-noise ratio and re-synchronization delay, can be offered.

In this letter, we propose the channel estimation technique in the uplink of a DS/CDMA system with M-ary orthogonal signaling over multipath fading channels. The channel estimation is carried out using the maximum correlator output of RAKE receiver. With the estimated channel parameters, the RAKE receiver can coherently combines the received multipath signals, resulting in a significant performace improvement. The hardware complexity of the proposed detection technique is slightly increased when compared to that of noncoherent detection.

This paper proposes a group synchronization mechanism which synchronizes slave destinations with the master destination for stored media in multicast communications. At the master and slave destinations, an intra-stream and an inter-stream synchronization mechanisms which were previously proposed by the authors are employed to output the master media stream and slave media streams synchronously. We achieve group synchronization by adjusting the output timing of the master media stream at each slave destination to that at the master destination. We also deal with control of joining an in-progress multicast group. The paper presents experimental results using an interconnected ATM-Ethernet LAN, which is a kind of heterogeneous network. In our experimental system, stored voice and video streams are multicast from a source to plural destinations distributed among distinct networks, and then they are synchronized and output. Furthermore, the paper demonstrates the effectiveness of the mechanism.

This study is aimed to explore a fast convergence method of blind equalization using higher order statistics (cumulants). The efforts are focused on deriving new theoretical solutions for blind equalizers rather than investigating practical algorithms. Under the common assumptions for this framework, it is found that the condition for blind equalization is directly associated with an eigenproblem, i. e. the lag coefficients of the equalizer can be obtained from the eigenvectors of a higher order statistics matrix. A method of blind phase recovery is also proposed for QAM systems. Computer simulations show that very fast convergence can be achieved based on the approach.