Katsumi SAKAKIBARA Ritsuko IWASA Yoshiharu YUBA
We prove that binary images of irreducible cyclic codes C over GF(2m) and binary concatenated codes of C and a binary [m+1,m,2] even-parity code are optimal (in the sense that they meet the Griesmer bound with equality) and proper, if a root of the check polynomial of C is primitive over GF(2m) or its extensions.
Abbas SANDOUK Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
In this paper, we consider an integrated voice and data system over CDMA Slotted-ALOHA (CDMA S-ALOHA). We investigate its performance when multi-code CDMA (MC-CDMA) is applied as a multi-rate scheme to support users which require transmission with different bit rates. Two different classes of data users are transmitted together with voice. Performance measurement is obtained in respect of throughput for data and outage probability for voice. Moreover, we consider the Modified Channel Load Sensing Protocol (MCLSP) as a traffic control to improve the throughput of data. As a result, we show that the MC-CDMA technique is an effective one to obtain good throughput for data users at an acceptable voice outage probability. Furthermore, we show that with MCLSP, the throughput of data can be improved to reach a constant value even at a high offered load of data users.
Shiann-Tsong SHEU Chao-Tsong FANGTSOU Wu-Hsiao HSU Ming-Ching HSIAO
An ad hoc wireless network is a collection of mobile hosts that self-forming a temporary network without any required intervention of centralized system. In such environment, mobile hosts, which are not within transmission range from each other, require some other intermediate hosts to forward their packets to form a multi-hop communication. In this paper, an ad hoc network is modeled as a graph. Two nodes within the transmission range of each other are connected by an edge. Given a finite set of mobile nodes, a finite set of edges and a new multicast request, the wireless multicast tree problem (WMTP) is to find a multicast tree for the request so that the multicast loss probability is minimized. We prove the WMTP is NP-complete and a heuristic algorithm, called Degree-Based Multicast Routing Algorithm (DBMRA), is proposed. Based on the DBMRA, one algorithm was proposed to establish backup nodes for the multicast tree to improve the reliability. A node is needed to be backup only when it has a high probability to disconnect the multicast tree seriously. The qualification of a node to be backup is subject to a computed threshold, which is determined by a statistic analysis. The theoretical and experimental analyses are presented to characterize the performance of our algorithms.
Lan CHEN Hidekazu MURATA Susumu YOSHIDA Shouichi HIROSE
In this paper, the performance of dynamic channel assignment for cellular systems with an array antenna is evaluated assuming realistic beamformer. A new dynamic channel assignment algorithm is proposed to improve the performance by forming a directional beam pattern to cancel stronger co-channel interference with higher priority. Performance comparison is carried out by computer simulations. Conventional algorithm shows 2.7 fold capacity increase compared with an omni antenna system, whereas proposed algorithm shows around 3.3 fold capacity increase, at the point of 3 percent blocking probability. The simulation results also denote that a shorter reuse distance can be achieved by the proposed algorithm, which indicates a more efficient utilization of channel resource.
Yoshiaki SHIKATA Shigefusa SUZUKI Yoshitaka TAKAHASHI Takeshi IHARA Takao NAKANISHI
In a personal communication system (PCS), a scheme for reforwarding call-terminating setup messages (SETUP messages) from a network or a cell station is used to guard against their loss. We have developed a method for evaluating the loss probability of a reforwarding scheme in which the network monitors the response messages from a personal station after forwarding a SETUP message to that personal station and reforwards the SETUP message only if a response message is not received. We started with a stochastic model in which messages registered in the paging-channel queue in a cell station are cyclically forwarded to the wireless area. This model corresponds to the finite-capacity M/D/1/N model with vacation time. We then added a method for calculating the "timeout" probability. Next we expanded the model into one in which the SETUP messages are reforwarded when a response message is not received by the network. This model corresponds to the M/D/1/N model with vacation time and retrials. We then added an approximate method for calculating the loss probability. Finally, using the proposed methods, we clarified the traffic characteristics of PCS call-terminating control.
Taira NAKAJIMA Hiroyuki TAKIZAWA Hiroaki KOBAYASHI Tadao NAKAMURA
We propose a learning algorithm for self-organizing neural networks to form a topology preserving map from an input manifold whose topology may dynamically change. Experimental results show that the network using the proposed algorithm can rapidly adjust itself to represent the topology of nonstationary input distributions.
Yutaka KAWABATA Yoshimasa DAIDO Shimmi HATTORI
This paper describes the error probability of the second order BAM estimated by a computer simulation and an analytical calculation method. The computer simulation suggests that the iterations to retrieve a library pattern almost converge within four times and the difference between once and twice is much larger than that between twice and four times. The error probability at the output of the second iteration is estimated by the analytical method. The effect of the noise bits is also estimated using the analytical method. The BAM with larger n is more robust for the noise. For example, the noise bits of 0.15n cause almost no degradation of the error probability when n is larger than 100. If the error probability of 10-4 is allowable, the capacity of the second order BAM can be increased by about 40% in the presence of 0.15n noise bits when n is larger than 500.
Yukari YAMAUCHI Masao MUKAIDONO
When the degree of intersections A B of events A, B is unknown arises a problem: how to evaluate the probability P(A B) and P(A B) from P(A) and P(B). To treat related problems two models of valuation: interval and paired probabilities are proposed. It is shown that the valuation corresponding to the set operations (intersection), (union) and (complement) can be described by the truth functional (AND), (OR) and (negation) operations in both models. The probabilistic AND and OR operations are represented by combinations of Kleene and Lukasiewicz operations, and satisfy the axioms of MV (multiple-valued logic)-Algebra except the complementary laws.
Packet contention is one of the fundamental problems that must be overcome in designing packet switches. In banyan network, which has multistage interconnection structure of many small switch elements, we must be concerned with output port conflicts and internal collisions. Dilated banyan network which provides multiple path for internal link can reduce packet loss due to internal collisions in loss system. However, under hot-spot traffic higher packet loss probability is measured at the hot-spot port and the ports close to the hot-spot as coefficient h increases due to the heavy traffic to hot-spot port. In order to moderate the packet loss probability at the hot-spot port we propose the method to disperse the packets which concentrate on the hot-spot route by altering address field of a half of incoming packets. These packets are switched along detour routes. Thus, the traffic concentration toward hot-spot is mitigated and the packet loss probability at the hot-spot port is moderated.
The time-memory trade-off cryptanalysis for block ciphers with a search space of size 2N (N: key length) cannot achieve a success probability excceding 63%. This is caused by some unavoidable overlapping of keys in the space. For elavating the success probability of finding the correct key, a larger search space is necessary. That is, the increase of time complexity for precomputation would be inevitable. This paper theoretically shows, however, no further price is required for the size of look-up tables for the number of encryptions for searching for the key that matches the given ciphertext - plaintext pairs. This theory is confirmed by some empilical results.
In this paper, we propose a method, called PORT-D, for optimizing CMOS logic circuits to reduce the average power dissipation. PORT-D is an extensional method of PORT. While PORT reduces the average power dissipation under the zero delay model, PORT-D reduces the average power dissipation by taking into account of the gate delay. In PORT-D, the average power dissipation is estimated by the revised BDD traversal method. The revised BDD traversal method calculates switching activity of gate output by constructing OBDD's without representing switching condition of a gate output. PORT-D modifies the circuit in order to reduce the average power dissipation, where transformations which reduce the average power dissipation are found by using permissible functions. Experimental results for benchmark circuits show PORT-D reduces the average power dissipation more than the number of transistors. Furthermore, we modify PORT-D to have high power reduction capability. In the revised method, named PORT-MIX, a mixture strategy of PORT and PORT-D is implemented. Experimental results show PORT-MIX has higher power reduction capability and higher area optimization capability than PORT-D.
Doo Seop EOM Masashi SUGANO Masayuki MURATA Hideo MIYAHARA
In this paper, we investigate a call admission control (CAC) problem in a multimedia wireless ATM network that supports various multimedia applications based on micro/pico cellular architectures. Due to reduced wireless cell size (compared to conventional cellular networks), forced termination of calls in progress becomes a more serious problem in the wireless ATM network. Another problem specific to the multimedia wireless network is how to avoid an excessive delay of non-realtime applications under the presence of various realtime applications with priority over non-realtime applications. We consider two service classes; CBR for realtime applications and UBR for non-realtime applications, and then propose a new CAC scheme that addresses above two problems while minimizing a blocking probability of newly arriving calls of CBR. Through the analytical methods, we derive the blocking probabilities and forced termination probabilities of CBR calls and the average packet delay of UBR connections. We also present a method that decides the optimal CAC threshold values in our CAC scheme.
The DC component suppressing method, called Guided Scrambling (GS), has been proposed, where a source bit stream within a data block is subjected to several kinds of scrambling and a RLL (Run Length Limited) coding to make the selection set of channel bit streams, then the one having the least DC component is selected. Typically, this technique uses a convolutional operation or GF (Galois field) conversion. A review of their respective symbol error properties has revealed important findings. In the former case, the RS (Reed-Solomon) decoding capability is reduced because error propagation occurs in descrambling. In the latter case, error propagation of a data block length occurs when erroneous conversion data occurs after RS decoding. This paper introduces expressions for determining the decoded symbol error probabilities of the two schemes based on these properties. The paper also discusses the difference in code rates between the two schemes on the basis of the result of calculation using such expressions.
This paper presents a new approach to computing symbol error probability of fast frequency-hopped M-ary frequency shift keying (FFH/MFSK) systems with majority vote under multitone jamming. For illustrating the applications, we first consider the case in which the source data rate is fixed and the hopping rate is allowed to vary. In this case, the optimum orders of diversity for several values of M are examined. Results show that M=4 outperforms other values. Then, we treat another case in which the hopping rate is fixed and the data rate is adjusted so as to obtain maximum throughput under a given constraint of error probability. In addition to the case of diversity alone, we also evaluate the performances of the fixed hopping rate case with channel coding using convolutional code and BCH code.
Yuichi SAKUMURA Kazuyuki AIHARA
Though response of neurons is mainly decided by synaptic events, the length of a time window for the neuronal response has still not been clarified. In this paper, we analyse the time window within which a neuron processes synaptic events, on the basis of the Hodgkin-Huxley equations. Our simulation shows that an active membrane property makes neurons' behavior complex, and that a few milliseconds is plausible as the time window. A neuron seems to detect coincidence synaptic events in such a time window.
Lan CHEN Susumu YOSHIDA Hidekazu MURATA Shouichi HIROSE
Personal communication systems are increasingly required to accommodate not only voice traffic, but also various types of data traffic. Generally speaking, voice traffic is symmetric between uplink and downlink, while data traffic can be highly asymmetric. It is therefore inefficient to accommodate data in a conventional TDMA/TDD system with fixed TDD boundary. In this paper, focusing on the continuous data traffic which requires multi-slots in a circuit based TDMA/TDD system, an algorithm is proposed in which the TDD boundary are moved adaptively to accommodate data traffic efficiently. Comparing with the boundary-fixed conventional algorithm, computer simulations confirm that the proposed algorithm has superior performance in the excessive transmission delay of data while maintaining the performance of voice. The intercell interference between mobiles due to different TDD boundaries is also confirmed to be negligible. Moreover, almost the similar performance improvements of the proposed algorithm are confirmed for two different average message sizes of data calls.
Satoshi TAKAHASHI Yoshihide YAMADA
For mobile telecommunication systems, it is important to accurately predict the propagation-path loss in terms of the estimation of the radiowave coverage area. The propagation-path loss has been estimated in a median obtained spatially from many received amplitudes (envelopes) within a region of several tens times as long as the wavelength, rather than in the envelopes themselves. Although ray tracing can obtain the envelopes and their median that reflect the site-dependent characteristics, the estimated median sometimes does not agree with the measured one. Therefore, the accuracy improvement has been expected. In this paper, an accuracy improvement is achieved by substituting a median with random phases for the median obtained spatially from many envelopes. The characteristic function method is used to obtain the cumulative distribution function and the median analytically where the phases are randomized. In a multipath environment, the phase-estimation error accompanying the location error of the ray tracing input influences the spatially obtained median. The phase-randomizing operation reduces the effects of the phase-estimation error on the median prediction. According to our estimation, improvements in accuracy of 4. 9 dB for the maximum prediction error and 2. 9 dB for the RMS prediction error were achieved. In addition, a probability-based cell-design method that takes the radiowave arrival probability and the interference probability into consideration is possible by using the percentiles obtained by the characteristic function method and the cell-design examples are shown in this paper.
This paper proposes an adaptive permission probability control method for the CDMA/PRMA access protocol. The proposed method is effective to the uplink channels of the integrated voice and data wireless system. The proposed method uses the R-ALOHA protocol with end-of-use flags in order to avoid the reservation cancellations caused by excessive multiple-access interference. Also, a higher priority at packet transmission is given to voice compared with data so that the real-time transmission of voice packets can be guaranteed. Priority is controlled by suitably varying permission probabilities. Permission probabilities are adaptively calculated according to both the channel load and the channel capacities. The usefulness of this proposed method is ensured through computer simulation in an isolated cell environment. Moreover, various applications to cellular environments are investigated. The calculated results indicate that transmission efficiency has been improved compared with the conventional CDMA/PRMA protocol.
Hiraku OKADA Takaya YAMAZATO Masaaki KATAYAMA Akira OGAWA
In this paper, CDMA slotted ALOHA system with finite size of buffers is proposed. To analyze the system performance, we use the linear approximate solution based on restricted occupancy urn models. We evaluate the system performance in terms of throughput, average delay, and rejection probability and clarify the effect of buffer capacity.
Kyung-Tae JUNG Hyung-Myung KIM
We propose a Generalized Order Statistic Cell Averaging (GOSCA) CFAR detector. The weighted sums of the order statistics in the leading and lagging reference windows are utilized for the background level estimate. The estimate is obtained by averaging the weighted sums. By changing the weighting values, various CFAR detectors are obtained. The main advantage of the proposed GOSCA CFAR detector over the GOS CFAR detector is to reduce a computational time which is critical factor for the real time operation. We also derive unified formulas of the GOSCA CFAR detector under the noncoherent integration scheme. For Swerling target cases, performances of various CFAR detectors implemented using the GOSCA CFAR detector are derived and compared in homogeneous environment, and in the case of multiple targets and clutter edges situations.