In cellular systems, autonomous reuse partitioning (ARP) is one of the channel assignment strategy which attains the high spectral efficiency. In the strategy, the movement of mobile stations (MSs) causes the disturbance of reuse partition. Furthermore the smaller cell size causes the spectral efficiency worse. In this paper, we propose a new ARP strategy with reuse partitioning reconstructing, named RP-reconstructing ARP strategy, for microcellular systems. We evaluate the performance of the proposed strategy with blocking rate and forced call termination rate by the computer simulation. The results show that the system with the proposed strategy accommodates 1.5 times as many users as the system with ARP does.

The proliferation and development of cellular voice systems over the past several years has exposed the capabilities and the effectiveness of wireless communications and, thus, has paved the way for wide-area wireless data applications as well. The demand for such applications is currently experiencing a significant increase and, therefore, there is a strong call for advanced and efficient mobile data technologies. This article deals with these mobile data technologies and aims to exhibit their potential. It provides a thorough survey of the most important mobile packet data services and technologies, including MOBITEX, CDPD, ARDIS, and the emerging GPRS. For each technology, the article outlines its main technical characteristics, discusses its architectural aspects, and explains the medium access protocol, the services provided, and the mobile routing scheme.

The outage probability of a forward link DS-CDMA cellular system with fast transmit power control (TPC) based on signal-to-interference ratio (SIR) is investigated. The expression for SIR at the output of RAKE receiver is developed, and the outage probability is evaluated by using Monte Carlo simulation. We consider two kinds of channel models: random delay resolvable path model and tapped delay line model which are suitable models for a few distinct paths channel and highly frequency-selective-channel model, respectively. The outage probability of a system with fast TPC based on SIR is compared to that without fast TPC. The use of orthogonal spreading codes is compared to that of the random spreading codes in terms of outage probability. The effects of the maximum and minimum transmit powers and the dispersive loss of signal power on the outage probability are also investigated.

This paper describes the effects of traffic distributions on uplink and downlink communications qualities in CDMA cellular systems. Many researches have been done from the viewpoint of the system capacity under ideal conditions in both uplink and downlink. However, there are few studies regarding traffic distributions that concurrently affect the uplink and downlink quality. The characteristics in both links are different even in a spatially uniform traffic distribution because the system structures are not symmetric between both links. When non-uniform radio environments are assumed, both link qualities become very different from each other. It is therefore important to design systems in consideration of link-specific characteristics in whole service area. This paper clarifies the difference in both link characteristics in CDMA systems regarding traffic distributions.

Future cellular communication systems will be called upon to provide multimedia services (voice, data, and video) for various user platforms (pedestrians, cars, and trains) that have a variety of mobility characteristics. Knowledge of mobility characteristics is essential for planning, designing and operating communication networks. The position data of selected vehicles (taxis) have been measured by using the Global Positioning System at 1-s intervals. Those data are used for evaluating mobility characteristics, such as probabilistic distributions of speed, cell dwell time, and cell crossover rate of vehicles, assuming that cells are hypothetically laid over the loci of the vehicles. The cell dwell time of vehicles is found to follow a lognormal distribution, rather than a conventionally-presumed negative exponential distribution. When the holding time distribution and random origination of calls along the loci are assumed, the properties of the cell dwell time and the handoff rate of terminals communicating in the hypothetical cellular systems are also estimated from the measured data.

Dynamical theory of cellular automata on groups is developed. Main results are non-Euclidean extensions of Sato and Honda's results on the dynamics of Euclidean cellular automata. The notion of the period of a configuration is redefined in a more group theoretical way. The notion of a co-finite configuration substitutes the notion of a periodic configuration, where the new term is given to it to reflect and emphasize the importance of finiteness involved. With these extended or substituted notions, the relations among period preservablity, injectivity, and Poisson stability of parallel maps are established. Residually finite groups are shown to give a nice topological property that co-finite configurations are dense in the configuration space.

