Limiter-discriminator detection of a coherent optical heterodyneM-ary CPFSK receiver

The performance of a coherent optical M-ary continuous-phase frequency-shift-keying (CPFSK) receiver using limiter-discriminator (L-D) detection is investigated. It is shown that L-D detection of CPFSK optical signals offers the best performance for a large normalized IF beat spectral linewidth, ΔνT. When the modulation index is unity, the receiver is immune to laser phase noise and can produce (M/4) exp (-SNR) symbol error probability, which may be considered as the upper bound if the optimal modulation index is used (SNR is the signal-to-noise ratio per symbol). Optimum modulation indexes are 0.8 and 1 at ΔνT=1% and ΔνT=2%, respectively, for M=4, 8, and 16     

M-ary frequency shift keying withlimiter-discriminator-integrator detector in satellite mobile channelwith narrowband receiver filter

An expression is derived for the error probability of M-ary frequency shift keying with a limiter-discriminator-integrator detector and a narrowband receiver filter in the satellite mobile channel. This channel contains, as special cases, the Gaussian and Rayleigh (land mobile) channels. The error probability is computed as a function of various system parameters for M=2, 4, 8 symbols and a third-order Butterworth receiver filter     

On linear structure and phase rotation invariant properties ofblock M-PSK modulation codes

