Electrical characterisation of Si-dopedGaAs0.5Sb0.5 on InP grown by molecular beamepitaxy

Between the growth temperatures of 490-520°C Si-doped GaAs_0.5Sb_0.5 changes from 1×10¹⁷ cm^-3 n-type to 2×10¹⁷ cm^-3 p-type. The scattering mechanisms of the n and p-type epilayers are investigated. The reproducibility and potential applications of the observed conduction type change are demonstrated by the fabrication of a pn diode     

Scaling `ballistic' heterojunction bipolar transistors

Reducing length scales in npn heterojunction bipolar transistors leads to unexpected changes in the fundamental limits of device performance. Very high p-type carrier concentrations in the base result in a reduced inelastic electron scattering rate. In addition, there exists a maximum base/collector bias above which ballistic collector transport is not possible, and correct scaling requires the n-type collector contact to be unusually heavily doped     

Error probability of M-ary FSK with differential phasedetection in satellite mobile channel

Formulas are derived for the error probability of M-ary frequency shift keying (FSK) with differential phase detection in a satellite mobile channel. The received signal in this channel is composed of a specular signal, a diffuse signal, and white Gaussian noise; hence, the composite signal is fading and has a Rician envelope. The error probability is shown to depend on the following system parameters: (1) the signal-to-noise ratio; (2) the ratio of powers in the specular and diffuse signal components; (3) the normalized frequency deviation; (4) the normalized Doppler frequency; (5) the maximum normalized Doppler frequency; (6) the correlation function of the diffuse component, which depends on the normalized Doppler frequency and the type of the antenna; (7) the number of symbols; and (8) the normalized time delay between the specular and diffuse component (t _d/T) where 1/T is the symbol rate. Except for T_d/T, all normalized parameters are the ratios of the parameter value and symbol rate. The Doppler frequency depends on the velocity of the vehicle and the carrier frequency. The error probability is computed as a function of the various parameters. The bit error probability is plotted as a function of signal-to-noise ratio per bit and other system parameters     

Lower bounds on the capacities of binary and ternary networksstoring sparse random vectors

It is shown that the memory capacity of networks of binary neurons storing, by the Hebbian rule, sparse random vectors over the field {0, 1}^N is at least c(N/p log N ), where c is a positive scalar involving input error probabilities probability of an element being nonzero. A similar bound is derived for networks of ternary neurons, storing sparse vectors over {-1,0,1}^N. These results, pertaining to stability and error correction with probability tending to one as the number of neurons tends to infinity, generalize and extend previously known capacity bounds for binary networks storing vectors of equally probable {±1} bits. Lower bounds on the capacities of binary and ternary networks of finite sizes are also derived. These bounds suggest critical network sizes that guarantee high gains in capacity per neuron for given sparsites     

A general decoding technique applicable to replicated filedisagreement location and concatenated code decoding

Code symbols are treated as vectors in an r-dimensional vector space F^r over a field F. Given any ( n, k) linear block code over F with minimum distance d, it is possible to derive an (n, k) code with symbols over F^r, also with minimum distance d, which can correct any pattern of d-2 or fewer symbol errors for which the symbol errors as vectors are linearly independent. This is about twice the bound on the number of errors guaranteed to be correctable. Furthermore, if the error vectors are linearly dependent and d-2 or fewer in number, the existence of dependence can always be detected. A decoding techinque is described for which complexity increases no greater than as n ³, for any choice of code. For the two applications considered, situations are described where the probability of the error patterns being linearly dependent decreases exponentially with r     

Chebyshev power-series solution of the cutoff frequencies in W-type single-mode fibers with an arbitrary core profile

A numerical method for calculating the cutoff frequencies in W -type single-mode fibers, which is based on the Chebyshev power-series approach, is discussed. It is shown that the method is fast and accurate, and can be applied to arbitrary-core-profile W-type fibers. Calculated results are presented to show the accuracy and convergence of the method. The method can be applied to discrete numerical data obtained from index profile measurements     

On the error probability of signals in additive white Gaussiannoise

A new upper bound to the probability of error in detecting one of M equally probable signals in additive white Gaussian noise is presented. This bound is easy to calculate, can be applied to any signal set. It is always better than the union and minimum distance bounds. Examples demonstrate the use of the bound     

Probability of bit error for MPSK modulation with diversityreception in Rayleigh fading and log-normal shadowing channel

In an additive white Gaussian noise channel subject to Rayleigh fading and log-normal shadowing, consideration is given to diversity reception with K-port macroscopic selection and L-branch microscopic maximal-ratio combining, and analytical expressions are derived for upper and lower bounds on the bit error probabilities for BPSK, QPSK, 8-PSK, and 16-PSK modulations. The derived expressions can be evaluated at any location in the serving cell. Error-probability can be calculated by averaging over all possible locations within the serving cell. By evaluating these bounds, numerical results for the following cases are presented: without diversity reception, microdiversity combining, macrodiversity selection, and simultaneous use of macrodiversity selection and microdiversity combining. For symmetrical arrangement of macrodiversity ports against the lognormal shadowing, error probability at the equidistant point gives upper bounds on the error probabilities for most of the area in the serving cell. Error probability at the equidistant point is a good estimate of the error probability obtained by averaging over all possible locations in the cell     

Optimization of signal sets for partial-response channels. I.Numerical techniques

Given a linear, time-invariant, discrete-time channel, the problem of constructing N input signals of finite length K that maximize minimum l₂ distance between pairs of outputs is considered. Two constraints on the input signals are considered: a power constraint on each of the N inputs (hard constraint) and an average power constraint over the entire set of inputs (soft constraint). The hard constraint, problem is equivalent to packing N points in an ellipsoid in min(K,N-1) dimensions to maximize the minimum Euclidean distance between pairs of points. Gradient-based numerical algorithms and a constructive technique based on dense lattices are used to find locally optimal solutions to the preceding signal design problems. Two numerical examples are shown for which the average spectrum of an optimized signal set resembles the water pouring spectrum that achieves Shannon capacity, assuming additive white Gaussian noise     

Comments on `GMSK with differential phase detection in thesatellite mobile channel'

