We analyze the effect of overlapping technique on differential pulse position modulation (DPPM) in optical direct-detection channel when the pulsewidth and the average power of the channel are constrained. We refer to the modulation scheme employing an overlapping technique in DPPM as differential overlapping PPM (DOPPM). To avoid frame synchronization problems, we analyze the performance of DOPPM under the window scheme that results in lower bounds on the capacity and the cutoff rate of DOPPM but is easy to analyze. Under this scheme, we analyze the lower bounds on the capacity and the cutoff rate of DOPPM. It is shown that DOPPM with the window scheme has higher capacity and cutoff rate than PPM and DPPM, and also than OPPM when the average received number of photons per slot is somewhat large. The overlapping technique is thus shown to be effective on DPPM under the pulsewidth constraint when the average received number of photons per slot is somewhat large.

Lexical-functional grammars (lfg's) were introduced to define the syntax of natural languages. In lfg's, a finite set of attribute-value pairs called an f-structure is associated with each internal node in a derivation tree. For efficient parsing, some subclasses of lfg's were proposed. However, these subclasses have been shown to generate at least one -complete language. In this paper, we introduce a subclass of lfg's called pd-lfg's. In pd-lfg's, an f-structure forms a pushdown stack. For a node v in a derivation tree and at most one specified child vi of v, the f-structure of vi is obtained by performing a specified pushdown stack operation on the f-structure of v. We prove the equivalence of the generative capacity of modified head grammars (mhg's) and that of pd-lfg's. Since the languages generated by mhg's are known to be recognizable in O(n6) time, the languages generated by pd-lfg's can be recognized in O(n6) time.

Optical WDM (Wavelength Division Multiplexing) technology is a method of exploiting the huge bandwidth of optical fibers. Local lightwave networks which use fixed wavelength transmitters and receivers can be built in a multihop fashion. In multihop local lightwave networks, packets arrive at their destination by hopping a number of intermediate nodes. The channel sharing schemes for multihop lightwave networks have been proposed for efficient channel utilization, but those schemes result in the degradation of network capacity and the user throughput. In this paper, we propose an improved WDM channel sharing scheme using the logically bidirectional perfect shuffle interconnection pattern, achieving smaller number of average hops for transmission and better channel utilization efficiency. Better channel utilization efficiency is obtained without much deteriorating the network capacity and the user throughput. TDMA (Time Division Multiple Access) protocol can be used to control the sharing of channels, and time delay and lost packet probability analysis based on TDMA is performed.

Overlapping multi-pulse pulse position modulation (OMPPM) is a modulation scheme having higher capacity and cutoff rate than other conventional modulation schemes when both off-duration between pulses shorter than a laser pulsewidth and resolution better than a laser pulsewidth are realized [1],[2]. In Refs. [1],[2] erasure events of a few chips that can be decoded correctly is defined as an erasure event. This results in lower bounds on the performance of OMPPM in optical-direct-detection channel in quantum limited case. This paper analyzes more exact performance of OMPPM in optical direct-detection channel in quantum limited case when both off-duration between pulses shorter than a laser pulsewidth and resolution better than a laser pulsewidth are realized. First we derive the error probability of OMPPM with considering what chips are detected or erased. Then we derive the capacity and the cutoff rate of OMPPM using the error probability. It is shown that OMPPM outperforms on-off keying (OOK), pulse position modulation (PPM), multi-pulse PPM (MPPM), and overlapping PPM (OPPM) in terms of both capacity and cutoff rate for the same pulsewidth and the same duty cycle. Moreover, it is shown that OMPPM with fewer slots and more pulses per block has better cutoff rate performance when the average received power per slot is somewhat large.

Multilevel RLL (Runlength Limited) sequences are analyzed. Their noiseless capacity and lower bounds on the channel capacity in the presence of additive white Gaussian noise are given. Moreover, the analytical power spectra formulae for those sequences which generalize the previously derived one for binary sequences are newly derived. We conclude from the analysis of the power spectra that multilevel RLL sequences are attractive from the point of view that they increase information rate while keeping low DC-content and self-clocking capability of binary RLL sequences.

The Shannon-Hartley theorem for channel capacity presupposes signal transmission over time-invariant Gaussian channels. In a mobile radio environment, communications channels have randomly time-variant characteristics. In this paper, an expression for the average capacity of Rician fading channels is derived. It is shown that the average capacity of Rician channels is always lower than that of the Gaussian channel, while the Rayleigh channel capacity values represent the worst situation. In addition, the Rician channel capacity is examined when reception by a maximal-ratio combining technique with M-branches is employed, indicating its positive effect on channel average capacity when weak signal power or severe fading conditions are present. Finally, the relation between Rician and Rayleigh fading environment with respect to channel average capacity is discussed.

This paper studies the effect of frequency re-using patterns on the channel capacity in the forward link of orthogonal code division multiple access (CDMA) cellular systems. The received carrier-to-interference ratio (CIR) determined by computer simulation shows that re-using the same frequency channel on every third sector (3-sector layout) provides superior channel capacity than does every-sector re-use (1-sector layout).

The blocking probabilities of n64Kb/s multi-slot calls are generally much higher than that of single slot calls. In order to improve these blocking probabilities of multi-slot calls, we propose a scheme to limit the number of time slots to be searched for lower rate calls. We analyze the performance of our scheme in a double-buffered time-space-time switching network which accommodates multi-slot calls as well as single-slot calls. The proposed method yields the reduced blocking probabilities of multi-slot calls, the increased traffic handling capacity and the reduced CPU processing load, compared with those of the conventional methods.

This paper proposes a new subscriber distribution method called FTTA (Fiber To The Area), which uses millimeter-wave radio band to connect subscribers with base station and optical fiber to connect base station with control station in order to obtain broad-band transmission. Usually two main causes of signal degradation, i.e., rainfall attenuation on radio channel and intermodulation distortion on optical channel are considered in this system. Taking into considerations of these two factors, we analyze the available capacity of FTTA system for various 22nQAM modulation levels. The analysis clarifies that there exists an optimum modulation level that can maxize the available capacity, and AGC circuit in the base station is useful to compensate the rainfall attenuation. It is shown that 18.0Gbps is available under the optimum modulation method of the 64QAM with AGC and 12.0Gbps under the 16QAM without AGC when 20 carriers are used.

Corresponding to the development of B-ISDN, integrated services for data, voice, etc. are imperatively required for the so called third generation wireless communication networks. In this paper, I-ISMA (Idle Signal Multiple Access for Integrated services) is proposed to transmit integrated voice and data traffic from dispersed terminals to a base station. In the system, data packets and the first packets of talkspurts of conversational speeches are transmitted using ISMA protocol over a shared channel while subsequent packets of talkspurts are sent with time reservation technique. The channel capacity of I-ISMA is evaluated and compared with that of PRMA. The region in which I-ISMA has larger capacity than PRMA is figured out. Generally speaking, I-ISMA has larger capacity than PRMA when the duration for transmitting and detecting an idle signal is not too long and the channel is not too congested by the reserved voice transmissions. When we concern real time voice transmission, delay is one of the most important performance measures. Only is a qualitative discussion on delay performance given here. The quantitative evaluation is obtained by the dynamic analysis in our succeeding paper.

Four imperfections encountered in transmitter power control (TPC) for direct sequence code division multiple access (DS/CDMA) cellular mobile communications systems, faulty TPC, finite dynamic range, restricted site diversity, and non-uniform user distribution, are investigated where account is taken of the effect of the propagation constant on the traffic capacity. Computer simulation schemes for traffic capacity estimation under these TPC imperfections are presented. Traffic capacity estimates are produced for a representative DS/CDMA cellular mobile communications system.

It is concluded from numerical examples for the well-known linear PN sequence families of a large range of periods that the mean-square cross-correlation value between sequences is the dominating parameter to the average signal-to-noise power ratio performance of an asynchronous direct-sequence (DS) code-division multiple-access (CDMA) system. The performance parameters derived by Pursley and Sarwate are used for numerical evaluation and the validity of conclusion is supported by reviewing the other related works. The mean-square periodic cross-correlation takes the equal value p (code period) for the known CDMA code families. The equal mean-square cross-correlation performance results from the basic results of coding theory.

Algorithms for computing channel capacity have been proposed by many researchers. Recently, one of the authors proposed an efficient algorithm using Newton's method. Since this algorithm has local quadratic convergence, it is advantageous when we want to obtain a numerical solution with high accuracy. In this letter, it is shown that this algorithm can be extended to the algorithm for computing the constrained capacity, i.e., the capacity of discrete memoryless channels with linear constraints. The global convergence of the extended algorithm is proved, and its effectiveness is verified by numerical examples.

This paper addresses onboard processing architecture employing direct regeneration. The advantage of direct regeneration is its hardware simplicity, even though the bit error rate performance is slightly inferior to that of demodulation-remodulation scheme with coherent detection. The channel filtering schemes as well as achievable capacities are examined by computer simulation. It is found that the system with direct regeneration has advantage in channel capacity and transmit earth station e.i.r.p. for small earth stations. A possible configuration of direct regeneration onboard in future satellite systems is proposed.

We consider an asymptotically sparsely encoded associative memory. Patterns are encoded by n-dimensional vectors of 1 and 1 generated randomly by a sequence of biased Bernoulli trials and stored in the network according to Hebbian rule. Using a heuristic argument we derive the following capacities:c(n)ne/4k log n'C(n)ne/4k(1e)log n'where, 0e1 controls the degree of sparsity of the encoding scheme and k is a constant. Here c(n) is the capacity of the network such that any stored pattern is a fixed point with high probability, whereas C(n) is the capacity of the network such that all stored patterns are fixed points with high probability. The main contribution of this technical paper is a theoretical verification of the above results using the Poisson limit theorems of exchangeable events.

This paper analyzes the performance of the capacity controlled radio system under a frequency selective fading environment. This system controls the number of modulation levels according to the number of active subscribers. In the analysis, we consider the capacity controlled system either with or without adaptive equalizer. As the results of analysis, it is clarified that the system is superior to the conventional fixed capacity system, and can be considered as a good countermeasure for multi-path fading. And it is found that there exists a synergistic effect due to capacity controlling and adaptive equalizing.

Modeling and performance analysis have played an important role in the economical design and efficient operation of switching systems, and is currently becoming more important because the switching systems should handle a wide range of traffic characteristics, meeting the grade of service requirements of each traffic type. Without these techniques we could no longer achieve economy and efficiency of the switching systems in complex traffic characteristic environments. From the beginning of research on electronic switching systems offering circuit-switched applications, Stored Program Control (SPC) technology has posed challenges in the area of modeling and performance analysis as well as queueing structure, efficient scheduling, and overload control strategy design. Not only teletraffic engineers and performance analysts, but also queueing theorists have been attracted to this new field, and intensive research activities, both in theory and in practice, have continued over the past two decades, now evolving to even a broader technical field including traditional performance analysis. This article reviews a number of important issues that have been raised and solved, and whose solutions have been reflected in the design of SPC switching systems. It first discusses traffic problems for centralized control systems. It next discusses traffic problems inherent in distributed switching systems.

This paper presents an efficient algorithm for computing the capacity of discrete memoryless channels. The algorithm uses Newton's method which is known to be quadratically convergent. First, a system of nonlinear equations termed Kuhn-Tucker equations is formulated, which has the capacity as a solution. Then Newton's method is applied to the Kuhn-Tucker equations. Since Newton's method does not guarantee global convergence, a continuation method is also introduced. It is shown that the continuation method works well and the convergence of the Newton algorithm is guaranteed. By numerical examples, effectiveness of the algorithm is verified. Since the proposed algorithm has local quadratic convergence, it is advantageous when we want to obtain a numerical solution with high accuracy.

Lexical-Functional Grammars (LFG's) were introduced to define the syntax of natural languages. In LFG's, each node of a derivation tree has some attributes. An LFG G consists of a context-free grammar (cfg) G0 called the underlying cfg of G and a description Pfs of constraints between the values of the attributes. Pfs can specify (1) constraints between the value of an attribute of a node and those of its children, and (2) constraints between the value of an attribute of a node called a controller and that of a node called its controllee. RLFG's were introduced as a subclass of LFG's. In RLFG's, only constraints between the value of an attribute of a node and those of its children can be specified. It is shown in this paper that the class of languages generated by RLFG's is equal to the class of recursively enumerable languages. Some restrictions on LFG's were proposed for the purpose of efficient parsing. Among them are (1) the condition called a valid derivation, and (2) the condition that the underlying cfg is cycle-free. For an RLFG G, if the production rules of the underlying cfg of G are of the form AaB or Aa for nonterminal symbols A, B and a terminal symbol a, then G is called an R-RLFG. Every R-RLFG satisfies the above restriction (1) and (2). It is also shown in this paper that the class of languages generated by R-RLFG's contains an NP-hard language, which means that parsing in deterministic polynomial time of LFG's is impossible in general (unless PNP) even if the above restrictions (1) and (2) are satisfied.

User capacity of a DS/CDMA cellular mobile radio system employing transmitter power control (TPC) is investigated. Assuming log-normally distributed control error, outage probability is evaluated through computer simulations. The user capacity is dramatically decreased as the power control error increases. If the standard deviation is larger than about 2dB, the user capacity is decreased by more than 60%. It is shown that power control error with a standard deviation of less than or equal to 0.5dB is required to accommodate 90% of the maximum user capacity. The capacity decrease in the reverse and forward link channels due to non-uniform user distributions are also investigated. It is shown that if system users are densely distributed within the zone fringe whose thickness is 80% of the radius, the reverse link capacity is decreased by about 22%. The forward link capacity is comparatively insenstitive to non-uniform user distribution.