A program is developed to simulate the signal received by a bistatic pulse radar for a defined scenario. The signal collected at the receiving antenna is calculated as a function of time by taking into account the vectorial aspect of the electromagnetic waves and various elements operating in the radar radiolink. The radar radiolink is designed in a modular structure for a general configuration where the transmitter, the target and the receiver are moving. Modules such as elements characterizing the antennas radiation or defining the target scattering can be inserted in accordance with the desired radar scenario. Then the developed model permits to simulate a wide range of radar scenarios where returns from targets and clutter can be individually processed and their characteristics can be investigated in time or frequency. The interest of this model is great because it permits, for a defined scenario, to generate radar data which can be used in signal processing algorithms for target detection, clutter suppression or target classification. This paper shows the implementation of the simulation program considering a concrete radar scenario. The presented scenario deals with the simulation of the sea clutter occurring in a bistatic radar radiolink over the sea surface. In this application where the sea surface is considered as the target, the electric field scattered from the sea surface is calculated by assuming that the surface is described by two independent scales of roughness.

In this paper we report the results of a study regarding the backscattering from wind-roughened water surfaces. The reference profile data has been deducted by an experiment held at the University of Heidelberg circular wave tank facility. The scattering theory is based on a fractal description of the surface and a combined use of the Kirchhoff approximation and the small perturbation method (SPM). The scattering results are tested versus the ones obtained via the periodic-surface moment method. The study shows the reliability of the novel approach.

The finite volume time domain (FVTD) method is applied to electromagnetic wave scattering from random rough dielectric surfaces. In order to gain a better understanding of physics of backscattering of microwave from rough surface, this paper treats both horizontal and vertical polarizations especially at low- grazing angle. The results are compared with those obtained by the Integral equation method and the small perturbation method as well as with the experimental data. We have shown that the present method yields a reasonable solution even at LGA. It should be noted that the number of sampling points per wavelength for a rough surface problem should be increased when more accurate numerical results are required, which fact makes the computer simulation impossible at LGA for a stable result. However, when the extrapolation is used for calculating the scattered field, an accurate result can be estimated. If we want to obtain the ratio of backscattering between the horizontal and vertical polarization, we do not need the large number of sampling points.

The mean reflection and transmission coefficients of electromagnetic waves incident onto a two-dimensional slightly random dielectric surface are investigated by means of the stochastic functional approach. We discuss the shift of Brewster's scattering angle using the Wiener kernels and numerical calculations. It is also shown that the phase shift at the reflection into Brewster's angle for a flat surface does not depend on the rms height of the surface, but does on the correlation length of the surface.

Several types of coplanar waveguide (CPW) resonator are analyzed by use of the field decay method based on the FDTD algorithm in this paper. Quality (Q) factors of a CPW resonator, including radiation Q, conductor Q, dielectric Q and unloaded Q, are investigated thoroughly. A new procedure to calculate conductor Q is proposed. Some CPW resonators are fabricated and measured in order to validate the analysis method. It is shown that radiation from a CPW resonator can be reduced by means of the stepped impedance technique. It is also seen that miniaturization of CPW resonators can be realized if the stepped impedance structure is adopted.

This paper introduces a generalized cyclic convolution which can be implemented via the conventional cyclic convolution system by the discrete Fourier transform (DFT) with pre-multiplication for the input and post-multiplication for the output. The generalized cyclic convolution is applied for computing a negacyclic convolution. Comparison shows that the proposed implementation is more efficient and simpler in structure than other methods. The modified Fermat number transform (MFNT) is known to be useful for computing a linear convolution of integer-valued sequences. The generalized cyclic convolution is also applied for generalizing the linear convolution system by MFNT, and easing the signal length restriction imposed by the system.

In this paper, the electromagnetic scattering from a cylinder with a computer-generated random rough surface is analyzed by a numerical simulation method. The validity of the proposed numerical method is confirmed by comparing the present numerical results with those calculated by the perturbation method to second order and its Pade approximation. It is shown that the present proposed method can be applied to the case where the surface roughness becomes relatively large.

In this paper we develop a robust control theory to achieve fault-tolerant behaviors of timed discrete event systems (DESs) with model uncertainty represented as a set of some possible models. To demonstrate the effectiveness of the proposed theory, we provide a case study of a resistance spot welding process.

