Broadcast data delivery is attractive for large-size data distribution where a large user community is connected to a server through a network. It is important to consider a broadcast scheduling method which minimizes the average response time. The scheme should also guarantee the expected waiting time at the time of request. In this paper, we propose a method which divides all titles into several groups and assigns FIFO to each group. The proposed method can guarantee the waiting time for each user at his request, and is superior to FIFO (in high load) and a fixed allocation method (in low load).

In this manuscript, two key agreement protocols which are resistant to a denial-of-service attack are constructed from a key agreement protocol in [9] provably secure against passive and active attacks. The denial-of-service attack considered is the resource-exhaustion attack on a responder. By the resource-exhaustion attack, a malicious initiator executes a key agreement protocol simultaneously as many times as possible to exhaust the responder's resources and to disturb executions of it between honest initiators and the responder. The resources are the storage and the CPU. The proposed protocols are the first protocols resistant to both the storage-exhaustion attack and the CPU-exhaustion attack. The techniques used in the construction are stateless connection, weak key confirmation, and enforcement of heavy computation. The stateless connection is effective to enhancing the resistance to the storage-exhaustion attack. The weak key confirmation and the enforcement of heavy computation are effective to enhancing the resistance to the CPU-exhaustion attack.

A new speech enhancement technique is proposed assuming that a speech signal is represented in terms of a linear probabilistic process and that a noise signal is represented in terms of a stationary random process. Since the target signal, i.e., speech, cannot be represented by a stationary random process, a Wiener filter does not yield an optimum solution to this problem regarding the minimum mean variance. Instead, a Kalman filter may provide a suitable solution in this case. In the Kalman filter, a signal is represented as a sequence of varying state vectors, and the transition is dominated by transition matrices. Our proposal is to construct the state vectors as well as the transition matrices based on time-frequency pattern of signals calculated by a wavelet transformation (WT). Computer simulations verify that the proposed technique has a high potential to suppress noise signals.

We propose a dynamic assignment method of radio channels using their qualities and data packet sizes. In this method, a high quality channel is assigned for long packets and a low quality channel is assigned for short packets. Assuming a packet transfer method based on PHS (Personal Handy System) procedure, the transfer speed and delay characteristics are investigated by computer simulation and compared with conventional method (i.e. random assignment). Both the transfer speed characteristics and delay performance are improved under light traffic load.

In this paper, we proposed two models, the full multiple MCS (Multicast Server) model and the hybrid multiple MCS model to support multiple MCS over a single large cluster in ATM (Asynchronous Transfer Mode) networks. Also, we presented two methods for MCS assignment which are known as 2PSPMT (2 Phase Shortest Path based on Multicast tree) and hybrid-2PSPMT, and evaluated its performance by simulation. When an ATM host requests joining a specific multicast group, the MARS (Multicast Address Resolution Server) designates a proper MCS among the multiple MCSs for the group member to minimize the average path delay between the sender and the group members. Each method for MCS assignment construct a 2-phase partial multicast tree based on the shortest path algorithm. We reduced the average path delay in the multicast tree using these methods with various cluster topologies and MCS distribution scenarios in addition to distributing the load among multiple MCSs.

In this paper, we first investigate the problems of the existing branch point algorithms for available bit rate (ABR) multicast connections in ATM networks, and then propose various solutions for resolving those problems. By combining these solutions, we also propose a new efficient and scalable branch point algorithm. In the proposed algorithm, each branch point stores the feedback information on a per-branch basis for each virtual connection and only passes BRM cells returning from the farthest destination. Simulation results show that the proposed algorithm can provide a good fairness, a higher efficiency and an excellent scalability, compared with the existing algorithms.

The hardware implementation of a proposed high dimensional discrete torus knot code was successfully realized on an ASIC chip. The code has been worked on for more than a decade since then at Aichi Prefectural University and Nagoya Institutes of Technology, both in Nagoya, Japan. The hardware operation showed the ability to correct the errors about five to ten times the burst length, compared to the conventional codes, as expected from the code configuration and theory. The result in random error correction was also excellent, especially at a severely degraded error rate range of one hundredth to one tenth, and also for high grade characteristic exceeding 10-6. The operation was quite stable at the worst bit error rate and realized a high speed up to 50 Mbps, since the coder-decoder configuration consisted merely of an assemblage of parity check code and hardware circuitry with no critical loop path. The hardware architecture has a unique configuration and is suitable for large scale ASIC design. The developed code can be utilized for wider applications such as mobile computing and qualified digital communications, since the code will be expected to work well in both degraded and high grade channel situations.

