The microwave coagulation therapy has been used mainly for the treatment of hepatocellular carcinoma (small size tumor in the liver). In the treatment, a thin microwave antenna is inserted into the tumor, and the microwave energy heats up the tumor to produce the coagulated region including the cancer cells. At present, a problem occurs: the size of the coagulated region is insufficient, especially in the perpendicular direction of the antenna axis. In order to overcome this problem without increasing the physical load of the patient, the authors introduced a new type of array applicator composed of two coaxial-slot antennas. However, we cannot estimate heating characteristics of this array applicator precisely by using the FDTD calculation, because the use of staircasing approximation, which employs rectangular parallelepiped cells, is unsuitable for the analysis. Therefore, in this paper, we introduce the finite element method (FEM), which employs tetrahedral cells, to estimate the heating characteristics of the array applicator.

This paper describes a new optical label switching technique; wavelength and pilot tone frequency are combined to form labels that are used to control transport network routing. This technique is very attractive for achieving simple nodes that offer extremely rapid forwarding. Experimental results on the discrimination of optical labels and all-optical label conversion are also presented.

This paper describes a new optical label switching technique; wavelength and pilot tone frequency are combined to form labels that are used to control transport network routing. This technique is very attractive for achieving simple nodes that offer extremely rapid forwarding. Experimental results on the discrimination of optical labels and all-optical label conversion are also presented.

We propose a p-persistent protocol for slow-frequency-hopped slotted random access networks, assuming that all the users know the number of backlog users in a slot. The proposed protocol delays new packet transmission until the number of users with a packet to be retransmitted decreases to the threshold or less. Performance of the proposed protocol is evaluated with a two-dimensional Markov chain for systems with finite population in terms of throughput efficiency and the average transmission delay. Numerical results show that the proposed protocol can achieve better performance by suppressing new packet transmission, compared to the conventional frequency-hopped slotted ALOHA. The optimum value of the threshold is also numerically derived.

To satisfy huge service demand and multi-traffic requirements with limited bandwidth, this paper proposes two different procedures of multi-channel multiple access schemes with the slotted ALOHA operation for both data and voice traffic and presents an exact analysis to numerically evaluate the performance of the systems. In scheme I, there is no limitation on access between data transmissions and voice transmissions, i.e., all channels can be accessed by all transmissions. In scheme II, a channel reservation policy is applied, where a number of channels are used exclusively for voice packets while the remaining channels are used for both data packets and voice packets. We call the system using scheme I "Non-reservation system" and call the system using scheme II "Reservation system. " Performance characteristics we obtained include loss probability for voice traffic, average packet delay for data traffic and channel utilization for both traffic. The performance of the schemes and the effects of the design parameters are numerically evaluated and compared to a wide-bandwidth conventional single-channel slotted ALOHA system with single data traffic. The analysis presented in this paper will be not only useful for the performance evaluation and the optimum design of multi-channel multi-traffic systems in wireless environments, but also applicable to evaluate other performance measures in priority networks, cellular mobile radio networks or multi-hop wireless networks.

In this paper, a slot-averaged SIR model is derived to analyze the performances of 1/N-slotted DS-CDMA packet radio networks. DS-CDMA packet radio networks can be analyzed with channel threshold model, but it is not appropriate for a 1/N-slotted access scheme since the interference level varies slot by slot during a packet transmission time. A packet in a DS-CDMA system will be channel-encoded and interleaved so that an excessive interference of some slots does not result in a corruption of a packet directly. In a 1/N-slotted DS-CDMA packet system, interleaving and channel coding can cope with the excessive interference in some slots. Proposed slot-averaged SIR model reflects this effect and is simple enough to be used in the performance analyses of various packet access control schemes. This paper verifies the slot-averaged SIR model and evaluates the throughputs of 1/N-slotted access schemes using it. This paper also compares the results with those of the conventional channel threshold model. Packet access schemes such as slotted ALOHA, slotted CLSP and slotted CLSP/CC are analyzed. The results show that many different aspects from the results of the previous works can be evaluated and this work will offer more accurate view on the behavior of 1/N-slotted DS-CDMA packet radio networks.

A low sidelobe two-beam waveguide slot array is designed and measured. The antenna structure should be symmetrical for realizing two symmetrical beams which imposes restriction in slot design for the sidelobe and the gain. The slot coupling distribution is optimized numerically for side-lobe suppression under the condition of the structural symmetry. The first side-lobe level is minimized for the specific antenna efficiency in the continuous source model. This synthesis is reinforced by the full wave slot analysis using the method of moments. The design is confirmed by experiments using a one-dimensional array at 12 GHz and the good agreements between the predictions and the measurements are observed.

