By Topic

# IEE Proceedings - Communications

## Filter Results

Displaying Results 1 - 11 of 11
• ### Estimating the cost of a telecommunications network using the fractal structure of the human population distribution

Publication Year: 1995, Page(s):172 - 178
Cited by:  Papers (1)
| | PDF (492 KB)

Results are presented which exploit the strong scale-invariant structure present in the spatial distributions of the populations of Great Britain and the United States to estimate the cost of star networks to serve these populations. The costs of the network components are modelled as affine functions of the capacities of the components. The main application for this work is to assist in making de... View full abstract»

• ### Schemes for equalisation of communication channels with nonlinear impairments

Publication Year: 1995, Page(s):165 - 171
Cited by:  Papers (15)  |  Patents (4)
| | PDF (512 KB)

Two novel techniques are described for equalisation of nonlinear intersymbol interference. One is a symbol-by-symbol-type technique and is built around a conventional decision-feedback equaliser by embedding a neural radial basis-function network before the slicer. The other is a maximum-likelihood method exploiting the classification nature of an equaliser. A Viterbi-minimisation approach is empl... View full abstract»

• ### Two-level dynamic step sizes of virtual paths on bandwidth allocation in ATM networks

Publication Year: 1995, Page(s):158 - 164
Cited by:  Papers (2)
| | PDF (416 KB)

The virtual path concept has been proposed as the key technique in improving the transmission efficiency in ATM networks. Changing the bandwidth of a virtual path, by a step at a time, has been shown to successfully enhance the transmission efficiency compared to the fixed bandwidth scheme. Therefore how to appropriately select a step size which causes a trade-off between the transmission efficien... View full abstract»

• ### Collision resolution algorithm for M-priority users

Publication Year: 1995, Page(s):151 - 157
Cited by:  Papers (2)
| | PDF (452 KB)

The authors propose and analyse a collision resolution algorithm (CRA) with M (⩾2) priority classes in random access communication systems. When it is applied to the clipped binary-tree protocol, it is stable if the total traffic is below 0.473 packets per slot regardless of the value of M. Its maximum throughput is higher than those obtained previously. When the algorithm is applied to the tr... View full abstract»

• ### Decoding the ternary (23, 12, 8) quadratic residue code

Publication Year: 1995, Page(s):129 - 134
Cited by:  Papers (3)
| | PDF (368 KB)

An algebraic decoding algorithm is presented for the ternary (23, 12, 8) quadratic residue code. The algorithm introduces error-counting polynomials which determine the number of errors in a received word. Also a new search technique is developed, which allows the algorithm to be used on the extended code View full abstract»

• ### Construction of 2n prime-sequence codes for optical code division multiple access

Publication Year: 1995, Page(s):141 - 150
Cited by:  Papers (4)
| | PDF (652 KB)

The construction of a special family of 2n codes, so-called 2n prime-sequence' codes, for optical code division multiple access (CDMA) has recently been investigated. Since the codes pose the algebraic properties of the prime-sequence and 2n codes, those optical coding architectures, which are especially designed for either of the two codes, can be jointly employe... View full abstract»

• ### Triple-receiver-based code protocol for unslotted DS/SSMA packet-radio networks and its performance analysis

Publication Year: 1995, Page(s):193 - 200
Cited by:  Papers (4)  |  Patents (31)
| | PDF (512 KB)

An unslotted DS/SSMA packet-radio protocol (the triple-receiver-based code (R3) protocol) suitable for code-division multiple-access (CDMA) wireless data networks is proposed. The communication between two data terminals is initiated by hand-shaking (request and acknowledgement stages) followed by data-packet transmission (pair-up stage), using the receiver-based signature codes for mul... View full abstract»

• ### Subspace approach to channel assignment in mobile communication networks

Publication Year: 1995, Page(s):179 - 185
Cited by:  Papers (6)  |  Patents (2)
| | PDF (464 KB)

The problem of planning a mobile cellular radio network involves the allocation of channels to base stations so as to ensure that the network can carry sufficient traffic while avoiding interference conflicts. An optimum algorithm for this purpose would meet these constraints while allocating a minimum number of radio channels. The mathematical formulation of this problem reveals that it is a nond... View full abstract»

• ### Erasing gains for concatenated codes

Publication Year: 1995, Page(s):121 - 128
Cited by:  Patents (1)
| | PDF (560 KB)

The optimal strategy for erasing symbols in a concatenated coding system, in which the outer code is decoded once, is considered. In general, the strategy involves comparison of a posteriori symbol likelihoods to nonuniform thresholds. The performance of a greedy version of such a rule is evaluated for a number of specific short inner codes, over both memoryless and bursty channels, with hard and ... View full abstract»

• ### Shift and add' property of m-sequences and its application to channel characterisation of digital magnetic recording

Publication Year: 1995, Page(s):135 - 140
Cited by:  Papers (3)  |  Patents (3)
| | PDF (348 KB)

The shift and add' property of maximum length pseudorandom binary sequences (m-sequences) is a well known property in which the module-two addition of any two identical m-sequences with different phases generates another identical m-sequence, but with another phase. The parameters of the shift and add' property of an m-sequence are derived from the Galois field. Its application to channel charac... View full abstract»

• ### Adaptive traffic-load shedding and its capacity gain in CDMA cellular systems

Publication Year: 1995, Page(s):186 - 192
Cited by:  Papers (22)
| | PDF (472 KB)

In a situation such as a traffic accident on a highway, the active mobiles in an affected cell may easily outnumber the capacity, and an excessive increase in CDMA noise may, in the worst case, block all calls in the cell if the users insist on calling through the same cell site. A scheme to alleviate such congestion in CDMA cellular systems is proposed, so that traffic load is adaptively shed fro... View full abstract»