Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Computers and Digital Techniques, IEE Proceedings E

Issue 3 • Date May 1981

Filter Results

Displaying Results 1 - 8 of 8
  • Speed-optimised microprocessor implementation of a digital filter

    Publication Year: 1981 , Page(s): 85 - 93
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1173 KB)  

    A practical, efficient scheme is described for the implementation of a real-time programmable digital filter using a microprocessor. The use of distributed arithmetic is known to be able to provide increased speeds by avoiding time-consuming multiplications. To achieve maximum speeds, the working program in a microprocessor implementation should, as far as possible, contain only those instructions which perform the arithmetic functions. High component efficiency is also achieved if the inherent control capabilities of the microprocessor are fully utilised, in particular where support hardware elements are used. Simple techniques are proposed for meeting the above objectives, which are inexpensive to implement and are readily adaptable for most standard microprocessors. The low cost and enhanced speed of implementation makes it attractive as an economical alternative to hard-wired digital filters for working frequencies in the audio and telephony range of frequencies and as a building block for cascade realisation of larger length filters, particularly of the FIR type. Some results of an experimental model using the commercial standard 8080A micropressor are given and comparisons with implementations for other micropressors are made. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Icalp 81 - preliminary announcement

    Publication Year: 1981 , Page(s): 94
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (136 KB)  

    The 8th International Colloquium on Automata, Languages and Programming (ICALP 81) will take place on July 13-17, 1981 in the Palm-Beach Hotel, Acre (Akko), Israel. ICALP 81 is organised by the Computer Science Department of The Technion, Israel Institute of Technology, Haifa, Israel and sponsored by the European Association for Theoretical Computer Science (EATCS). ICALP 81 is supported by the Technion, Israel Institute of Technology; The Israel Academy of Sciences and Humanities; Rafael-Armament Development Authority; IBM-Israel Ltd.; EL-AL Israel Airlines (official carrier). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of a bit-slice microcomputer

    Publication Year: 1981
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (832 KB)  

    The fact that the synthesis of a microcomputer, to achieve the specific requirements for real-time operation, can be achieved through bit-slice technology is utilised as a design factor. The paper presents the design of a 3 MHz clock frequency microprogrammable microcomputer based on the Intel 3000 series of microprocessors. The requirements of real-time signal processing are included in the computer specification, as are facilities to incorporate incircuit emulation for software development. The paper discusses the microprogramming technique and illustrates the flexibility of the microcode through the jump-function facility. The paper evaluates the performance to achieve a worst-case cycle time of 383 ns without pipelining and carry look ahead as opposed to a worse case of 149 ns with pipelining and carry look ahead. A 3 MHz clock frequency was easily achieved without pipelining. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bit-level synchronisation in microprocessor networks

    Publication Year: 1981 , Page(s): 103 - 106
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (313 KB)  

    A synchronisation method for baseband data transmission in microprocessor networks is developed. The method is applicable in systems using ADCCP-, HDLC- or SDLC-protocols and NRZI-code and point-to-point or loop-mode operation. The method is based on bit resynchronisation using counters. No phase-locked loops are used. This provides a very efficient and fast correction response with relatively simple circuitry. The performance of the system is analysed and tested in practice. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Realisation of multithreshold threshold logic networks using the rademacher-walsh transform

    Publication Year: 1981 , Page(s): 107 - 113
    Cited by:  Papers (1)
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (680 KB)  

    A method is proposed by which binary logic functions are resolved into multithreshold form. It is based upon an already existing design algorithm which involves spectral translations, and can be easily adopted for CAD implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance measures for near-maximum-likelihood detection processes

    Publication Year: 1981 , Page(s): 114 - 122
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (1130 KB)  

    In maximum-or near-maximum-likelihood detection processes of the type frequently considered for use in applications where the digital data signal is received in the presence of both additive noise and severe intersymbol interference, the detector computes, for each of a number of possible sequences of received data symbols, the Euclidean or unitary distance between the corresponding received sequence, for the given signal distortion but in the absence of noise, and the sequence actually received. Such computations involve numerous operations of squaring or multiplication. The paper studies a general class of piecewise linear distance measures that involve no operations of squaring or multiplication, other than multiplication by the integer 2, leading to a useful simplification in the implementation of the detection process. The departure of each distance measure from the ideal is analysed theoretically for the simplest case of just one complex-valued received sample, and the results obtained are then extended to the general case of a message involving several received samples. Finally, results are presented of computer simulation tests assessing the effect of each distance measure on the tolerance of the detector to additive white Gaussian noise. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer-assisted design of PROM-controlled state-machine circuits for logical applications

    Publication Year: 1981 , Page(s): 123 - 128
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (658 KB)  

    In the design of applications such as weather satellite receiving stations the digital circuits are sequential in operation and so lend themselves to a stored-program approach to allow easy functional changes. However, in many cases a conventional microprocessor cannot be used because of speed requirements. This type of circuit can best be implemented using a PROM-controlled state-machine processor with a low-level instruction set optimised for the particular application. A modular building block approach to such circuits and a corresponding development system for writing and testing programs is presented in this paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Economical realisation of asynchronous sequential circuits using random-access memories

    Publication Year: 1981 , Page(s): 129 - 132
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (496 KB)  

    This paper shows that by taking advantage of a fairly uniform delay distribution in semiconductor random-access memories (ROMs and read-write memories in integrated circuit form) it is possible to realise asynchronous sequential circuits (ASCs) economically. It is shown that the ASC so designed will function without fault, in spite of the presence of races and essential hazards in the ASC. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.