FDMA/TDMA non-geostationary earth orbit satellite systems (Non-GEOS) generally require a pre-planned pool of radio resource, i.e., frequency and time slot plan (FTSP), for each gateway earth station (GES) prior to the real-time channel assignment by the multiple GES's sharing the resources harmoniously. The time-variant nature of those systems implies that a dynamic FTSP planning method is crucial to the operation to cope with the time-variant traffic demand and the inter-beam interference condition. This paper proposes and compares three algorithms (Serial-numbering, DP-based, and Greedy algorithms) mixed with two strategies (concentrated- and spread-types) for the resource allocation. The numerical evaluation demonstrates that Greedy algorithm with the spread-type strategy is very effective and promising with feasible calculation time for the FTSP generation.

We propose the analytical calculation method of average packet success probability of CDMA Slotted ALOHA systems, which derives accurate probability, and that is applicable to the system with any spreading codes and any amplitude distributions. In the method, we consider the bit-to-bit dependence of amplitude of signals, used spreading sequences, relative timing delays, and relative carrier phases. This bit-to-bit dependence is the case that the parameters above mentioned are constant for a slot time. By using the method to obtain the average packet success probability, we derive useful throughput performance of CDMA Slotted ALOHA systems on fading channel, and show that the normalized throughput becomes worse in the case of larger spreading factor.

This paper presents efficient time slot assignment algorithms applicable to the uplink of SDMA system. A frame consists of one control time slot and multiple communication time slots where terminals in different angular positions share the same time slot. In the proposed algorithms, a time slot is assigned to a new terminal considering not only the signal quality of the new terminal but also the signal quality of active terminals. Simple calculation method for estimated signal-to-interference plus noise ratio (SINR) is employed to decrease the computational complexity. The performance of the proposed algorithms is evaluated by computer simulation and compared with sectorized systems to show the validity of the proposed algorithms.

The term pilot pollution in IS-95 CDMA systems is used to indicate that a large number of equally strong pilot signals is present. Those pilots compete with each other to become the serving one and this causes a very high rotation of pilot leadership at the mobile station. As a consequence, the signaling rate on the traffic channel increases, thus degrading the call quality. We present a method of alleviating the pilot pollution problem by means of repeaters. Simulation studies have been carried out on an actual CDMA network suffering from pilot pollution and the results have been verified by field trials. They indicate that repeaters can effectively improve call quality by altering the spacial distribution of pilot signal strength.

In this paper, we investigate the performance of the orthogonal frequency division multiplexing (OFDM) system based on a configuration of pilot symbol arrangement under a time-varying fading channel and verify it by simulation. A particular channel of concern is modeled by a wide-sense stationary uncorrelated scattering (WSSUS) Rayleigh fading process and furthermore, the inter-carrier interference (ICI) caused by the fading process is assumed to be Gaussian noise. The current analysis focuses on the performance limit of the pilot symbol-assisted channel estimation, in which a minimum mean squared error (MMSE) channel estimator is employed to exploit both time- and frequency-domain correlation simultaneously. In particular, the optimum pilot symbol arrangement was investigated for the time-varying fading channel, which has been rarely addressed with any analytical approach in previous research. Although the proposed channel estimation scheme is subject to the intensive processing complexity in the receiver, it has been shown that the better BER performance can be achieved as compared with that of the differential detection scheme and the error floor can be removed.

A novel adaptive algorithm based on pilot channel (PCA) for MMSE multiuser detection in downlink CDMA is proposed in this paper. This algorithm uses the information in pilot channel to compute the desired weight vector directly. Compared with conventional adaptive algorithms and blind algorithms, it does not require training sequences nor channel estimation. Analysis shows that the weight vector obtained by the PCA algorithm converges to the Wiener solution globally and its computational complexity is O(N2). Simulation results show that the PCA algorithm can adapt rapidly to the changing environment. The steady state performance can be enhanced by increasing the transmitted power in pilot channel, but is worse than that of conventional recursive least-square (RLS) algorithm in decision-directed mode. Also, performance of the adaptive MMSE detector is much better than that of conventional RAKE receiver.

This paper presents a pseudo glottal excitation model for the type of linear prediction vocoders with speech being coded at 1.6 kbps. While unvoiced speech and silence intervals are processed with a stochastic codebook of 512 entries, a glottal codebook with 32 entries for voiced excitation is used to describe the glottal phase characteristics. Steps of formulating the pseudo glottal excitation for one pitch period consist of 1) applying a polynomial model to simulate the low-frequency constituent of the residual, 2) inserting a magnitude-adjustable pulse sequence to characterize the main excitation, and 3) introducing turbulent noise in series with the resulting excitation. Procedures are described for codebook construction in addition to analysis and synthesis of the pseudo glottal excitation. Results in a mean opinion score (MOS) test show that the quality produced by the proposed coder is almost as good as that by 4.8 kbps CELP coder for male utterances, but the quality for female utterances is yet somewhat inferior.

