John P. Fonseka

Capacity of correlated nakagami-m fading channels with diversity combining techniques

We derive closed-form expressions for the capacity of dual-branch maximal ratio combining, equal gain combining, selection combining, and switch and stay combining (SSC) diversity systems over correlated Nakagami-m fading channels. Because the final capacity expressions contain infinite series, we truncate the series and present upper bounds on the truncation errors. We also derive an expression that can be used to numerically determine the optimum adaptive switching threshold for the capacity of a dual-branch SSC system over correlated Nakagami-m fading channels. However, a closed-form expression for the optimum adaptive switching threshold is derived for the case of independent branches. The corresponding expressions for Rayleigh fading are obtained as a special case of Nakagami-m fading. Finally, numerical examples are presented for illustration.

On the channel capacity in Rician and Hoyt fading environments with MRC diversity

Expressions for the capacity of Rician and Hoyt (Nakagami-q) fading channels with maximal ratio combining diversity are available in the literature in the form of an infinite series. We derive lower and upper bounds on the errors resulting from truncating the infinite series in those capacity expressions. We also present numerical examples for illustration purposes.

Hierarchical self-healing rings

Traffic restoration in case of a failure in a circuit-switched telecommunications network involves finding alternate paths for all working paths that are severed by the failure, and rerouting affected traffic on these alternate paths. A new hierarchical self-healing ring (HSHR) architecture for circuit-switched networks is proposed and the design of HSHR networks is considered. A general cost model incorporating both the installation cost and the material cost is used. It is shown that the enumeration method, which finds the optimum configuration of HSHR, can only be used for small networks due to the complexity. Heuristic algorithms to find near-optimum HSHR configurations are presented. The routing and dimensioning of HSHR are also considered. Dimensioning of an HSHR is transformed into dimensioning of single self-healing rings inside the HSHR. Numerical results show that the performance of the heuristic is satisfactory.

Optimal binary communication with nonequal probabilities

Optimal signal energies are derived for optimal binary digital communication systems with arbitrary signal probabilities and correlation with both coherent and noncoherent detection. The resulting bit-error probability (BEP) is computed and compared with the BEP of the same systems with equal signal energies. One of the conclusions is that for the coherent system with nonnegative correlation, and for the noncoherent system with arbitrary correlation, the optimal signals are on-off keying (OOK), i.e., the signal with probability p/spl les/0.5 has energy E/p, while the second signal has zero energy, where E is the average signal energy. The proposed system is also better than a system with source coding and equiprobable signals.

Nonlinear continuous phase frequency shift keying

A novel signal-space coded CPM (continuous phase modulated) signaling technique, called nonlinear CPFSK (continuous phase frequency shift keying) signaling, which guarantees the maximum constraint length allowed by the number of states is introduced. Nonlinear CPFSK signals use a suitably selected state transition matrix during all signaling intervals. The selected state transition matrix is realized by changing the modulation index of the signals, hence the modulation index used during any interval depends on the transmitted symbol as well as on the state of the system. Binary nonlinear CPFSK signaling schemes are constructed and analyzed. Numerical results indicate that nonlinear CPFSK signals can achieve attractive minimum distances compared with other existing CPM signaling formats. >

Soft-decision phase detection with Viterbi decoding for CPM signals

It is known that continuous phase modulation (CPM) signals can be optimally detected by using coherent demodulation followed by Viterbi decoding. However, such a receiver is generally complicated, particularly at higher numbers of states, as it requires many correlators and many reference signals in the demodulator. In this study, a much simpler receiver, which employs a soft-decision phase detector followed by a Viterbi decoder, is proposed for the detection of CPM signals. The phase detector makes a decision in favor of one of the preselected phase subregions at the end of every interval, which is then used to calculate metrics for decoding. As in optimal detection, the Viterbi decoder decodes according to the trellis structure of CPM signals. The proposed receiver is analyzed in a narrow-band Gaussian channel with 2REC, 2-h, and trellis-coded continuous-phase frequency-shift keying signals. Numerical results show that the proposed receiver performs close to optimal detection with all types of signals considered in this study. The effect of the number of subregions in the phase detector is examined.

Channel capacity of dual-branch diversity systems over correlated Nakagami-m fading with channel inversion and fixed rate transmission scheme

Closed-form expressions are derived for the channel capacity of dual-branch maximal ratio combining, equal gain combining, selection combining, and switch and stay combining (SSC) diversity systems over correlated Nakagami-m fading for the channel inversion with fixed rate transmission scheme. Since some of the final capacity expressions contain infinite series, the series are truncated and upper bounds on the truncation errors are presented. An expression is also derived that can be used to numerically determine the optimum adaptive switching threshold for the capacity of a dual-branch SSC system over correlated Nakagami-m fading channels. A closed-form expression for the optimum adaptive switching threshold is derived, however, for the case of independent branches. The corresponding expressions for Rayleigh fading are obtained as a special case of Nakagami-m fading. Finally, numerical results are presented, which are then compared to the capacity results that the authors previously obtained for the rate adaptation with constant power transmission scheme.

Combined coded/multi-h CPFSK signaling

A continuous-phase frequency-shift-keying (CPFSK) signaling technique is suggested that combines convolutional encoding and multi-h signaling. In contrast to regular multi-h signaling, this technique changes the modulation index in a preselected pattern in order to maximize the minimum Euclidean distance. A rate-1/2 convolutional encoder along with a 2-h quaternary CPFSK modulator which uses two fixed modulation indexes is considered. Minimum Euclidean distances are calculated corresponding to the best encoder/mapper combinations for different modulation index patterns at attractive pairs of modulation indexes. Numerical results obtained for encoder memory lengths of one and two are used to illustrate that the minimum Euclidean distance of coded CPFSK signals can be significantly increased by combining with multi-h signaling. Modulation index patterns which perform significantly better than regular multi-h signals are determined. An error event analysis over the additive-white-Gaussian noise channel is carried out to investigate the actual error rate performance and to verify the theoretical results. >

Design of hierarchical self-healing ring networks

The design of hierarchical self-healing ring (HSHR) networks is considered. It is shown that the enumeration method, which finds the optimal configuration of HSHR at any given number of levels and given number of nodes on its single self-healing rings, minimizing total capacity required, can only be used for small networks due to the complexity. A heuristic algorithm to solve the near-optimal topology construction in HSHR networks is proposed. Numerical results show that the performance of the heuristic is satisfactory.<<ETX>>

Constrained Interleaving of Turbo Product Codes

Constrained interleaving is presented to improve the performance of turbo product codes. Traditional row/column interleaving achieves the highest possible minimum distance while ignoring the error coefficients, whereas uniform interleaving focuses on reducing the error coefficients while ignoring the minimum distance. Constrained interleaving achieves the highest possible minimum distance thereby forcing error coefficients of all contributions below the highest achievable minimum distance to zero while simultaneously lowering the error coefficients of the remaining contributions close to those of uniform interleaving. We present a lower bound for the error rate with constrained interleaving, and demonstrate using 2D and 3D SPC codes that the bound can be approached reasonably well with a constrained interleaver that is only 2 to 3 times the size of a row/column interleaver. Constrained interleaving performs better than row/column interleaving and the improvement becomes more significant with increasing order of SPC. While uniform interleaving typically uses large interleaver sizes and creates an undesirable error floor, constrained interleaving performs better at much shorter interleaver sizes and eliminates the error floor.