The error probability results shown by I. Korn (see ibid., vol.38, no.11, p.1980-6, 1990) indicate that the error floor is higher for systems with decision feedback (DF). It was concluded that DF gives a lower error probability only for smaller values of the normalized bandwidth B_tT of the premodulation Gaussian filter, higher values of the ratio of powers in the direct and diffuse signal components K, and a lower range of signal-to-noise ratio. It is shown that this conclusion is not correct by theoretically analyzing the case of the land mobile channel where K=0 (or -∞ dB) and deriving a simple closed-form expression for the error probability for 1 bit differential detection with DF. It is shown that DF reduces the error probability for all values of B_tT and signal-to-noise ratios. The formula derived can be easily evaluated not only for Gaussian minimum shift keying (GMSK) but for all partial-response continuous-phase-modulation (PRCPM) signals     

On the error probability of coded frequency-hopped spread-spectrummultiple-access systems

A simple, exact calculation is presented of the probability distribution of the number of hits in a block of n symbols in a frequency-hopped, spread-spectrum, multiple-access communication system. While the sequence of hits is not Markovian, there is an underlying Markovian structure that allows the probability distribution of the number of hits to be calculated in a recursive fashion. Knowing the probability distribution of the number of hits makes it possible to calculate the probability of error for a system employing error correcting codes for several different types of receivers, including receivers with both errors and erasures. The numerical results show that both the approximation obtained by assuming the actual sequence of hits is Markovian and the approximation obtained by assuming the hits are independent are very good. When the number of frequency slots is not too small (less than five), calculations show that assuming the independence of hits gives an error probability accurate to within 1% of the actual error probability. Assuming the hits are Markovian gives error probabilities which are accurate to within 0.001%     

The throughput efficiency of the go-back-N ARQ schemeunder Markov and related error structures

A formula for the go-back-N ARQ (automatic repeat request) scheme applicable to Markov error patterns is derived. It is a generalization of the well-known efficiency formula p/[p +m(1-p)] (where m is the round trip delay in number of block durations and p is the block transmission success probability), and it has been successfully validated against simulation measurements. It is found that for a given error rate, error patterns having zero correlation between successive transmission generally fare better than those with negative correlation, and that error patterns with positive correlation fare better still. It is shown that the present analysis can be extended in a straightforward manner to cope with error patterns of a more complex nature. Simple procedures for numerical evaluation of efficiency under quite general error structures are presented     

Adaptive control for random access traffic in mobile radio systems

An adaptive random access control method is developed for the idle-signal-casting multiple-access (ICMA) or other random-access protocols. Its purpose is to prevent channel breakdown by controlling permission probabilities of user terminal's transmission according to the load of a random-access channel. In ICMA, a base station broadcasts an `idle' or `busy' signal to prevent collisions of random access signals from terminals. Two kinds of control parameters related to permission probabilities are used. Probability q is referred to by all user terminals attempting transmission, and probability p is referred to if a user terminal must wait for the end of another's transmission. The values of these parameters are determined according to the channel occupancy factor measured at a base station, and the base station broadcasts them to user terminals with `idle' or `busy' signals. This method can prevent channel breakdown and greatly improve channel performance under heavy-traffic conditions. Results of evaluating the method by computer simulation are discussed     

