By Topic

Computers and Digital Techniques, IEE Proceedings E

Issue 6 • Date November 1983

Filter Results

Displaying Results 1 - 7 of 7
  • New realisation technique of high-speed discrete Fourier transform described by distributed arithmetic

    Publication Year: 1983 , Page(s): 177 - 182
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (618 KB)  

    This paper presents the results of a study using distributed arithmetic on a microprocessor to implement a prime-number-based discrete Fourier transform (DFT). The matrix equation of the DFT can be reordered in a convolution form suitable for distributed arithmetic. Further simplification of the equation can be achieved by noting some simple properties of number theory and the DFT. It was found th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of printed Thai characters using a matching method

    Publication Year: 1983 , Page(s): 183 - 188
    Cited by:  Papers (2)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (572 KB)  

    As there are many similar characters in printed Thai, and in order to get a high recognition rate, the recognition system is separated into two stages. In the rough classification stage, fine features and noise are ignored by blurring. The blurred characters are separated into some cluster domains. The clustering criterion used is based on selection of the patterns by measuring the similarity coef... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Book review: Design Review Methodology for a Data Base Environment

    Publication Year: 1983
    Save to Project icon | PDF file iconPDF (123 KB)  
    Freely Available from IEEE
  • Coherent design of asynchronous circuits

    Publication Year: 1983 , Page(s): 190 - 201
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (1427 KB)  

    A design procedure for asynchronous sequential circuits is presented, which is based on a nonambiguous tree representation of the circuit's behaviour, this representation eliminating both the need for merging a flow table as well as that of encoding internal states. No critical races occur. It is still a drawback of the method that it does not always lead to the minimum number of internal states. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Book review: Logic Design and Computer Organisation

    Publication Year: 1983
    Save to Project icon | PDF file iconPDF (122 KB)  
    Freely Available from IEEE
  • Efficient computer method for ExOR logic design

    Publication Year: 1983 , Page(s): 203 - 206
    Cited by:  Papers (21)
    Save to Project icon | Click to expandAbstract | PDF file iconPDF (501 KB)  

    Application of exclusive-OR logic design suffers from a lack of straightforward design methods. Recently a procedure using generalised Reed-Muller (GRM) coefficient maps has been proposed. Based on this approach, an efficient computer method is developed for the generation of all 2n sets of GRM coefficients of an n-variable Boolean function. Along with the coefficients a metric may be calculated f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conference Report. 6th Symposium on Computer Arithmetic

    Publication Year: 1983
    Save to Project icon | PDF file iconPDF (146 KB)  
    Freely Available from IEEE