Search preferences
Skip to main search results

Search filters

Product Type

  • All Product Types 
  • Books (1)
  • Magazines & Periodicals (No further results match this refinement)
  • Comics (No further results match this refinement)
  • Sheet Music (No further results match this refinement)
  • Art, Prints & Posters (No further results match this refinement)
  • Photographs (No further results match this refinement)
  • Maps (No further results match this refinement)
  • Manuscripts & Paper Collectibles (No further results match this refinement)

Condition

Binding

Collectible Attributes

Language (1)

Price

  • Any Price 
  • Under £ 20 (No further results match this refinement)
  • £ 20 to £ 35 (No further results match this refinement)
  • Over £ 35 
Custom price range (£)

Free Shipping

  • Free Shipping to United Kingdom (No further results match this refinement)

Seller Location

  • Megson, G. M.

    Published by Oxford New York : Clarendon Press ; Oxford University Press, 1992

    ISBN 10: 0198538138 ISBN 13: 9780198538134

    Language: English

    Seller: MW Books Ltd., Galway, Ireland

    Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

    Contact seller

    First Edition

    £ 9.32 shipping from Ireland to United Kingdom

    Destination, rates & speeds

    Quantity: 1 available

    Add to basket

    First Edition. Near fine copy in the original gilt-blocked cloth and protective plastic sleeve. Slightest suggestion only of dust-dulling to the spine bands and panel edges. Remains particularly well-preserved overall; tight, bright, clean and strong. Physical description; xi, 345 pages : illustrations ; 24 cm. Notes; Includes bibliographical references (pages 332-342) and index. Contents; Partial contents 1. Introduction. 1.1. Overview. 1.2. The convolution problem. 1.3. A brief history. 1.4. Applications and axioms. 1.5. Systolic systems -- 2. Space-Time and Retiming. 2.1. Graphs and sequences. 2.2. Space-time and projection. 2.3. Loop unrolling and pipelining. 2.4. Array unrolling and envelopes. 2.5. Retiming and cuts. 2.6. Design methodology. 2.7. Notation -- 3. Matrix Algorithms. 3.1. Linear systems. 3.2. Substitution arrays. 3.3. Triangularization. 3.4. Iterative arrays. 3.5. Inversion and transposition. 3.6. The Faddeev algorithm. 3.7. Design principles -- 4. Table Generation. 4.1. Tables and space-time. 4.2. Systolic differencing. Subjects; Computer algorithms. Systolic array circuits. Algorithms. Parallel programming. 1 Kg.