When using a conventional demodulator, a sufficient condition to maintain ODS-CDMA codeword orthogonality is constant relative channel amplitude over the codeword duration. When transmitted over a memoryless, AM/PM nonlinearity channel, the chip-to-chip fluctuating amplitude of a composite ODS-CDMA QPSK waveform produces a chip-to-chip fluctuating phase that deorthogonalizes the ODS-CDMA codewords, resulting in an additional multiple access self-interference similar to that found in asynchronous DS-CDMA. For ODS-CDMA QPSK in an AM/PM nonlinearity channel, we utilize the Central Limit Theorem, derive, and evaluate: (i) an expression for the signal-to-distortion ratio at the demodulator output, (ii) an expression for the uncoded bit error probability, and (iii) an upper bound on the convolutionally-coded bit error probability. We find that the degradation to BER depends on both the AM/PM nonlinearity slope and the ODS-CDMA channel loading. 相似文献
To cope with the high rate of increase of power demand in the main industrialized districts in Japan, 550-kV transmission systems covering the districts have been reinforced, with most of the main power plants connected directly to these systems. Through 550-/300-kV substations, the majority of power to the districts is supplied by 300-kV systems. To limit the excess short-circuit capacity in the 300-kV systems, they tend to be reconstructed as so-called radial networks. In radial networks with high short-circuit capacity and relatively small number of transmission lines connected to the substation busbars, the rate of rise of TRV can be far higher than standard value. This paper analyzes the transient recovery voltages (TRV) in such extra-high-voltage radial networks in Japan, together with the relevant stresses to circuit-breakers during fault clearings. Future system conditions have also been introduced. As the typical rate of rise of the TRV values, more than twice that of today's standard ones are probable. 相似文献
This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.
A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system. 相似文献