We propose and analyze a traffic model of a cellular radio communication network with an arbitrary cell connection and arbitrary probabilistic movement of mobiles between the cells. Our analytic model consists of birth-and-death processes for individual cells connected by the numerical adjustment of hand-off rates. This approximation is validated by simulation. We evaluate the probabilities of the immediate loss, the completion, and the forced termination during hand-off for an arbitrary call in the network. Our numerical examples reveal the cases in which the increase in the generation rate of new calls results in the increase in the loss probability without affecting much the probability of forced termination in a limited service area.

The robustness of a template set for cellular neural networks (CNNs) is crucial for applications of VLSI CNN chips. Whereas the problem of designing any, possibly very sensitive, templates for a given task is fairly easy to solve, it is computationally expensive to find optimal solutions. For the class of bipolar CNNs, we propose an analytical approach to derive the optimally robust template set from any correctly operating template. Furthermore, our method yields a theoretical upper bound for the robustness of the CNN task.

One effective way to make a large-capacity mobile communication system is to use a microcellular system. One way to do this is to place the base station antennas lower than the surrounding buildings. This result in what is called a street microcellular system. We previously presented basic simulation results evaluating the performance of a different-sized cell combination algorithm (DCC) designed to avoid the problems due to an unbalanced distribution of traffic in street microcellular systems. In this paper, we present the results of simulations evaluating the performance of an improved active different-sized cell combination method (ADCC) that controls the transmission power of each base station.

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.

Future cellular systems are envisioned to support mixed traffic, and ultimately multimedia services. However, a mixture of voice and data requires novel service mechanisms that can guarantee quality of service. In order to transfer high-speed data, multislot channel allocation is seen as a favoured solution to the present systems with the least compromise to circuit- switched services. This paper evaluates the performance of narrowband voice calls and multislot data packet transmission in such integrated systems by using a matrix-analytic approach. This method achieves quadratic convergence compared to the conventional spectral methods. Mobility is also considered in a prioritized cellular environment where frequent handoff has the potential of degrading data performance. The voice call distribution, data packets throughput, delay and waiting time distribution are derived. Moreover, a new multiple priority-based distributed control algorithm and a voice rate control scheme are enforced to mitigate the queuing congestion of data packets. The numerical results derived from this study show that larger data packets incur longer latency and the use of these flexible schemes can improve the overall performance.

This paper develops a deterministic model for evaluating the influence of building windows upon the outdoor-to-indoor propagation path in cellular systems. This prediction model is based on the Aperture-field method of Huygens-Fresnel wave theory. Penetration losses and indoor signal characteristics are analyzed. It is found that the window frames of the building play an important role in determining the indoor field intensities. In order to verify this model's accuracy, numerical results are compared with measurement values. The calculations agree well with the measurements.

Template learning has potential application in several areas of Cellular Neural Network research, including texture recognition, pattern detection and so on. In this letter, a recently-developed algorithm called Adaptive Simulated Annealing is investigated for learning CNN templates, as a superior alternative to the Genetic Algorithm.

A novel family of keystream generators is proposed employing a linear cellular automata over GF (q) with time-varying transition rule. The analysis indicates that the generator, which is the general member of the family, reaches standard minimal security conditions (large period and good statistical properties) and that it is secure against all known attacks. An important feature of the proposed generators is that they are compact and suitable for high speed applications.

This paper proposes a novel one-way hash function that can serve as a tool in achieving authenticity and data integrity. The one-way hash function can be viewed as a representative of a family of fast dedicated one-way hash functions whose construction is based on linear cellular automata over GF(a). The design and analysis of security of the function is accomplished by the use of very recently published results on cellular automata and their applications in cryptography. The analysis indicates that the one-way hash function is secure against all known attacks. A promising property of the proposed one-way hash function is that it is especially suitable for compact and fast implementation.

We propose an architectural reference of programmable devices that we call Plastic Cell Architecture (PCA). PCA is a reference for implementing a device with autonomous reconfigurability, which we also introduce in this paper. This reconfigurability is a further step toward new reconfigurable computing, which introduces variable- and programmable-grained parallelism to wired logic computing. This computing follows the Object-Oriented paradigm: it regards configured circuits as objects. These objects will be described in a new hardware description language dealing with the semantics of dynamic module instantiation. PCA is the fusion of SRAM-based FPGAs and cellular automata (CA), where the CA are dedicated to support run time activities of objects. This paper mainly focus on autonomous reconfigurability and PCA. The following discussions examine a research direction towards general-purpose reconfigurable computing.