QoS restoration, a new approach to keep QoS of end-to-end ATM connections for failures is proposed. In a network with QoS restoration, each end-to-end connection's customer pre-defines the minimum QoS requirements such as minimum throughput. When a failure occurs, resources such as bandwidth of working connections are reallocated for restoration if they are dispensable to keep the minimum requirements along with the pre-assigned spare resources. This resource reallocation is done in a distributed manner and the result of the modification of a connection is notified to the customer of the connection to help him adjust the way of using it. The effect of the reallocation is mathematically evaluated. It is shown that the reallocation enables to achieve high restoration ratio with insufficient pre-assigned spare resources, such as to restore double-link failures with spare resources prepared for single-link failures, or even to restore single-link failures with no spare resources. It is also shown that pre-assigned spare resources can be reduced if the reallocation is considered in network design phase. The performance of the proposed distributed algorithm is evaluated with an event-driven simulator. The result shows that regardless of whether or not pre-assigned spare resources exist, a restoration ratio which is close to the theoretical maximum can be achieved. A proof-of-concept experimental system is developed by controlling commercial ATM switches via SNMP. The system shows it can effectively manage failures in WAN environment.

To achieve high link availability at Ka-band geosynchronous satellite communication systems, an adaptive CDMA scheme as a rain fade countermeasure is proposed. The proposed adaptive CDMA scheme reserves and shares orthogonal sequences to countermeasure a rain fade. In the adaptive CDMA scheme, the base station allocates a set of orthogonal sequences to each user, and the number of sequences in a set is determined by the amount of rain attenuation. A symbol repetition technique is also used to compensate signal energy loss due to the rain fade. Our results show that when the base station has 64 free orthogonal codes, the adaptive CDMA scheme can save on its power by 4.2 dB compared to conventional CDMA scheme. The occupation rate of codes also shows that the adaptive CDMA can support multiple users simultaneously in even severe rain fade condition.

This paper proposes a new restoration concept for ATM networks. It realizes the rapid and multiple reliability/cost level restoration required to support many different network services. First, the necessity in realizing rapid and multiple-reliability-level restoration in the future network is shown. The self-healing schemes that is based on distributed restoration mechanism satisfies the rapidity in restoration, but does not satisfy multiple reliability levels. Thus a new self-healing scheme that satisfies them is presented and a Multiple Reliability Level Virtual Path network concept is proposed based on the new self-healing scheme. Next, how to realize the new self-healing scheme is explained as an extension of the existing self-healing scheme with two new simple functions. Finally, evaluations confirm the effectiveness of the proposed scheme. These results show that the proposed new scheme realizes a network that fulfills the rapidity and multiple reliability requirements that are strongly required.