Sequential decoding based on an error criterion

An analysis of sequential decoding is presented that is based on the requirement that a set probability error P_e be achieved. The error criterion implies a bounded tree or trellis search region: the shape of this is calculated for the case of a binary symmetric channel with crossover probability P and random tree codes of rate R. Since the search region is finite at all combinations of p and R below capacity, there is no cutoff rate phenomenon for any P_e>0. The decoder delay (search depth), the path storage size, and the number of algorithm steps for several tree search methods are calculated. These include searches without backtracking and backtracking searches that are depth- and metric-first. The search depth of the non-backtracking decoders satisfies the Gallager reliability exponent for block codes. In average paths searched, the backtracking decoders are much more efficient, but all types require the same peak storage allocation. Comparisons are made to well-known algorithms     

Investigations into cochannel interference in microcellular mobileradio systems

A microcell interference model termed the Nakagami m_x/m_y model is introduced. The desired signal and the cochannel interferers are assumed to have Nakagami statistics but with different amounts of fading. A special case of this model is obtained when the desired signal has Nakagami statistics while the cochannel interferers are subject to Rayleigh fading. The probability density function of the signal-to-interference ratio in the Nakagami model is derived. This model is also compared with a Rician/Rayleigh microcellular model. Expressions for the outage probabilities in microcell systems are derived. Numerical results show that, compared to medium/large cell systems, the microcellular systems have a lower outage probability. The impact of diversity on the microcellular system is also studied. An improvement of the outage probability due to diversity is observed     

On multilevel block modulation codes

The multilevel technique for combining block coding and modulation is investigated. A general formulation is presented for multilevel modulation codes in terms of component codes with appropriate distance measures. A specific method for constructing multilevel block modulation codes with interdependency among component codes is proposed. Given a multilevel block modulation code C with no interdependency among the binary component codes, the proposed method gives a multilevel block modulation code C' that has the same rate as C, a minimum squared Euclidean distance not less than that of C, a trellis diagram with the same number of states as that of C, and a smaller number of nearest neighbor codewords than that of C . Finally, a technique is presented for analyzing the error performance of block modulation codes for an additive white Gaussian noise (AWGN) channel based on soft-decision maximum likelihood decoding. Error probabilities of some specific codes are evaluated by simulation and upper bounds based on their Euclidean weight distributions     

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     

A novel CMOS implementation of double-edge-triggered flip-flops

A CMOS implementation of a D-type double-edge-triggered flip-flop (DET-FF) is presented. A DET-FF changes its state at both the positive and the negative clock edge transitions. It has advantages with respect to both system speed and power dissipation. The design presented requires little overhead in circuit complexity. This CMOS D-type DET-FF is capable of operating at more than 50 MHz, which gives an equivalent system frequency of 100 MHz     

Trellis coding with multidimensional QAM signal sets

Trellis coding using multidimensional quadrature amplitude modulation (QAM) signal sets is investigated. Finite-size 2D signal sets are presented that have minimum average energy, are 90° rotationally symmetric, and have from 16 to 1024 points. The best trellis codes using the finite 16-QAM signal set with two, four, six, and eight dimensions are found by computer search (the multidimensional (multi-D) signal set is constructed from the 2-D signal set). The best moderate complexity trellis codes for infinite lattices with two, four six, and eight dimensions are also found. The minimum free squared Euclidean distance and number of nearest neighbors for these codes were used as the selection criteria. Many of the multi-D codes are fully rotationally invariant and give asymptotic coding gains up to 6.0 dB. From the infinite lattice codes, the best codes for transmitting J, J+1/4, J+1/3, J+1/2, J+2/3, and J+3/4 b/sym (J an integer) are presented     

Multi-H phase-coded modulations with asymmetric modulationindexes

Multi-H phase-coded modulation (MHPM) is a bandwidth-efficient modulation scheme which offers substantial coding gain over conventional digital modulation schemes. MHPM with asymmetric modulation indices corresponding to the bipolar data +1 and -1 is considered, and numerical results for the minimum Euclidean distances are provided. It is shown that performance improvements on the error probability over conventional MHPM are gained with essentially the same bandwidth and a very slight modification in implementation. The upper bounds on the error probabilities as functions of observation intervals and received E_b/N₀ are also investigated in detail. It is concluded that the concept of asymmetric modulation indices for MHPM is attractive for bandwidth and power-efficient modulation