In this paper, a Wiener filtering method in wavelet domain is proposed for restoring an image corrupted by additive white noise. The proposed method utilizes the multiscale characteristics of wavelet transform and the local statistics of each subband. The size of a filter window for estimating the local statistics in each subband varies with each scale. The local statistics for every pixel in each wavelet subband are estimated by using only the pixels which have a similar statistical property. Experimental results show that the proposed method has better performance over the Lee filter with a window of fixed size.

A new method for active suppression of reflected sound waves is proposed in this paper. The proposed control system is based on the state feedback control. FEM (Finite Element Method) was applied to represent the sound field under the system equations as proposed by Samejima et al. A new performance index was derived so as to minimize the sound intensity leaving a control region, which was set around the control source on a wall. On the basis of the system equations and the new performance index, an optimal feedback law governing suppression of waves reflected from the wall was derived. In order to evaluate the validity of the proposed method, computer simulations in one- and two-dimensional sound fields were executed. In a one-dimensional sound field, the time response was examined, and the distribution of the instantaneous sound intensity was evaluated in a two-dimensional sound field. The results showed that the reflected sound waves can be suppressed quite well in one-dimensional sound fields by using this method and that the proposed method can potentially suppress the reflected sound waves in the two-dimensional sound fields as well.

This paper treats weight distributions of the coset leaders of binary linear block codes. We first present a method for computing the weight distribution of the coset leaders of a given code using two tables each of which stores the weights of the coset leaders of a related code of the code. Then, the weight distributions of the coset leaders of the (N,K) Reed-Muller codes, binary primitive BCH codes, and their extended codes with N 128 and 29 N-K 42 that are obtained by using the computing method are given.

This paper describes experimental results on whole word HMM-based speech recognition of connected digits in Japanese with special focus on the training data size and the "sheep and goats" problem. The training data comprises 757000 digits uttered by 2000 speakers, while the testing data comprises 399000 digits uttered by 1700 speakers. The best word error rate for unknown length strings was 1.64% obtained using context dependent HMMs. The word error rate was measured for various subsets of the training data reduced both in the number of speakers (s) and the number of utterances per speakers (u). As a result, an empirical formula of s[{min(0.62s0.75, u)}0.74 + {max(0, u-0.62s0.75)}0.27] = D(Ew) was developed, where Ew and D(Ew) designate word error rate and effective data size, respectively. Analyses were conducted on several aspects of the low performance speakers accounting for the major part of recognition errors. Attempts were also made to improve their recognition performance. It was found that 33% of the low performance speakers are improved to the normal level by speaker clustering centered around each low performance speaker.

We propose a method to represent non-binary error patterns for Reed-Solomon codes using a trellis. All error patterns are sorted according to their Euclidean distances from the received vector. The decoder searches through the trellis until it finds a codeword. This results in a soft-decision maximum likelihood algorithm with lower complexity compared to other known MLD methods. The proposed MLD algorithm is subsequently modified to further simplify complexity, reflecting in a slight reduction in the error performance.

In order to increase the link capacity in the wideband direct sequence code division multiple access (W-CDMA) reverse link, employing a parallel-type coherent multi-stage interference canceller (COMSIC) is more practical than employing a serial (successive)-type due to its inherent advantage of a short processing delay, although its interference suppression effect is inferior to that of the serial-type. Therefore, this paper proposes a parallel-type COMSIC with iterative channel estimation (ICE) using both pilot and decision-feedback data symbols at each canceling stage in order to improve the interference suppression effect of the parallel-type COMSIC. Computer simulation results demonstrate that by applying the parallel-type COMSIC with ICE after FEC decoding, the capacity in an isolated cell can be increased by approximately 1.6 (2.5) times that of the conventional parallel-type COMSIC with channel estimation using only pilot symbols (the MF-based Rake receiver) at the required average transmit Eb/N0 of 15 dB, i.e. in the interference-limited channel. The results also show that, although the capacity in the isolated cell with the parallel-type COMSIC with ICE after FEC decoding is degraded by approximately 6% compared to that with the serial-type COMSIC with ICE after FEC decoding, the processing delay can be significantly decreased owing to the simultaneous parallel operation especially when the number of active users is large.

