In this paper we propose a new far-field RCS prediction method using cylindrical or planar near-field RCS data. First we derive the relation between RCS and the scattering coefficient using physical optics technique. The far-field RCS prediction algorithm is obtained by approximating the relation using the condition of Fresnel region and the paraxial constraint of scanning angle in the case of cylindrical or planar scanning. Finally we predict the far-field RCS using measured or calculated near-field RCS data of the conducting rectangular prism or plate. The validity of the proposed algorithm is demonstrated.

This paper presents a new upper bound on overall bit error rate (BER) for a concatenated code which consists of an inner convolutional code and an outer interleaved Reed-Solomon code. The upper bound on BER is derived based on a lower bound on the effective minimum distance of the concatenated code. This upper bound can be used for the cases when the interleaver size is small such that the conventional upper bound is not applicable.

We propose a method to search all the zeros of a complex function in a given compact region D Cn. The function f: Cn Cn to be considered is assumed to consist of polynomial and transcendental terms and to satisfy f (x) Rn for any x Rn. Using the properties of such a complex function, we can compute the number of zeros and determine the starting points of paths on the boundary of D, which attain all the zeros of f in D without encountering a singular point. A piecewiselinear approximation of the function on a triangulation is used for both computing the number of zeros and following the paths.

We consider methods to locate sync words in packet or frame transmission over the additive white Gaussian noise channel. Our starting point is the maximization of the probability of correctly locating the sync word. We extend Massey's original result to the specific synchronization problem, where the sync words is prefixed to the data stream and each packet is preceded by idle transmission or additive white Gaussian noise. We give simulation results for several interesting sync words such as Barker sequences of length 7 and 13 and a sync word of length 17 with good cross-correlation properties. One of the conclusions is that the newly derived formula for the probability of correctly locating the sync word enables the reduction of the false sync detection probability.

Let {Xk}k=- be a stationary and ergodic information source, where each Xk takes values in a standard alphabet A with a distance function d: A A [0, ) defined on it. For each sample sequence X = (, x-1, x0, x1, ) and D > 0 let the approximate D-match recurrence time be defined by Rn (x, D) = min {m n: dn (Xn1, Xm+nm+1) D}, where Xji denotes the string xixi+1 xj and dn: An An [0, ) is a metric of An induced by d for each n. Let R (D) be the rate distortion function of the source {Xk}k=- relative to the fidelity criterion {dn}. Then it is shown that lim supn-1/n log Rn (X, D) R (D/2) a. s.

We propose an on-line writer verification method to improve the reliability of verifying a specific system user. Most of the recent research focus on signature verification especially in the field of on-line writer verification. However, signature verification has a serious problem in that it will accept forged handwriting. To overcome this problem, we have introduced a text-indicated writer verification method. In this method, a different text including ordinary characters is used on every occasion of verification. This text can be selected automatically by the verification system so as to reflect the specific writer's personal features. A specific writer is accepted only when the same text as indicated by the verification system is inputted, and the system can verify the writer's personal features from the inputted text. Moreover, the characters used in the verification process can be different from those in the enrolment process. This method makes it more difficult to get away with forged handwriting than the previous methods using only signatures. We also discuss the reliability of the proposed method with some simulation results using handwriting data. From these simulation results, it is clear that this method keeps high reliability without the use of signatures.

This paper describes relation between the number of library pairs and error probability to have all the pairs as fixed points for second-order bidirectional associative memory (BAM). To estimate accurate error probability, three methods have been compared; (a) Gaussian approximation, (b) characteristic function method, and (c) Hermite Gaussian approximation (proposed by this paper). Comparison shows that Gaussian approximation is valid for the larger numbers of neurons in both two layers than 1000. While Hermite Gaussian approximation is applicable for the larger number of neurons than 30 when Hermite polynomials up to 8th are considered. Capacity of second-order BAM at the fixed error probability is estimated as the function of the number of neurons.

