Serial-Data Computation

1: Introduction.- The case for serial-data techniques.- The case against serial-data techniques.- Historical overview of bit-serial techniques.- Final comments.- 2: The First Generation.- FIRST.- The FIRST primitive set.- Bit-serial systems design.- Case study.- FFT subsystem design.- Filterbank subsystem design.- System specifications.- Initial design issues and decisions.- Functional design — the soft model.- Physical design — the hard model.- Test strategy and confidence levels.- A critical appraisal of FIRST.- 3: Rudiments.- Issues of space and time.- Control.- Two’s complement integer coding.- Fundamental building blocks — the atoms.- Numerical principles of serial-data additive operations.- Partitioning issues.- 4: Two’s Complement Multiplication.- Derivation from bit-parallel architectures.- Scrutiny of two serial-data multipliers.- Word-level equivalent architectures.- Comparison of the S/P and Lyon multipliers.- Serial/parallel multiplier environments.- Other approaches.- 5: Area-Saving Techniques.- Overview of vector computation.- Symmetric-coded serial/parallel muiltiplier.- Serial/parallel inner-product computer.- Architectural case studies.- Architectural synthesis.- Distributed arithmetic in context.- Cascading DA modules.- Incremental computation of squares/sums of squares.- Final comments.- 6: Throughput Enhancement.- Twin-pipe.- Radix-4.- Multi-precision.- Interfacing between operational domains.- The automultiplier.- Final comments.- 7: The Second Generation.- Process-independence.- Overview of SECOND.- PRIMITIVE specification (design capture).- PRIMITIVE verification (behavioural simulation).- Semi-custom PRIMITIVE implementation.- Custom PRIMITIVE implementation.- Other approaches.- Final comments.- 8: Concluding Remarks.- References.-Appendix A — Complex Multiplier.- Appendix B — Logic Synthesis.