A new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.

We propose a method which can construct LOTOS specifications of communication systems from temporal properties described in Extended branching time temporal logic (EBTL) in this paper. Description of LOTOS, one of Formal Description Techniques, is based on behaviors of systems so that LOTOS permits strict expression. However, it is difficult to express temporal properties explicitly. On the other hand, Temporal logic is based on properties of systems. Thus temporal logic permits direct expression of temporal properties which can be understood intuitively. Accordingly, temporal logic is more useful than FDTs on the first step of systems specification. This method is effective in this point of view. Specifications obtained using this method can have a structured style. When temporal properties are regarded as constraints about temporal order among actions of systems, those specification can have a constraint oriented style. This method is based on sequential composition of Labelled Transition Systems (LTSs) which are semantics of LOTOS. EBTL is also defined on LTSs. In general, many LTSs satisfy the same temporal property. To obtain such the minimal LTS, the standard form of LTSs corresponding to EBTL operators are defined. Those standard LTSs are mainly tailored to the field of communication protocol. We also show conditions that original temporal properties are preserved in case of sequential composition of standard LTSs. In addition, applying this method to the Abracadabra Protocol, we show that this method can construct specifications of concrete protocols effectively.

This paper propeses a new motion compensation (MC) technique which reduces blurring called drift in moving pictures down-scaled with layered coding system. Encoder of the system compresses large amounts of digital video data in the same way of MPEG (Moving Picture Experts Group) algorithm. Decoder, on the other hand, expands a part of the compressed data and reconstructs down scaled pictures. The purpose of this paper is to reduce blurring which is observed in the reconstructed pictures. In this paper, cause of the blurring is analyzed and the method is introduced as a solution to the problem. The new method is implemented by a little modification of motion compensation (MC) of the decoder, namely increasing the number of tap of interpolation fillters of the MC. Compressing moving pictures, its effectiveness is also confirmed by means of not only subjective test but also signal to noise ratio.

This paper presents new go-back-N ARQ protocols for point-to-multipoint communications over broadcast channels such as satellite or broadcast radio channels. In the conventional go-back-N ARQ protocols for multidestination communications, usually only error detection codes are used for error detection and m copies of a frame are transmitted at a time. In one of our protocols, a bit-by-bit majority-voting decoder based on all of the m copies of a frame is used to recover the transmitted frame. In another protocol, a hybrid-ARQ protocol, which is an error detection code concatenated with a rate repetition convolutional code with the Viterbi decoding, is used. In these protocols, a dynamic programming technique is used to select the optimal number of copies of a frame to be transmitted at a time. The optimal number is determined by round trip propagation delay of the channel, the error probability, and the number of receivers that have not yet received the message. Analytic expressions are derived for the throughput efficiency of the proposed protocols. The proposed point-to-multipoint protocols provide satisfactory throughput efficiency and perform considerably better than the conventional protocols under high error rate conditions, especially in environments with a large number of receivers and large link round trips. In this paper we analyze the performances of the proposed protocols upon the random error channel conditions.

Go-Back-N automatic repeat request (GBN ARQ) and Stop-and wait (SW) ARQ schemes are one of fundamental and widely used error control procedures for data communication and computer communication systems. The throughput and delay performances of these ARQ schemes have been analyzed for a random error channel, which could not applicable for a radio channel, for example. In this paper, considering the correlated, noisy channel, we derive the exact formula for the delay of a frame in GBN and SW ARQ schemes. First, the delay formula for the discrete time M[x]/G/1 queueing system with starter. Next, the virtual service time of a frame is found in terms of the decay factor of a two-state Markov chain. As a result, it is shown that the performance of the delay is improved with the larger decay factor.

The performance of multi-pulse pulse position modulation (MPPM) consisting of m slots and 2 pulses, denoted as (m, 2) MPPM, with imperfect slot synchronization is analyzed. The word error probability of (m, 2) MPPM in the presence of timing offset is analyzed, and the optimum symbol sets of (m, 2) MPPM minimizing the symbol error probability are assigned. When an unassigned symbol is detected, the receiver decodes the unassigned symbol as one of the assigned symbols having the highest probability of transition from the assigned symbol to the unassigned symbol. The bit error probability of (m, 2) MPPM in the presence of the timing offset is analyzed, and the bit error probability of (m, 2) MPPM is compared with that of PPM for the same transmission bandwidth and the same transmission rate. Moreover, the bit error probability of (m, 2) MPPM synchronized by a phase-locked loop (PLL) is also analyzed. It is shown that a word with two continuous pulses has better performance than a word with two separate pulses. It is also shown that when the timing offset occurs, and when the slot clock is synchronized by a PLL, (m, 2) MPPM performs better than PPM because (m, 2) MPPM has the optimum assigned symbols, and can decode detected words more correctly than PPM.

Linear lightwave networks (LLNs) are optical networks in which network nodes perform only linear operations on optical signals: power splitting, combining, and non-regenerative amplification. While previous efforts on LLNs assume only one fiber per link, we consider a multi-fiber linear lightwave network (M-LLN) architecture for telecommunications where switching exchanges are normally connected by multi-fiber cables. We propose a class of linear path (LP) allocation schemes for establishing optical paths in M-LLNs, and show that they have a better performance than those proposed for single-fiber LLNs. We show that M-LLNs can be implemented with commercially available components, and discuss the implementation issues in detail.

To increase the accuracy of a near field antenna measurement system, it is necessary to know radiation characteristics of a probe to detect near field data. Open ended waveguide used as a near field probe in our system was analyzed using Transmission Line Matrix (TLM) method which is a time domain electromagnetic solver. Validity of this analysis has been confirmed by comparison with experimental data and existing theoretical approximation. Frequency dependence of a complex reflection coefficient at the waveguide aperture has been derived and is shown to agree with measured values. The radiation pattern of the open ended waveguide with mounting structure is also calculated. Ripples on both the amplitude and phase patterns are correctly predicted by our simulation. This method can be applied to accurately model the effect of probe antennas to enhance the accuracy of near field antenna range.

The techniques for imaging optically opaque region using an electromagnetic wave radar are being developed. One important application of these techniques is the detection of buried pipes and cables. The image quality of subsurface radar often becomes low because the electromagnetic waves are affected by the attenuation and inhomogeneity of soil. Hence, a method which improves the quality of the radar images has been required. The migration method is utilized in reflective seismic processing and is derived based on the solution of the wave equation represented in spatial frequency domain. It is classified into the F-K and the phase-shift (P-S) migration method. The former is derived on the assumption that propagation velocity of the wave is uniform in the soil while the latter is assumed that the propagation velocity is varying depending on the depth from the ground surface. The P-S method gives relatively good quality images but it requires very long computation time. In this paper, we propose the block migration method in which the F-K method is applied to the divided image blocks with local propagation velocity. In order to solve a problem concerning the connection between the contiguous blocks we present two approaches which are the processings using the overlapped regions and the Lapped Orthogonal Transform (LOT). Some experimental results point out that the block migration method has a good capability of improving the image quality and the processing time using LOT becomes one tenth in comparison with the P-S method.

The throughput performance of a slotted, non-persistent Idle-Signal Casting Multiple Access (ICMA) protocol under the effects of various combinations of Rayleigh fading, lognormal shadowing, and spatial distribution of mobile users is studied. The opposing effects of propagation impairments on the performance of the protocol through simultaneously increasing the probability of receiver capture and attenuation of the received signal power level are demonstrated.