Two important structural properties of block M(=2^' )-ary PSK modulation codes, linear structure and phase symmetry, are investigated. An M-ary modulation code is first represented as a code with symbols from the integer group S_M-PSK=(0,1,2,---,M-1) under modulo-M addition. Then the linear structure of block M-PSK modulation codes over S_M-PSK with respect to modulo- M vector addition is defined, and conditions are derived under which a block M-PSK modulation code is linear. Once the linear structure is developed, the phase symmetry of block M-PSK modulation codes is studied. In particular, a necessary and sufficient condition for a block M-PSK modulation code that is linear as a binary code to be invariant under 2^h/180°M phase rotation, for 1⩽h⩽l is derived. Finally, a list of short 8-PSK and 16-PSK modulation codes is given, together with their linear structure and the smallest phase rotation for which a code is invariant     

Asymptotic performance of M-ary orthogonal signals inworst case partial-band interference and Rayleigh fading

It is shown that for worst-case partial-band jamming, the error probability performance (for fixed E_b/N_I) becomes worse with increasing M for (M>16). The asymptotic probability-of-error is not zero for any E_b/N _I(>ln 2), but decreases inverse linearly with respect to it. In the fading case, the error-probability performance (for fixed E_b/N₀) improves with M for noncoherent detection, but worsens with M for coherent detection. For large E_b/N₀ the performance of the Rayleigh fading channel asymptotically approaches the same limit as the worst case partial-band jammed channel. However, for values of M at least up to 4096, the partial-band jammed channel does better. While it is unlikely that an M-ary orthogonal signal set with M>1024 will be used in a practical situation, these results suggest an important theoretical problem; namely, what signal set achieves reliable communication     

Rotationally invariant trellis-coded modulations withmultidimensional M-PSK

Using a multidimensional approach, the author discovers a large family of rotationally invariant trellis-coded M-PSK (M-ary shift keying) schemes, M⩾8, with nominal coding gains ranging from 3 to 5 dB and with bandwidth requirements the same as, or even less than, those of uncoded M/2-PSK schemes at the same information bit rate. The rotationally invariant schemes have performance and complexities comparable to the best known nonrotationally-invariant trellis-coded two-dimensional M-PSK schemes. Computer simulation results for these schemes, assuming an additive white-Gaussian-noise (AWGN) channel, are reported     

Offset DPSK with differential phase detector in satellite mobilechannel with narrow-band receiver filter

An expression is derived for the error probability of M-ary offset differential phase-shift keying (DPSK) with the differential phase detector and narrowband receiver filter in the satellite mobile (Rician) channel, which includes as special cases the Gaussian and land mobile (Rayleigh) channels. The error probability is computed as a function of various system parameters for M=2, 4, and 8 symbols and third-order Butterworth receiver filter. Both symmetric and conventional DPSK systems are considered. The optimal normalized bandwidth is close to 1.0. Symmetric and conventional DPSK differ significantly in error probability only for M=2 and in the lower range filter bandwidth. In most cases, symmetric DPSK outperforms conventional DPSK. This was particularly noted when the time delay between the specular and diffused signal components was taken into account     

M×N Booth encoded multiplier generatorusing optimized Wallace trees

The architecture of a design method for an M-bit by N -bit Booth encoded parallel multiplier generator are discussed. An algorithm for reducing the delay inside the branches of the Wallace tree section is explained. The final step of adding two N±M-1-bit numbers is done by an optimal carry select adder stage. The algorithm for optimal partitioning of the N ±M-1-bit adder is also presented     

Error-correcting codes and nonlinear diversity combining againstworst case partial-band noise jamming of frequency-hopping MFSK systems

Error probability analyses are performed for a coded M-ary frequency-shift keying system (MFSK) using L hops per M-ary word frequency-hopping spread-spectrum waveforms transmitted over a partial-band Gaussian noise jamming channel. The bit error probabilities are obtained for a square-law adaptive gain control receiver with forward-error-control coding under conditions of worst-case partial-band noise jamming. Both thermal noise and jamming noise are included in the analyses. Performance curves are obtained for both block codes and convolutional codes with both binary and M-ary channel modulations. The results show that thermal noise cannot be neglected in the analysis if correct determinations of the optimum order of diversity and the worst-case jamming fraction are to be obtained. It is shown that the combination of nonlinear combining, M -ary modulation, and forward-error-control coding is effective against worst-case partial-band noise jamming     

Packet error probabilities in frequency-hopped spread-spectrumpacket radio networks-memoryless frequency-hopping patterns considered

The packet error probability induced in a frequency-hopped spread-spectrum packet radio network is computed. The frequency spectrum is divided into q frequency bins. Each packet is exactly one codeword from an (M, L) Reed-Solomon code [M=number of codeword symbols (bytes); L=number of information symbols (bytes)]. Every user in the network sends each of the M bytes of his packet at a frequency chosen among the q frequencies with equal probability and independently of the frequencies chosen for other bytes (i.e., memoryless frequency-hopping patterns). Statistically independent frequency-hopping patterns correspond to different users in the network. Provided that K users have simultaneously transmitted their packets on the channel and a receiver has locked on to one of these K packets, the probability that this packet is not decoded correctly is evaluated. It is also shown that although memoryless frequency-hopping patterns are utilized, the byte errors at the receiver are not statistically independent; instead they exhibit a Markovian structure     

A differentially coherent receiver for minimum shift keying signal

The author extends to the case of minimum-shift-keying (MSK) modulation the differentially coherent reception theory established for phase-shift-keying modulation. A novel differentially coherent detector for MSK is thus derived. The receiver filter is equivalent to the cascade of a matched filter and an equalizer in order to suppress inherent intersymbol interference. It is shown that performance can be improved when the delay between signals, multiplied by the differential detector, is increased from one to M bit time intervals. This decreases the effect of noise correlation and, thus, the bit error probability. The bit error probability of the proposed receiver is calculated. It is found that almost all potential improvement due to the delay M is obtained with M=3     

M-ary orthogonal signaling in the presence of Doppler

The performance degradation of an M-ary orthogonal keying (MOK) system due to relative motion between its transmitter and receiver can be minimized by selecting good signaling sets. A formulation for evaluating good signaling sets, or code sets, is developed for Walsh function data modulations. A union bound performance measure which closely approximates the exact probability of a demodulation error, is devised to allow for convenient evaluation of Walsh function codesets. The best Walsh function codesets for codevectors up to length 10 and for M=2, 4, 8 and 16, found by exhaustive search, are presented, along with their performance. In addition, codesets based on error-correcting codes are presented, along with a performance bound expressed in terms of the code's minimum distance     

Performance analysis of RS-coded M-ary FSK forfrequency-hopping spread spectrum mobile radios

Decoding performance of Reed-Solomon (RS) coded M-ary FSK with noncoherent detection in a frequency-hopping spread spectrum mobile radio channel is theoretically analyzed. Exact formulas and an approximate one for evaluating word error rates (WERs) of error correction and error-and-erasure correction schemes on decoding the RS codes are derived. It is shown that with K symbol erasure and C symbol error detection, RS coded M-ary FSK achieves the equivalent diversity order of (K+1)(C+1)     

Bounds for abnormal binary codes with covering radius one

The normality of binary codes is studied. The minimum cardinality of a binary code of length n with covering radius R is denoted by K(n,R). It is assumed that C is an (n,M)R code, that is, a binary code of length n with M codewords and covering radius R. It is shown that if C is an (n,M)1 code, then it is easy to find a normal (n ,M)1 code by changing C in a suitable way, and that all the optimal (n,M)1 codes (i.e. those for which M=K(n,1)) are normal and their every coordinate is acceptable. It is shown that if C is an abnormal (n,M) code, then n⩾9, and an abnormal (9118)1 code which is the smallest abnormal code known at present, is constructed. Lower bounds on the minimum cardinality of a binary abnormal code of length n with covering radius 1 are derived, and it is shown that if an (n,M)1 code is abnormal, then M⩾96     

A nonsorting VLSI structure for implementing the (M, L) algorithm

A nonsorting structure for implementing the (M, L) algorithm is presented. The processing is based on a survivor selection operation that incorporates parallelism and has an execution time proportional to the product of the logarithm of bM (the number of contender paths), and k (the number of bits used for path metrics). Aside from the path extender(s), the processor area is only a small fraction of the total chip area; most is simply for required storage of path histories and metrics. This means that the structure can support a large M on a single chip. In addition, the structure can be extended to larger M by stacking rows of a few different types of custom chips     

Design and analysis of a contention-based lookahead reservationprotocol on a multichannel local area network

The contention-based lookahead reservation (CLAR) protocol can provide fast circuit-switching services that are particularly advantageous for networks supporting integrated services. The delay and throughput performance for message transmission are obtained, and they agree closely with that obtained by simulation. The delay performance of CLAR is similar to that of the M-CSMA protocol for an M-channel network, but only CLAR can give a stable maximum throughput of (M-1)/M independent of the cable length. Moreover, CLAR requires only two sets of transceivers, while M-CSMA requires M. The lookahead reservation technique can provide 9% throughput increase for fixed-size messages and 19% for geometrically distributed messages     

Error probability of digital modulation in satellite mobile, landmobile, and Gaussian channels with narrow-band receiver filter

It is shown how to derive formulas for the error probability for M-ary differential phase shift keying with differential phase detection (DPD) and M-ary frequency shift keying with DPD, limiter-discriminator detection and limiter-discriminator-integrator detection in the satellite mobile channel (SMC) with narrowband receiver filter if such formulas are available for the Gaussian channel. The modification of the formulas involves only a redefinition of the noise power and autocorrelation function. Since the SMC contains as special cases the land mobile (Rayleigh) channel and the Gaussian channel, the derived formulas are valid for these channels as well. In fact the formula for the land mobile channel is in many cases reduced to a closed form, which does not contain an integral. The author computes the error probability for the four systems, and compares their performance assuming a third-order butterworth filter and M=2,4,8 symbols     

Error performance of a digitally processed binary ESK frequencyhopping receiver in the presence of large Doppler

Analysis is made of the effects of Doppler on the error rate performance of a low data rate binary FSK frequency hopping receiver, employing a discrete Fourier transform (DFT) technique for baseband detection. Bit detection decision is made by locating the maximum of the DFT outputs which, in the frequency domain, are assumed to be separated by 1/T where T is the bit period. Both the worst case and average error performances are obtained and presented as a function of E_b/N₀ for various values of M where E_b/N₀ is the signal bit energy-to-noise density ratio and M is the degree of freedom associated with the Doppler uncertainty window. The E _b/N₀ degradation as a function of M is also presented     

Coherent detection of M-ary phase-shift keying in thesatellite mobile channel with tone calibration

A formula is derived for the error probability of M-ary phase-shift keying (PSK) in the satellite mobile channel when the signal is accompanied by a pilot tone which is used in the receiver for coherent detection of the signal. The author computes the error probability as a function of the signal-to-noise ratio, the ratio of powers in the specular and diffused signal component, the ratio of bandwidth in the pilot tone and signal extraction filters, and the numbers of symbols, i.e. M, while optimizing the ratio of powers in the pilot tone and signal. He computes results when the diffused component is not delayed with respect to the specular component, as well as for the opposite case, i.e. when the symbol in the diffused component is independent of the symbol in the main component     

Asymptotic performance of M-ary orthogonal modulation ingeneralized fading channels

The asymptotic (M→∞) probability of symbol error P_e,_m for M-ary orthogonal modulation in a Nakagami-m fading channel is given by the incomplete gamma function P(m, mx) where x=In 2/(E_b/N₀) and E_b is the average energy per bit. For large signal-to-noise ratio this leads to a channel where the probability of symbol error varies as the inverse mth power of E_b/N₀. These channels exist for all m⩾1/2. The special case of m=1 corresponds to Rayleigh fading, an inverse linear channel