Home
>
Journals & magazines
>
IEE Proceedings F (Communications, Radar and Sign...
>
Volume 131
Issue 7
IEE Proceedings F (Communications, Radar and Signal Processing)
Volume 131, Issue 7, December 1984
Volumes & issues:
Volume 131, Issue 7
December 1984
Future trends in telecommunications transmission—a personal view
- Author(s): P. Cochrane
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 669 –683
- DOI: 10.1049/ip-f-1.1984.0102
- Type: Article
- + Show details - Hide details
-
p.
669
–683
(15)
After briefly tracing transmission system development to the present day, the paper goes on to consider the likely progression of both services and technology in the near and far future. To provide a clear focus for the discussion, a number of ‘end point’ developments and targets are postulated as the ultimate objectives of the transmission engineer. The latest technology developments are then cited as being capable of providing the means to achieve these objectives, which would then lead to a continuing exponential growth in both traffic and services. It is concluded that future traffic and service demands will ultimately rely upon optical fibre systems as the major point-to-point carrier, with radio and satellite devoted to mobile, broadcast, rapid-response and ‘outback’ applications.
Cryptographic techniques and network security
- Author(s): F. Ayoub and K. Singh
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 684 –694
- DOI: 10.1049/ip-f-1.1984.0103
- Type: Article
- + Show details - Hide details
-
p.
684
–694
(11)
In the paper some of the cryptographic techniques, algorithms and applications in computer networks are reviewed. Symmetric and asymmetric cryptosystems, possible cryptanalytical attacks, cryptosecurity and the relevance of complexity theory to the security of ciphers are described. The major threats and counter-measures in computer-network communications are outlined. Finally, cryptographic applications and limitations in computer networks are examined.
Erratum: M-ary continuous phase frequency shift keying with modulation index 1/M
- Author(s): N. Ekanayake
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, page: 694 –694
- DOI: 10.1049/ip-f-1.1984.0104
- Type: Article
- + Show details - Hide details
-
p.
694
(1)
Investigation of a radar site effect
- Author(s): P. Lewis
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 695 –708
- DOI: 10.1049/ip-f-1.1984.0105
- Type: Article
- + Show details - Hide details
-
p.
695
–708
(14)
An experimental investigation is described of the scattering effect responsible for large errors in the azimuth bearing measurements obtained with a 1 GHz monopulse receiver on a particular site when the signal source occupied positions near the top of a distant hill. The received field distribution on a horizontal line directly in front of the monopulse aperture was sampled by means of a travelling probe antenna and recorded holographically. Computer processing of the holograms formed images that revealed the scattering mechanism. A simulation was used to study the effects of different components of the multipath field on the monopulse measurement.
DC coefficient restoration in transform image coding
- Author(s): W.K. Cham and R.J. Clarke
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 709 –713
- DOI: 10.1049/ip-f-1.1984.0106
- Type: Article
- + Show details - Hide details
-
p.
709
–713
(5)
In a transform coding system, a large number of bits have to be allocated to high-energy DC coefficients for both fine quantisation and good channel error immunity. Three schemes are proposed, in which the DC coefficients are not transmitted, but estimated at the receiver. This allows a reduction in bit rate, as well as the possibility of eliminating the serious effect of channel errors on those coefficients.
Relationship between the maximum entropy method and a likelihood ratio test
- Author(s): D.R. Farrier
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 714 –718
- DOI: 10.1049/ip-f-1.1984.0107
- Type: Article
- + Show details - Hide details
-
p.
714
–718
(5)
It is demonstrated that the maximum entropy method is closely related to a general likelihood ratio detector which tests for the equality of two covariance matrices. These results may be used to indicate which (if any) maximum entropy spectral estimate contains significant information.
A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems
- Author(s): A.A. Shaar and P.A. Davies
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 719 –724
- DOI: 10.1049/ip-f-1.1984.0108
- Type: Article
- + Show details - Hide details
-
p.
719
–724
(6)
Sequences are often used as a basis for code division multiplexing. In order that minimum interference from other users should occur, it is important that the sequences used should have good cross-correlation properties. Various sets of sequences have been derived with appropriate properties, but the sources have been well dispersed within the literature. In the paper are collected six of the most important of these sequence sets, and examples are given of the way in which they are constructed.
Number of one-coincidence sequence sets for frequency-hopping multiple access communication systems
- Author(s): A.A. Shaar ; C.F. Woodcock ; P.A. Davies
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 725 –728
- DOI: 10.1049/ip-f-1.1984.0109
- Type: Article
- + Show details - Hide details
-
p.
725
–728
(4)
The paper presents a new and general description of a class of one-coincidence sequence sets. The set leaders of this class are derived from the combination of N linearly independent phases of a binary m-sequence of length S= 2N−1. This class will be referred to in this paper as the m-sequence class of one-coincidence sequences. The total number of one-coincidence sets of this class is derived. It is shown that the total number of the m-sequence class of one-coincidence sets is much larger than the number previously described in the literature. A general proof of the one-coincidence property of these sets is presented, and four equivalent conditions for the existence of one-coincidence sequence sets is derived.
Transient probability response of cycle slip occurence in the PSK-TDMA carrier recovery
- Author(s): T. Fujino ; Y. Umeda ; E. Yamazaki
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 729 –733
- DOI: 10.1049/ip-f-1.1984.0110
- Type: Article
- + Show details - Hide details
-
p.
729
–733
(5)
The class of carrier recovery which is often employed in PSK-TDMA systems is ‘frequency multiplier/narrow-band filter/frequency divider’. Cycle slips occur when a signal extracted from the narrow-band filter is embedded in some noise. In the PSK-TDMA systems, a transmitted signal S is of the burst form while received noise N is in the steady state. A preceding burst signal I is often allocated immediately before the burst signal S. In this paper, the transient occurrence probability of the cycle slips is analytically derived, assuming that the products of the multiplier, which are a burst signal (S × S) and a preceding burst signal (I × I) as well as a steady-state noise (N × N), a burst noise (S × N) and a preceding burst noise (I × N), are coexistent at the narrow-band filter output. Also the transient cycle slip occurrence probability is numerically calculated using the results of the analysis.
Application of surface-acoustic-wave technology to burst-format spread-spectrum communications
- Author(s): M. Kowatsch
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 734 –741
- DOI: 10.1049/ip-f-1.1984.0111
- Type: Article
- + Show details - Hide details
-
p.
734
–741
(8)
A hybrid direct-sequence/frequency-hopping spread-spectrum communication modem for burst format transmission of digital data has been developed. A burst consists of a short synchronisation preamble and the data packet. Data modulation is accomplished by assignment of pairs of pseudonoise sequences with low crosscorrelation for message ones and zeros. The spreading code chip pattern is changed from bit to bit in both the preamble and the message portion of a burst. Receiver signal processing is based on the application of surface-acoustic-wave (SAW) elastic convolvers to programmable matched filtering. The performance of the system in an additive white Gaussian noise channel is analysed, measures of performance being the probability of burst loss and the bit error probability in the case of ideal synchronisation. Evaluations for a particular design are presented, and some experimental results obtained with a test system are shown for comparison.
Limits on the search rate of a pseudonoise sliding correlator synchroniser due to self-noise and decorrelation
- Author(s): R.F. Ormondroyd and V.E. Comley
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 742 –750
- DOI: 10.1049/ip-f-1.1984.0112
- Type: Article
- + Show details - Hide details
-
p.
742
–750
(9)
Sliding correlators are frequently used in the acquisition of pseudonoise sequences in spread-spectrum and ranging systems. High-speed acquisition is often required. The paper examines the decorrelation between the received and locally generated codes and the increase in self-generated noise at the output of the correlator as the search rate is increased. A numerical approach enables the analysis to be carried out for search rates well in excess of 1 bit per sequence period. It is found that decorrelation and self-noise place an upper bound on the search rate of the synchroniser, which has been ignored previously. The analysis has been carried out for a range of code lengths, and analytic expressions are obtained for both decorrelation and self-noise terms, which enable the effects to be estimated by extrapolation for other, longer, codes, where the effects are more pronounced. The results enable a correction factor to be incorporated into the expression for the maximum search rate of a sliding correlator under external noise conditions.
IEE conference publication 231
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, page: 750 –750
- DOI: 10.1049/ip-f-1.1984.0113
- Type: Article
- + Show details - Hide details
-
p.
750
(1)
Distributed routing algorithm for a circuit packet switching network
- Author(s): W. Yu ; J.C. Majithia ; J.W. Wong
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 751 –760
- DOI: 10.1049/ip-f-1.1984.0114
- Type: Article
- + Show details - Hide details
-
p.
751
–760
(10)
A distributed routing algorithm for an integrated network with circuit and packet switching capabilities is proposed. The algorithm is based on the ideas of a minimum-delay routing algorithm proposed by Gallager. The trunk organisation used in the integrated network allows a fixed or moving boundary between circuit and packet traffic. The proposed routing algorithm operates independently of the trunk management policy, and attempts to maximise a network performance measure M. This measure reflects both the end-to-end blocking for circuit traffic and the average end-to-end delay for packets. It will be shown that, for optimal performance, packet traffic must be routed in the direction of minimum incremental link delay to the packet destination. Circuit routing, on the other hand, depends on whether the trunk boundary is fixed or movable. Thus, under the fixed-boundary management policy, circuit traffic must be routed in the direction of minimum incremental link blocking to the circuit destination. Under the moving-boundary management policy, circuit routes must be chosen to minimise the effect on packet performance, i.e. minimum incremental packet delay due to incremental circuit traffic. The proposed routing algorithm has been tested for its adaptability to various load conditions. These investigations have also demonstrated the performance improvement due to the moving-boundary trunk organisation.
Electronic hardware implementation of the principal components transformation for multichannel image data
- Author(s): A.A.D. Canas
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 761 –767
- DOI: 10.1049/ip-f-1.1984.0115
- Type: Article
- + Show details - Hide details
-
p.
761
–767
(7)
An implementation of the principal components transformation is presented which makes use of analogue and digital electronic hardware under the control of a microprocessor. The hardware is used to collect covariance statistics from a multichannel set of digital video images and to perform the actual transformation on real-time analogue video signals derived from the stored data. This approach offers considerable advantages over a completely software based system in terms of speed and cost. An example of the use of the system for the analysis of Landsat multispectral data is presented.
Data transmission over UHF fading mobile radio channels
- Author(s): J.H. Roberts and F. Gardner
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, p. 767 –768
- DOI: 10.1049/ip-f-1.1984.0116
- Type: Article
- + Show details - Hide details
-
p.
767
–768
(2)
Data transmission over UHF fading mobile radio channels
- Author(s): J.P. McGeehan and A.J. Bateman
- Source: IEE Proceedings F (Communications, Radar and Signal Processing), Volume 131, Issue 7, page: 768 –768
- DOI: 10.1049/ip-f-1.1984.0117
- Type: Article
- + Show details - Hide details
-
p.
768
(1)
Most viewed content for this Journal
Article
content/journals/ip-f-1
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.