The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n-1ln n+o(n-1ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.

A family of nonce-based authentication and key distribution protocols based on the trusted third-party model are proposed which are not only efficient on the view points of computation and communication, but also secure against on-line and off-line password guessing attacks. A new concept of implicit or indirect challenge-response authentication which can be used to combine the processes of identify authentication and data integrity assurance during key distribution and to make the entire protocol be more concise and efficient is introduced in this paper. In the proposed family of protocols, specific protocol can be chosen such that the secure session key to be distributed is selected by specific participant in the protocol. Detailed security analyses of every protocols are given.

This paper deals with the scattering and diffraction of a plane wave by a randomly rough half-plane by three tools: the small perturbation method, the Wiener-Hopf technique and a group theoretic consideration based on the shift-invariance of a homogeneous random surface. For a slightly rough case, the scattered wavefield is obtained up to the second-order perturbation with respect to the small roughness parameter and represented by a sum of the Fresnel integrals with complex arguments, integrals along the steepest descent path and branch-cut integrals, which are evaluated numerically. For a Gaussian roughness spectrum, intensities of the coherent and incoherent waves are calculated in the region near the edge and illustrated in figures, in terms of which several characteristics of scattering and diffraction are discussed.

We report on progress in the development of high-current-density all-NbN tunnel junctions for application as submillimeter wave SIS mixers. A very high current density up to 54 kA/cm2, roughly an order of magnitude larger than any reported results for all-NbN tunnel junctions, was achieved in the junctions with a thin aluminum nitride (AIN) tunnel barrier. Even though the junctions have a very high current density, they showed high-quality junction characteristics with a large gap voltage, sharp quasipartical current rise, and small subgap leakage current. The junctions also exhibited good Josephson tunneling behavior, excellent terahertz response, and sensitive heterodyne mixing properties. NbN/AIN/NbN tunnel junctions were integrated with a NbN thin-film antenna to investigate the terahertz responses and the heterodyne mixing properties in a quasioptical mixer testing system. Photon-assisted tunneling steps were clearly observed on the I-V curve with irradiation up to 1 THz, and low-noise heterodyne mixing was demonstrated in the 300-GHz band.

This study shows the results of evaluating the flux noises at low frequency when the alternating current(AC) bias direct offset integrated technique(DOIT) with additional positive feedback (APF) is used in a high-Tc dc superconducting quantum interference device (SQUID). The AC-bias DOIT can reduce low-frequency noise without increasing the level of white noise because each operating point in the two voltage-flux characteristics with AC bias can always be optimum on the magnetometer in the high-Tc dc-SQUID. APF can improve the effective flux-to-voltage transfer function so that it can reduce the equivalent flux noise due to the voltage noise of the preamplifier in the magnetometer. The use of APF combined with the AC-bias DOIT reduced the noise of the magnetometer by factors of 1.5 (33µΦ0/Hz vs. 50 µΦ0/Hz) at100 Hz, 3.5 (43 µΦ0/Hz vs. 150 µΦ0/Hz) at 10 Hz, and 5.2 (67 µΦ0/Hz vs. 351 µΦ0/Hz) at 1 Hz as compared with the noise levels that were obtained with the static-current-bias DOIT. The contribution of the factors at 1 Hz is about 2 by APF and 2.6 by AC bias. The performance of improving the flux noise in the AC -bias DOIT with APF is almost equal to that of the flux locked loop (FLL) circuits in which the flux modulation uses a coupling system with a transformer and with the AC bias.

In this work we propose a pricing scheme which serves as an instrument for managing connectionless services in connection-oriented communication networks. The scheme is able to allocate network bandwidth in a Pareto-optimal way that maximizes the total surplus. The key idea is to decompose the service provision procedure among three separate parties whose interactions are governed by a set of competitive pricing mechanisms.

High-Tc SQUID was applied to the detection of magnetized fine particle moving at high speed. Two types of SQUIDs were used. One was a large washer type and the other was a flux transformer type. Their Josephson junctions were step edge type. The iron particle was attached on a nylon wire and scanned under the SQUID. High-Tc SQUID detected an iron particle of 50 µm diameter running at 800 m/min. It was shown that the magnetic field measured by the SQUID was proportional to the volumer of the particle and is inversely proportional to the distance between the SQUID and the particle. This technique using high-Tc SQUID is hopeful not only to wire production line but also for the processing of food and medicine, etc.

New THz radiation devices made of high-Tc superconductors are fabricated and their characteristics are studied in detail. Ultrashort electromagnetic pulses with 0.5 ps width have been radiated into free space from current biased devices made of superconducting YBa2Cu3O7 (YBCO) films by exciting with femtosecond laser pulses. The Fourier spectrum of them extends up to 3 THz. The radiation mechanism is ascribed to the ultrafast supercurrent modulation by the optical pulses. The THz waveform is analyzed using rate equations describing the relaxation of photoexcited quasiparticles. By the improvement of the device structure and the collecting optics, the radiation power can be increased up to 0.5 µW. A new type THz radiation from YBCO films under an external magnetic field without a transport current is also reported.

In this paper, we consider conventional signaling link fault tolerance and error correction mechanisms to provide reliable services of mobile multimedia telecommunication network based on ATM (Asynchronous Transfer Mode) technology. Also, we propose an efficient signaling protocol interworking architecture and a reliable distributed interworking network architecture between SS7 based FPLMTS and ATM networks. Besides, we evaluate the performance of proposed method through computer simulation. According to the results, proposed signaling architecture shows efficient and fast fault restoration characteristics than conventional MTP-3/3b based network. Functional signaling protocol stack and network architecture of proposed fast rerouting mechanism provide reliable and efficient restoration performance in view of interworking between SS7 based FPLMTS and ATM networks.

This paper considers a probabilistic model for a database recovery action with checkpoint generations when system failures occur according to a renewal process whose renewal density depends on the cumulative operation period since the last checkpoint. Necessary and sufficient conditions on the existence of the optimal checkpoint interval which maximizes the ergodic availability are analytically derived, and solvable examples are given for the well-known failure time distributions. Further, several methods to be needed for numerical calculations are proposed when the information on system failures is not sufficient. We use four analytical/tractable approximation methods to calculate the optimal checkpoint schedule. Finally, it is shown through numerical comparisons that the gamma approximation method is the best to seek the approximate solution precisely.

This is a review of our high-Tc superconductor (HTS) sampler development. The design and experimental demonstration of a Josephson sampler circuit based on YBa2 Cu3Ox(YBCO)/PrBa2Cu3Ox/YBCO ramp-edge junctions is described. The sampler circuit contains five edge junctions with a stacked YBCO groundplane and is based on single-flux quantum (SFQ) operations. Computer simulation results show that the time resolution of the sampler circuit depends strongly on the IcRn product of the junction and can be reduced to a few picoseconds with realistic parameter values. The edge junctions were fabricated using an in-situ process in which a barrier and a counter-electrode layer are deposited immediately after the edge etching without breaking the vacuum. The in-situ process improved the critical current uniformity of the junctions to 1σ20% in twelve 4-µm-width junctions. An YBCO groundplane was placed on the junctions in a multilayer structure we call the HUG (HTS cricuit with an upper-layer groundplane) structure. The inductance of YBCO lines was reduced to 1 pH per square without junction-quality degradation in the HUG structure. SFQ current-pulse generation, SFQ storage, and SFQ readout in the circuit have been confirmed by function tests using 3-kHz pulse currents. The successful operation of the sampler circuit has been demonstrated by measuring a signal-current waveform at 50K.

This paper presents an effective and robust technique for compacting a large sequence of input vectors into a much smaller input sequence so as to reduce the circuit/gate level simulation time by orders of magnitude and maintain the accuracy of the power estimates. In particular, this paper introduces and characterizes a family of dynamic Markov trees that can model complex spatiotemporal correlations which occur during power estimation both in combinational and sequential circuits. As the results demonstrate, large compaction ratios of 1-2 orders of magnitude can be obtained without significant loss (less than 5% on average) in the accuracy of power estimates.

Service interaction resolution is an important study subject to realize a network supporting various advanced communication services. This paper proposes service interaction resolution by service node connected with the communication network via the user-network interface. By executing various advanced services on the service node, service interactions can be efficiently resolved without adding new functions to the existing network. In other words, the service node enables a unified execution control of all the services including those for the originating side and those for the terminating side. This prevents the signalling system and the signalling procedure from being expanded to resolve service interactions. Moreover, the interactions between the services initiated at the conversation active state can be resolved by the service node equipped with function of receiving plural types of in-band signals. This avoids functional expansion of the switching systems in the network. In this paper, feasibility of the proposed resolution scheme is proved by showing a structure of the service node and a detailed procedure to resolve interactions on that service node. In the proposed service node, the application part is divided into basic call processing part and service processing part, and the basic call processing part is represented by three kinds of basic call processing state models. The proposed method for resolving service interactions can control services execution with high flexibility by using feature interaction table.