Previously, the interleavers is generated randomly for users of Interleave Division Multiple Access (IDMA) systems. Therefore, transmitting the entire chip-level interleaver matrix or power interleaver generation is required, which either adds redundancy or increases delay. In this paper, we propose to use deterministic chip-level interleavers for multiple users of IDMA systems. These chip-leve...

Among stability issues, the damping of electromechanical oscillations has been recognized as an important issue in electrical power system operation. This paper investigates the ability of Genetic Algorithm (GA) to design power system stabilizer (PSS) to damp the inter area oscillation. For this the parameter of the PSS are determined by GA using a phased-based objective function. The numerical...

Channel estimation techniques for code-division multiple access (CDMA) systems need to combat multiple access interference (MAI) effectively. Most existing estimation techniques are designed for CDMA systems with short repetitive spreading codes. However, current and next-generation wireless systems use long spreading codes whose periods are much larger than the symbol duration. In this paper, ...

A Power System Stabilizer (PSS) is the most cost effective approach of increase the system positive damping, improve the steady-state stability margin, and suppress the low-frequency oscillation of the power system. A PSS has to perform well under operating point variations. Some of the major issues in the application of PSS are the choice of the input signal, the location of the PSS, the contr...

The performance of a Turbo code can be severely degraded if no trellis termination is employed. This paper investigates the implications of the choice of trellis termination method for Turbo codes, and explains the origin of the performance degradation often experienced without trellis termination. An efficient method to derive the distance spectrum of Turbo codes for different trellis terminat...

New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding — which concern the traditional linear code objective of minimizing average codeword length — these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman co...

A hybrid pulse interval modulation code-division multiple-access (hPIM-CDMA) scheme employing the strict optical orthogonal code (SOCC) with unity and autoand cross-correlation constraints for indoor optical wireless communications is proposed. In this paper, we analyse the symbol error rate (SER) and bit error rate (BER) of hPIM-CDMA. In the analysis, we consider multiple access interference (...

Reliable communication is a challenge in a very noisy RF channel further corrupted by severe, multiple narrowband interference. Code Division Multiple Access (CDMA) is a widely used method to both mitigate such interference and support multiple in-band users. The ability to time-control multiple receptions at a receiver permits use of deterministically orthogonal codes. Achieving full capacity ...

Quantized frame expansions based on block transforms and oversampled filter banks (OFBs) have been considered recently as joint source-channel codes (JSCCs) for erasure and error-resilient signal transmission over noisy channels. In this paper, we consider a coding chain involving an OFB-based signal decomposition followed by scalar quantization and a variable-length code (VLC) or a fixed-lengt...

It is shown that for four-transmitter systems, a family of four-by-four unit-rate complex quasi-orthogonal space–time block codes, where each entry equals a symbol variable up to a change of sign and/or complex conjugation, can be generated from any two independent codes via elementary operations. The two independent groups of codes in the family generally have different properties of diversity...