A communication system which attains an efficient amalgamation of base station (BS) type cellular communication and non-BS type direct communication for mobile terminals (MTs), "cellularad-hoc united communication system," is proposed. In this system, whether a cellular system or an ad-hoc communication system is chosen by distance and whether the condition is good or not between communicating MTs. In other words, when two terminals are relatively near each other and are in sufficient conditions to communicate directly, they select the ad-hoc communication, while for other cases they use the cellular system. The proposed system was confirmed to have effective channel usage and low battery consumption from the simulation results. It can be also said that this system is suited especially for MTs which tend to communicate with closer partners such as operational mobile robots and autonomous carrier vehicles.

One-dimensional Cellular Automata (CA's) are considered as potential pseudorandom pattern generators to generate highly random parallel patterns with simple hardware configurations. A class of linear, binary, and of nearest neighbor (radius = 1) CA's is referred to here as elementary ones. This paper investigates operations of such CA's with fixed boundary conditions when non-null boundary values are applied to them. By modifying transition matrices of elementary CA's to include the influence of boundary values, structures of state transition diagrams are determined.

A simple digital circuit based on the probabilistic cellular automata is proposed whose temporal evolution generates 1/f noise over many frequency decades. The N cells with internal states form a one-dimensional network and probabilistically interact with nearest-neighbor ones. The internal state of the cell is either the stable state or the unstable state. Each cell obeys simple rules as follows. When the excitatory signal is applied to the cell in the stable state, the state changes to the unstable state. On the other hand, when the state is unstable, the state changes to the stable state, and then the cell generates the excitatory signal. The excitatory signal is applied to the cell which is randomly chosen between the right side cell and the left side cell. The edge condition of the network is open, so that the excitatory signal can leave both the first edge and the last edge. The excitatory signal is randomly added to the first edge of the network at intervals of T time. Then the sequential interactions may occur like avalanche breakdown. After the interactions, the network goes to the equilibrium state. Considering that the breakdown happen simultaneously and assigning the stable state and the unstable state to 0 and 1, respectively, one can get the random pulse stream on the internal state of each cell. The power spectra of pulse streams are Lorentzian with various pole frequencies. The probability distribution of the pole frequency is inversely proportional to the frequency, i. e. , obeys Zipf law. Then the total sum of the internal states of all cells fluctuates following 1/f power law. The frequency range following 1/f power law can be easily varied by changing the number of the cells for the summation. A prototype generator using 15 cells generates 1/f noise over 3 frequency decades. This simple circuit is composed of only full adders and needs not complex components such as multipliers. Fine-tuning of any parameters and precise components also are not needed. Therefore integration into one chip using standard CMOS process is easy.

In this paper, we propose a novel power distribution method which can be adopted in case of the nonuniform distribution for mobiles in DS/CDMA distributed power cellular system. DS/SS distributed power cellular system has been proposed for achieving RAKE reception in micro-cellular environment. In forward link of this system, optimum power distribution method which can minimize the required total transmitting power has been discussed. The performance of this system has been shown in case of the uniform distribution for mobiles. In this paper, first, we propose a novel method in case of the nonuniform distribution. In the proposed method, replacing the path and its combinations of signals from base stations successively, we can find a new condition of less power distribution which is passed over in a conventional distribution method. We adopt simple distribution models for mobiles and compare the proposed method with the other methods by computing the total transmitting power and the quantity of calculations. As a result, we show that it is possible to almost obtain optimum power distribution by using the proposed method. Next, we adopt a nonuniform distribution model, in which the difference of the number of users exists only in the center cell. Using this model, we compare the proposed method with the other methods by computing the total transmitting power, the quantity of calculations, and a probability of impossible power distribution. Finally, in order to simplify and decrease the quantity of calculations of the proposed method, we propose a modified calculation algorithm which is applicable in case of that a new mobile station has increased. And we show the performance of this algorithm.