By Topic

Computers and Digital Techniques, IEE Proceedings E

Issue 1 • Date Jan 1992

Filter Results

Displaying Results 1 - 12 of 12
  • Clockless synchronisation of distributed concurrent processes

    Publication Year: 1992 , Page(s): 88 - 92
    Cited by:  Papers (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (336 KB)  

    For synchronising operations in a distributed computer or control system where the units are closely coupled, the three-wire synchroniser, originally developed for the 1987 IEEE Futurebus Standard, has some advantages over the use of common clock waveforms. After pointing out these advantages and reviewing the operation of the synchroniser, the paper presents a recent development in which each uni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Very-high-speed VLSI 2s-complement multiplier using signed binary digits

    Publication Year: 1992 , Page(s): 29 - 34
    Cited by:  Papers (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (372 KB)  

    A high-speed 8*8-bit multiplier design for 2s-complement binary numbers is presented. The multiplier uses the binary signed-digit number system to achieve both high speed and layout simplicity, and is implemented in double layer metal 2 mu m CMOS technology. The multiplication time for the array was found by simulation to be 18 ns at 25 degrees C and its size was measured as 1.7 mm*2.3 mm (excludi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FFT architecture for WSI with concurrent error detection and fault location

    Publication Year: 1992 , Page(s): 13 - 20
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (584 KB)  

    The paper presents a new approach for concurrent error detection in homogeneous VLSI/WSI architectures for the computation of the complex N-point fast Fourier transform (FFT). The proposed approach is based on the relationship between the computations of cells at a given point distance. This relationship is analysed with respect to functional and physical faults. It is proved that a 100% probabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling peak shapes obtained by Hough transform

    Publication Year: 1992 , Page(s): 9 - 12
    Cited by:  Papers (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (300 KB)  

    The paper studies peak shapes obtained when using the Hough transform. The work was motivated by the author's finding that Hough transform peaks are sometimes sharper than a priori reasoning would suggest. A mathematical model for the simple case of circle detection has been able to explain this satisfactorily, but the detailed form of the model is somewhat surprising and suggests that high peak s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time characteristics of IEEE 802.4 token bus protocol

    Publication Year: 1992 , Page(s): 81 - 87
    Cited by:  Papers (1)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (516 KB)  

    Timed token protocols have increased in importance with the growth of local area network (LAN) communications One of the most important timed token protocols is certainly IEEE 802.4, a standard given the name 'token bus', which represents one of the most interesting solutions to the problem of handling, on the same physical channel, the transmission of messages belonging to multiple priority class... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured knowledge manipulation system for real-time engineering applications

    Publication Year: 1992 , Page(s): 59 - 63
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (292 KB)  

    A structured knowledge manipulation system (SKMS), which incorporates a relational processing unit based on a structured knowledge representation, providing real-time relational accesses of a knowledge base, is described. Direct hardware support is provided for set operations and 'between bounds' matching. Additionally, 'garbage collection' is performed concurrently, with no memory overheads and v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global study on data compression techniques for digital Chinese character patterns

    Publication Year: 1992 , Page(s): 1 - 8
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (548 KB)  

    Dot matrix representation of Chinese characters is the most popular method used, however, it requires a relatively large memory for the storage of Chinese character patterns. For the purpose of a global study, various data compression techniques are investigated to determine the method that requires the least amount of memory for data storage. The entropy of Chinese character patterns preprocessed... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of bridged LANs

    Publication Year: 1992 , Page(s): 64 - 72
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (520 KB)  

    As the requirements of LANs have evolved, an increasing number of LANs now incorporate MAC bridges. In many instances, however, the choice of bridges, and the interconnection topologies used with them, is being made based on technological grounds rather than on firm predictions of improvements in overall network response times. The paper identifies the issues that must be considered when expanding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layout optimisation for yield enhancement in on-chip-VLSI/WSI parallel processing

    Publication Year: 1992 , Page(s): 21 - 28
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (540 KB)  

    The paper investigates the layout optimisation problem for processor-array networks. If an appropriate shape geometry is selected for the processors, a specific interconnection network can be area-efficiently mapped on a VLSI/WSI chip to maximise the chip yield, operational reliability and circuit performance. A formal technique of cellular layout by polyomino tiles is proposed, with application t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correctness analysis for class of asynchronous communication mechanisms

    Publication Year: 1992 , Page(s): 35 - 49
    Cited by:  Papers (3)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (1152 KB)  

    Real-time system design options increase significantly if the individual concurrent processes are able to communicate with no mutual timing interference. This requirement can be met by a particular class of asynchronous communication mechanisms for the transfer of reference data between a single writer and a single reader, which is characterised by the use of multiple shared memory locations (slot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic algorithms for register allocation

    Publication Year: 1992 , Page(s): 73 - 80
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (520 KB)  

    A model to find the optimal register allocation of program variables, including large strongly connected regions (loops), is presented. The program is represented by a directed control flow graph and assumes that all variables have been allocated to memory locations. The model takes into account the cost and saving times involved in allocating variables to registers in each node of the program in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed point model for adaptive token passing bus protocol

    Publication Year: 1992 , Page(s): 50 - 58
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (564 KB)  

    The performance of an adaptive token passing bus protocol is analysed by modelling the behaviour of each node as an M/GI/1 queue and deriving a set of fixed point equations. The technique is shown to be applicable to the analysis of a number of variants of the token passing bus protocol which arise in communication networks and computer integrated manufacturing systems. The validity of the indepen... View full abstract»

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