We have developed a new traffic measuring tool and applied it to the real-time simulation of a network. It monitors IP traffic on an ATM link and continuously transfers the length and timestamp of each IP packet to a post-processing system. The post-processing system receives the data, estimates the cell's arrival epoch at the transmission queue of the ATM link, and simulates the queueing behavior on-line if conditions differ from those of the actual system. The measuring tool and real-time simulation represent a new approach to traffic engineering. A new estimation problem, the arrival sequence estimation, is shown and some algorithms are proposed and evaluated. Also, a new dimensioning algorithm called the queue decay parameter method, which is expected to be robust and applicable to real-time control, is proposed and evaluated.

In CDMA mobile cellular systems, wireless quality is improved by soft handoff techniques. However, it requires to hold multiple channels of cells, which is likely to increase call blocking at wired channels. It is therefore necessary to consider the entire system including the wired and wireless portions of systems for investigating an effectiveness of the soft handoff. In this paper, we also clarify the effect of interference power from mobile stations that are not in the soft handoff because of lack of wired channels. In the analysis, we model three-way soft handoff which has not been considered in past researches. We also show the effect of a call admission control to wireless quality.

Fuzzy inference abilities were implemented to electromagnetic problems for the first time by the authors. After very successful results of applying the developed fuzzy modeling method to input impedance of a general monopole antenna, in this paper classifying the engineering electromagnetic problems simply, we apply the abilities of the proposed fuzzy inference method to make a qualitative model for transmission lines as a general example for a certain category of problems. The proposed approach starts from observing the problem through the window of human direct understandings and uses some parameters (as calculation base) evaluated basic for modeling process. It is shown that because of using this novel view point, a very simple fuzzy system based on new parameters may model the behavior of a transmission line in general form. The knowledge of each variable can be extracted and saved as simple curves individually, through continuing to make several models considering the desired variable as parameter. Finally, it is shown that the proposed method works even in highly nonuniform transmission line cases without changing in structure and complexity.

The k-vertex-connectivity augmentation problem for a specified set of vertices of a graph with degree-unchangeable vertices, kVCA(G,S,D), is defined as follows: "Given a positive integer k, an undirected graph G=(V,E), a specified set of vertices S V and a set of degree-changeable vertices D V, find a smallest set of edges E such that the vertex-connectivity of S in (V,E E) is at least k and E {(u,v) u,v D}. " The main result of the paper is that checking the existence of a solution and finding a solution to 2VCA(G,S,D) or 3VCA(G,S,D) can be done in O(|V|+|E|) or O(|V|(|V|+|E|)) time, respectively.

A novel body potential-controlling technique for floating SOI CMOS circuits is proposed and verified in this study. High-speed operation is realized with a small chip size by using body-floating SOI transistors. The use of this technique allows the threshold voltage of the body-floating transistors to be varied transitionally. Therefore, the standby current of SOI CMOS logic is reduced to less than 1/50th of that required by the non-controlled operation of the body potential, and the logic operates at a high speed during the active period. There is no speed penalty for the recovery operation from the standby mode. This technique supports sub-1 V operation, which will be required by future battery-operated devices with wide-range covering.

This paper provides a normalized Iterative Feedback Tuning (IFT) method that assures the boundedness of the gradient vector estimate (ρ) and the Hessian matrix estimate without the assumption that the internal signals are bounded. The proposed method uses the unbiased Gauss-Newton direction by the addition of the 4-th experiment. We also present blended control criteria and a PID-like controller as new design choices. In examples, the normalized IFT method results in a good convergence although the internal signal or the measurement noise variance is large.

2.4-GHz-band mid-speed (1- to 2-Mbit/sec) wireless LAN systems are being widely used in offices and factories. Electromagnetic interference can occur between these systems because they use the same frequency range. In this paper, we investigate the characteristics of the interference between wireless LAN systems that use direct-sequence (DS) systems and frequency-hopping (FH) systems. The interference characteristics were measured for three DS systems and one FH system that meet the IEEE 802.11 and RCR standards and that use different modulation methods. Our results indicate that throughput depends on the system and the modulation method. We have also developed a model that can be used to calculate the interference characteristics between DS and FH systems by considering the bandwidth of their transmission signals, the dwell time of the FH system, and the time that the DS system needs to transmit a data frame. We used this model to calculate the bit error rate (BER) characteristics of the systems used in our experiment, and the results indicate that BER characteristics depend on the modulation method. The throughput characteristics of the systems used in our experiment were also calculated, and agreed with the experiment results within +/- 5 dB. The throughput characteristics of wireless LAN systems based on IEEE 802.11 were also calculated when the signal level was higher than the receiver noise level. The results show that FH systems require a D/U ratio about 7 or 8 dB higher than the ratio required in DS systems because the parameters in the standard differ between FH and DS systems.