By Topic

# IEE Proceedings - Communications

## Filter Results

Displaying Results 1 - 12 of 12

Publication Year: 1999, Page(s):138 - 143
| | PDF (484 KB)

The bit-error rate (BER) analysis of an asynchronous cellular direct-sequence code-division multiple-access (DS-CDMA) system with channel fading and random mobile locations often results in a multiintegral expression, even though the Gaussian approximation is applied. In the paper, saddlepoint integration (SPI) is proposed to simplify the analysis. The computational complexity grows only linearly ... View full abstract»

• ### Logical link control techniques for wireless ATM network

Publication Year: 1999, Page(s):107 - 112
Cited by:  Papers (2)
| | PDF (464 KB)

In wireless ATM networks, a logical link control (LLC) layer is necessary to mitigate the effect of errors caused by the radio channel before cells are released to the ATM network layer. The authors propose and evaluate some LLC techniques, compare the system performance for different packet lengths, and discuss the trade-off between complexity and performance. The lengths of the used packets in d... View full abstract»

• ### Reduction of decoding complexity of trellises for BCM

Publication Year: 1999, Page(s):82 - 88
| | PDF (604 KB)

Block-coded modulation (BCM) combines bandwidth-efficient modulation techniques with error-correction capabilities to allow efficient data transmission over communication channels. The disadvantage of this technique, however, is the complexity of the trellis used in the Viterbi decoding process. The authors address this problem and propose a method for the reduction of decoding complexity. Optimal... View full abstract»

• ### In-service monitoring of quality of service in ATM networks using OAM cells

Publication Year: 1999, Page(s):102 - 106
Cited by:  Patents (1)
| | PDF (460 KB)

Congestion conditions in ATM switches may cause gradual deterioration in the QoS. QoS monitoring, using OAM, can accurately measure the overall quality of monitored parameters to detect such deterioration before the service quality has dropped below an acceptable level. Several factors call affect the accuracy of the in-service QoS performance monitoring technique, such as the burstiness of the ba... View full abstract»

Publication Year: 1999, Page(s):133 - 137
Cited by:  Papers (24)
| | PDF (452 KB)

Finite-state Markov channel (FSMC) models are useful for analysing radio channels with nonindependent fading, which give rise to bursty channel errors. In the paper the FSMC model is constructed by partitioning the dynamic range of the fade amplitude into finite number of intervals and representing each interval as a state' in the model. Transitions between these channel states thus characterise ... View full abstract»

• ### Errors-and-erasures decoding of BCH codes

Publication Year: 1999, Page(s):79 - 81
Cited by:  Papers (2)
| | PDF (200 KB)

A Grobner basis algorithm for errors-and-erasures decoding of BCH codes that avoids computation of the modified syndrome polynomial is given. The decoding problem is viewed as an instance of a more general interpolation problem. The algorithm has the same computational complexity as the Berlekamp-Massey algorithm but is more efficient in hardware View full abstract»

• ### Automatically designed fuzzy system for connection admission control in ATM networks

Publication Year: 1999, Page(s):113 - 119
Cited by:  Papers (1)
| | PDF (712 KB)

Connection admission control (CAC) is a vital function for asynchronous transfer mode networks. A CAC algorithm should be simple, i.e. economically implementable and fast, and it should be efficient, i.e. allow statistical multiplexing. A solution based on an analytical queueing model is too CPU-intensive and cannot be applied online. The paper proposes a new scheme based on fuzzy logic. The aim i... View full abstract»

• ### Learning algorithms for multicast routing

Publication Year: 1999, Page(s):89 - 94
Cited by:  Patents (4)
| | PDF (624 KB)

It is shown how learning algorithms are used to grow shared multicast trees, in order to minimise some performance index such as the average received packet delay or path length. In particular, automata are used to select a core to send a join request to in a dynamic membership environment. The motivation is to improve the performance of shared multicast trees while retaining their attractive scal... View full abstract»

• ### Approximate bit error probability analysis of 2PSK and 4PSK with partially coherent, symbol-by-symbol detection in carrier phase noise

Publication Year: 1999, Page(s):120 - 126
| | PDF (508 KB)

The effect of carrier phase noise on the BEP of 2PSK and 4PSK with partially coherent, symbol-by-symbol detection is analysed using an approximate approach. Partially coherent detection is achieved using a decision-aided, maximum likelihood carrier phase estimator. The carrier phase noise is modelled as a Brownian motion. Assuming a small phase noise variance, it is shown that the Brownian phase n... View full abstract»

• ### Choice of high and low thresholds in the rate-based flow control scheme

Publication Year: 1999, Page(s):95 - 101
Cited by:  Papers (4)
| | PDF (628 KB)

In a rate-based flow control scheme, the important issue is how to determine congestion occurrence and congestion relief. The most common method is to set two thresholds of queue length, a high threshold and a low threshold. The values of these two thresholds seriously influence the system performance. Hence the authors present the concept of best area' to determine how to set the high and low th... View full abstract»

• ### Performance of an adaptive data-rate MBC system using different FEC codings and ARQ protocols

Publication Year: 1999, Page(s):127 - 132
Cited by:  Patents (2)
| | PDF (504 KB)

The performance of meteor burst communication using adaptive data-rate modulation is analysed. The transmitted data-rate is a function of the channel state, and is varied in a such way that the probability of bit error is kept constant. Unlike other performance analyses, the message consists of data-packets, thus allowing more realistic ARQ protocols to be analysed. The performance of the system i... View full abstract»

• ### Embedding channel coding in arithmetic coding

Publication Year: 1999, Page(s):73 - 78
Cited by:  Papers (8)
| | PDF (568 KB)

An arithmetic coding algorithm that incorporates channel coding is presented. For a source alphabet with m symbols, the selected m code points over the [0-1) interval have a desired minimum Hamming distance d min between them. The decoder utilises this dmin in conjunction with the self-synchronisation property of arithmetic coding and knowledge of the source statistics to rec... View full abstract»