By Topic

IEE Proceedings E - Computers and Digital Techniques

Issue 1 • Jan 1993

Filter Results

Displaying Results 1 - 10 of 10
  • Canonical restricted mixed-polarity exclusive-OR sums of products and the efficient algorithm for their minimisation

    Publication Year: 1993, Page(s):69 - 77
    Cited by:  Papers (9)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (652 KB)

    The concept of canonical restricted mixed polarity (CRMP) exclusive-OR sum of products forms is introduced. The CRMP forms include the inconsistent canonical Reed-Muller forms and the fixed-polarity Reed-Muller (FPRM) forms as special cases. The set of CRMP forms is included in the set of exclusive-OR sum-of-product (ESOP) expressions. An attempt to characterise minimal CRMP forms for completely s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalisation of tri-state map and a composition method for minimisation of Reed-Muller polynomials in mixed polarity

    Publication Year: 1993, Page(s):59 - 64
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (432 KB)

    The concept of tri-state map that is used to represent and to minimise the Reed-Muller polynomials for functions of six or fewer variables is generalised to functions of any number of variables. A minimisation method for Reed-Muller polynomials in mixed polarity known as the composition method is developed. It can be implemented by a tabular method as well as on computers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Microprocessor systems diagnosis using a time-range approach

    Publication Year: 1993, Page(s):1 - 9
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (696 KB)

    In many aspects of microprocessor systems design and diagnosis, temporal reasoning of a sequence of event changes occurring at imprecisely known time instants is often required. By combining the change-based and time-based approaches of temporal logics, the concept of time range is proposed as a key component of an enhanced time structure which captures the notion of time impreciseness in event oc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low complexity Viterbi detector for magnetic disc drives

    Publication Year: 1993, Page(s):78 - 80
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (212 KB)

    A signal detection scheme for magnetic disc drives based on maximum likelihood sequence detection is proposed which refers to a channel with RLL 1, 7 coding and features a trellis with three states and five transitions. Owing to the RLL 1, 7 code, clock recovery is more stable than in partial response coded systems. The decoding gain amounts to 5 dB, and may lead to an increase in capacity by a fa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition method for minimisation of Reed-Muller polynomials in mixed polarity

    Publication Year: 1993, Page(s):65 - 68
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (232 KB)

    A minimisation method for Reed-Muller polynomials in mixed polarity known as the decomposition method is developed. The method adopts the top-down approach in which the products of a Reed-Muller polynomial are decomposed from a 1-term list one by one. It can be implemented on computers. Tristate maps can also be used if the number of variables is equal to, or less than, six. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel DFT computation on bit-serial systolic processor arrays

    Publication Year: 1993, Page(s):10 - 18
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (604 KB)

    The paper shows how novel one-dimensional and two-dimensional systolic processing architectures, comprising up to N coordinate rotation digital computer (CORDIC) processing elements (PEs), can be used to carry out hardware-efficient parallel implementations of the N-point discrete Fourier transform (DFT), offering highly attractive throughput rates in relation to the conventional N-processor linea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance models for message passing architectures

    Publication Year: 1993, Page(s):19 - 32
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (860 KB)

    The authors discuss parametrised performance models for distributed memory machines with particular emphasis on transputer networks. Overheads are decomposed into three categories, namely scheduling, communication and synchronisation. The degradation resulting from each type of overhead is expressed as an efficiency parameter and half-performance parameters are derived for communication and synchr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time mapping, latency of data flow and concurrent error detection in systolic arrays

    Publication Year: 1993, Page(s):33 - 44
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (656 KB)

    The problem of mapping a general iterative algorithm with nonunit increment/decrement steps of the loop indices onto a systolic array using space-time transformation is studied. Necessary and sufficient conditions for the existence of such a space-time mapping are presented. The latency of a systolic computation is characterised in terms of the spa-time mapping and the increment/decrement step siz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation issues of 2-dimensional polynomial multipliers for signal processing using residue arithmetic

    Publication Year: 1993, Page(s):45 - 53
    Cited by:  Papers (6)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (528 KB)

    The residue number system (RNS) has been considered a useful tool for digital signal processing (DSP) since it can support parallel, carry-free, high-speed arithmetic. The polynomial residue number system (PRNS) enjoys all the RNS advantages and is capable of performing the useful DSP operation of polynomial multiplication in a totally parallel fashion and with minimum multiplication count provide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Moments of a crack coded blob

    Publication Year: 1993, Page(s):54 - 58
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (216 KB)

    A method for the computation of moments up to the third order of a binary image or blob encoded in crack code is presented. The method uses the projections of the blob on lines at 0, pi /4, pi /2 and 3 pi /4, introduces no approximations, and substantially reduces the computational effort compared with other methods. View full abstract»

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