The Internet is a heterogeneous and rapidly evolving environment. New information services have been added, modified, and diversified, while legacy services have been abandoned. Users' requirements for services are also changing very quickly. It is becoming very difficult to find required information services from extremely huge amount of information in the Internet. It is necessary to design information service system, which can meet user's heterogeneous requirements for services, adaptability of services to cope with ever-changing situation and to provide assurance. Faded information field architecture and Push/Pull Mobile Agent (MA) technologies are proposed as basic components of autonomous information service system to achieve these goals. The system is proposed from users' and providers' point of view, therefore we present a technique for balancing users' and providers' communication cost based on `through rate' for faded information field realization. On the basis of this technique, autonomous information allocation algorithm is proposed, in which each node may determine information amount based on push/pull cost. The effectiveness of the proposed algorithm is shown through simulation.

This paper presents the bit error rate (BER) upper bounds for trellis coded asymmetric 8PSK (TC-A8PSK) system using the Ka-band satellite in the rain fading environment. The probability density function (PDF) for the rain fading random variable can be theoretically derived by assuming that the rain attenuation can be approximated to a log-normal distribution and the rain fading parameters are calculated by using the rain precipitation data from the Crane global model. Furthermore, we analyze the BER upper bounds of TC-A8PSK system according to the number of states in the trellis diagram and the availability of channel state information (CSI). In the past, Divsalar and Simon has analyzed the BER upper bounds of 2-state TCM system in Rician fading channels; however, this paper is the first to analyze the BER upper bounds of TCM system in the rain fading channels. Finally, we summarize the dominant six factors which are closely related to the BER upper bounds of TC-A8PSK satellite system in the rain fading channel as follows: (1) frequency band, (2) rain intensity, (3) elevation angle, (4) bit energy to noise ratio, (5) asymmetric angle, and (6) availability of CSI.

In CDMA mobile system, network connection is constructed with orthogonal spreading codes assigned to each user in order to distinguish one from the other. The number of distinguishable codes and the process speed are different according to the orthogonal spreading factors which, in another literature, can be described as the tree structure. In this paper, we investigate methods to improve the quality of services (QoS) of communication, by changing the spreading factors of orthogonal spreading codes according to the number of users. We propose the effective method to reconstruct the tree structure of orthogonal spreading codes for supporting various data rates transmission in DS-CDMA mobile system. We compare spreading factors with and without the reconstruction and evaluate the effectiveness of the reconstruction method.

A new timing estimation algorithm for asynchronous DS/CDMA multiuser communication system is proposed in this paper. The algorithm is based on the Minimum Variance Distortionless Response (MVDR) beamforming technique that minimizes the beamformer's output power with the constraint that only the signal with exact timing is distortionlessly passed. Exploiting the characteristics that the MVDR beamformer's output power is severely degraded according to erroneous timing estimation, we develop an efficient algorithm to estimate each user's timing by scanning the beamformer's output power variation. Compared to the maximum a posteriori (MAP) or maximum likelihood (ML) based multiuser timing estimator, the complexity is extensively reduced by separating the multi-dimensional optimization problem into several one-dimensional optimization problems. Furthermore, the algorithm is computationally feasible than the subspace-based timing estimator since no eigendecomposition (EVD) is required. Moreover, the proposed algorithm is near-far resistant since the MVDR beamformer is inherently energy independent to the interferers.

This paper presents a new design of spread spectrum signals with the minimally sufficient dimension from the view point of frequency diversity. Letting the signature signal duration and the bandwidth be denoted by T and B, respectively, we can nominally represent a signature signal of either Direct Sequence (DS) or MultiCarrier (MC) spread spectrum system as the sum of N=BT sinusoidal signal units with their frequencies separated by 1/T or its multiples. In our design,assuming the maximum expected channel delay spread σd « T as usual, one signature signal viewed in the frequency domain is made up of the minimum number K 2πσdB of sinusoidal signal units which are arranged so as there is placed at least one unit in coherence bandwidth 1/(2πσd) in which the fading channel transfer function has strong correlation. Although the signature signal does not make use of all the units in the given frequency domain as in the ordinary spread spectrum systems, but uses only skipped units, it can be shown that almost the same frequency diversity effect is attained. And it is also shown that the immunity to the external interfering signals is by no means inferior. If every L=N/K T/(2πσd) consecutive sinusoidal signal units are assigned to the K signal units of a signature signal, L different signature signals are simultaneously available mutually orthogonal when the synchronous demodulation is performed in the same T period. We call each of the orthogonal sinusoidal signal sets a Frequency Devision (FD) signal set. Now, CDMA can be independently realized on each of the L FD signal sets provided the operation is synchronous or quasi-synchronous with respect to the symbol demodulation (or signature) period. Partitioning the simultaneous users among the FD sets, it is possible to decrease the number of CDMA users to be processed, retaining the total number of simultaneous users. Owing to this effect, the multiple access performance for the FD/CDMA system is shown to be superior to that of the ordinary DS or MC/CDMA system, assuming matched filter reception based on the complete estimation of the channel characteristics for the both cases. The decrease of the number of CDMA users per FD set makes it practical for the receiver to employ multiple access interference cancellation and even the maximum likelihood detection. Curiously, any FD signal set can be represented in the time domain as L repetition of a sequence with its period equal to K in the number of 1/B duration time chips.

To enhance fault tolerance ability of the feedforward neural networks (NNs for short) implemented in hardware, we discuss the learning algorithm that converges without adding extra neurons and a large amount of extra learning time and cycles. Our algorithm modified from the standard backpropagation algorithm (SBPA for short) limits synaptic weights of neurons in range during learning phase. The upper and lower bounds of the weights are calculated according to the average and standard deviation of them. Then our algorithm reupdates any weight beyond the calculated range to the upper or lower bound. Since the above enables us to decrease the standard deviation of the weights, it is useful in enhancing fault tolerance. We apply NNs trained with other algorithms and our one to a character recognition problem. It is shown that our one is superior to other ones in reliability, extra learning time and/or extra learning cycles. Besides we clarify that our algorithm never degrades the generalization ability of NNs although it coerces the weights within the calculated range.

This letter proposes a new detection method of human faces in gray scale image with cluttered background using a face template and elliptical structure of the human face. This proposed method can be applicable even in the cases that the face is much smaller than image size and several faces exist in one image, which is impossible in the existing one.

In this paper, we study macro/micro diversity techniques for code acquisition of a direct-sequence spread-spectrum signal in an indoor packet communication system. In the system discussed, the base station has several radio ports each with a cluster of antennas, and the terminal also has multiple antennas. The performance in the uplink of this system is analyzed under Lognormal shadowing and flat Rayleigh fading. The numerical results show great performance improvements by proposed diversity techniques. In addition, it is clarified that the mean acquisition time, which is often used as the measure of performance, is not suitable for packet radio systems as it underestimates the necessary preamble length for initial code acquisition.

Blind channel estimation algorithm which is applicable to the time-variant channel under frequency-selective fading is proposed. The condition on the blind channel identifiability using temporally and spatially oversampled data is shown. The proposed algorithm consists of two stages. At the first stage, the channel equalization matrix is estimated by taking account of the time-variant characteristics of the channel. At the second stage, the signals and the channel matrix are alternately estimated by using the finite alphabet property of the transmitted symbols. Periodical return from the second stage to the first makes the blind estimation algorithm feasible for the time-variant channel with fast fading. The simulation results confirm the fast convergence property and the effectiveness of the proposed algorithm in coping with the frequency-selective fading.