We have proposed and demonstrated the circuit, which collectively recognizes header. Comparing with conventional schemes, the proposed circuit consists of simple structure. The proposed recognition circuit enables fast all-optical self-routing and contributes to reduce the buffer size for temporary data storage in each switch.

In this paper, we study efficient scheduling algorithms that are suitable for ATM networks. In ATM networks, all packets have a fixed small length of 53 bytes and they are transmitted at very high rate. Thus time complexity of a scheduling algorithm is quite important. Most scheduling algorithms proposed so far have a complexity of O(log N) per packet, where N denotes the number of connections sharing the link. In contrast, weighted round robin (WRR) has the advantage of having O(1) complexity; however, it is known that its delay property gets worse as N increases. To solve this problem, in this paper we propose two new variants of WRR, uniform round robin (URR) and idling uniform round robin (I-URR). Both disciplines provide end-to-end delay and fairness bounds which are independent of N. Complexity of URR, however, slightly increases as N increases, while I-URR has complexity of O(1) per packet. I-URR also works as a traffic shaper, so that it can significantly alleviate congestion on the network. We also introduce a hierarchical WRR discipline (H-WRR) which consists of different WRR servers using I-URR as the root server. H-WRR efficiently accommodates both guaranteed and best-effort connections, while maintaining O(1) complexity per packet. If several connections are reserving the same bandwidth, H-WRR provides them with delay bounds that are close to those of weighted fair queueing.

This paper proposes an electronic soccer lottery protocol suitable for the Internet environment. Recently, protocols based on public-key schemes such as digital signature have been proposed for electronic voting systems or other similar systems. For a soccer lottery system in particular, it is important to reduce the computational complexity and the amount of communication data required, because we must expect that a large number of tickets will be purchased simultaneously. These problems can be solved by introducing hash functions as the core of protocol. This paper shows a practical soccer lottery system based on bit commitment and hash functions, in which the privacy of prize-winners is protected and illegal acts by the lottery promoter or lottery ticket shops can be revealed.

Formal description techniques (FDTs) such as VDM, Z, LOTOS, etc are powerful to develop safety-critical systems since they have strict semantics and mathematical reasoning basis. However, they have no methods or guides how to construct specifications unlike specification and design methods such as Object-Oriented Modeling and Technique (OMT), and that makes it difficult for practitioners to compose formal specifications. One of the solutions is to connect formal description techniques with some existing methods. This paper discusses a technique how to integrate FDTs with specification and design methods such as OMT so that we can have new methods to support writing formal specifications. The integration mechanism is based on transformation rules of specification documents produced following methods into the descriptions written in formal description techniques. The transformation rules specify the correspondences on two meta models; of methods and of formal description techniques, and are described as graph rewriting rules. As an example, we pick up OMT as a method and LOTOS as a FDT and define the transformation rule on their meta models.

A systematic method for connection-wise end-to-end delay analysis in asynchronous transfer mode (ATM) networks is proposed. This method consists of the followings: (i) per-stream nodal analysis; (ii) output processes characterization; and (iii) moment matching scheme. Following our previous work, we employ H-MMPPs/Slotted D/1 to model ATM queues. Each virtual connection (VC) in ATM networks can be regarded as a tandem configuration of such queues. In [1], the per-stream analytical results for such an H-MMPPs/Slotted D/1 queue have been provided. In this paper, not only the composite output process is exactly characterized, but also the component in an output process that corresponds to a specific traffic stream is approximated via a decomposition scheme. A moment matching scheme to emulate the per-stream output process as a two-state MMPP is further proposed. Through moment matching, we can then approximate the connection-wise end-to-end delay by recursively performing the nodal performance analysis. The connection-wise end-to-end delay is crucial to network resource decision or control problems such as call admission control (CAC) and routing.

This paper examines fairness of service in the up-link of CDMA cellular slotted-ALOHA packet communication systems with site diversity reception. Site diversity rescues the packets originating mainly from near the edge of the cells, whereas packets originating near the base stations can not obtain the benefits of diversity reception. This situation causes an unfairness in packet reception that depends on location of the mobile station. Two transmission control schemes for reducing this unfairness are proposed. In the first scheme, mobile stations control the target received power for the open-loop power control based on the reception level of the pilot signals of the surrounding base stations. In the second, mobile stations control transmit permission probability. Successful packet reception rate, fairness coefficient and throughput performance are evaluated in fading environments with imperfect power control. Computer simulation shows that both schemes improve service fairness for all mobile stations and throughput performances. A performance comparison between the two schemes concludes that transmission power control outperforms transmit permission probability control as a simple technique for maintaining fairness of services.