Jack Justin Stiffler (1934–2019) was an American electrical engineer, computer scientist and entrepreneur, a Fellow of the Institute of Electrical and Electronics Engineers who made key contributions in the areas of communications (especially coding theory) and fault-tolerant computing.

Education and career

Stiffler (right) with his college roommates

Stiffler was born May 22, 1934, in Mitchellville, Iowa, and graduated from Mitchellville High School. In 1952 he entered Harvard College, where he lived in Adams House,[1] and graduated in 1956 with an AB magna cum laude in physics.[2] He immediately moved to Los Angeles and joined the research department of Hughes Aircraft Company. He received an MS in electrical engineering from the California Institute of Technology in 1957, and after a year at the Sorbonne on a Fulbright scholarship[3] returned to Caltech, where he completed his PhD in 1962. He was a member of Phi Beta Kappa and Sigma Xi.[2]

In 1959 he began part-time work in the Communications Systems Research Section of the Jet Propulsion Laboratory in Pasadena, California, and in 1961 he became a full-time Member of the Technical Staff there. In 1967 he became a Consulting Engineer with the Space and Information Systems Division of Raytheon Company in Sudbury, Massachusetts, where he worked on advanced communications systems.[2]

In 1981 he founded Sequoia Systems Incorporated in Marlborough, Massachusetts,[4] which produced fault-tolerant computer systems, specialized for transaction processing, using a tightly coupled architecture of his design.[5] Nine years later the company began trading on the NASDAQ exchange.[4]

Stiffler died March 24, 2019, in Watsonville, California.[4]

Research

Stiffler in the 1980s

Stiffler was author or coauthor of numerous papers and books, and was awarded several hundred patents.[4] His thesis, "Self-synchronizing binary telemetry codes", supervised by Solomon Golomb, combined the ideas of binary orthogonal codes (in which codewords are completely uncorrelated with one other) and self-synchronizing codes (in which there is no ambiguity about the positions of the boundaries between code words); he found constructions of self-synchronizing binary orthogonal codes for all codeword lengths greater than or equal to four, and proved nonexistence for all shorter lengths.[6]

In 1964 he developed the puncturing technique[7] (and proved the Solomon–Stiffler bound)[8] with Gustave Solomon, and coauthored Digital Communications with Space Applications with Golomb, Andrew Viterbi and two others.[9] His 1971 book Theory of Synchronous Communications[10] grew out of NASA's need for highly power-efficient synchronous serial communication during data transmissions for its deep space program;[11] a review called it "unparalleled in its comprehensive treatment of the synchronization problems of time-discrete communications" and "a landmark in the theoretical development" of the subject.[12]

In 1971 he edited a special issue, on error correcting codes, of IEEE Transactions on Communication Technology,[13] and in 1980 he edited a special issue of IEEE Transactions on Computers surveying fault-tolerant computing.[14]

In 1975 he was made a Fellow of the IEEE,[15] a distinction reserved for IEEE members with "extraordinary record[s] of accomplishment".[16]

References

  1. ↑ The 1956 Harvard yearbook. Cambridge, Massachusetts: Harvard Yearbook Publications. 1956.
  2. 1 2 3 See:
    • Pradhan, D. K.; Stiffler, J. J. (March 1980). "Error-Correcting Codes and Self-Checking Circuits". Computer. Vol. 13, no. 3. IEEE. pp. 27–37. doi:10.1109/MC.1980.1653527.
    • Stiffler, J. J. (June 1978). "Coding for Random-Access Memories". IEEE Transactions on Computers. C-27 (6): 526–531. doi:10.1109/TC.1978.1675143. S2CID 10587456.
  3. ↑ Harvard College Class of 1956. Triennial report. Cambridge, Massachusetts: Crimson Printing Co. 1959.
  4. 1 2 3 4 "Obituaries. Jack Justin Stiffler". Harvard Magazine. September–October 2019. p. 72L.
  5. ↑ Bernstein, P. A. (February 1988). "Sequoia: a fault-tolerant tightly coupled multiprocessor for transaction processing". Computer. IEEE. 21 (2): 37–45. doi:10.1109/2.17. S2CID 12418470.
  6. ↑ See:
  7. ↑ See:
  8. ↑ Tamari, Fumikazu (April 1984). "On linear codes which attain the Solomon–Stiffler bound". Discrete Mathematics. 49 (2): 179–191. doi:10.1016/0012-365X(84)90116-X. MR 0740436.
  9. ↑ Golomb, Solomon W.; Baumert, Leonard D.; Easterling, Mahlon F.; Stiffler, J. J.; Viterbi, Andrew J. (1964). Digital Communications with Space Applications. Prentice-Hall.
  10. ↑ Stiffler, J. J. (1971). Theory of Synchronous Communications. Prentice-Hall.
  11. ↑ Posner, Edward C.; Stevens, Robertson (May 1984). "Deep space communication – Past, present, and future". IEEE Communications Magazine. Vol. 22, no. 5. pp. 8–21. Bibcode:1984IComM..22....8P. doi:10.1109/MCOM.1984.1091955.
  12. ↑ Scholtz, Robert A. (January 1972). "Theory of Synchronous Communications – J. J. Stiffler". Book reviews. IEEE Transactions on Information Theory. 8 (1): 218–219. doi:10.1109/TIT.1972.1054730.
  13. ↑ Stiffler, J .J., ed. (October 1971). "Special issue on error-correcting codes". IEEE Transactions on Communication Technology. COM-19 (5 Pt. 2).
  14. ↑ Stiffler, J.J., ed. (June 1980). "Special issue on fault-tolerant computing". IEEE Transactions on Computers. C-29 (6).
  15. ↑ IEEE Communications Society. "Membership. IEEE Fellows 1975". Retrieved September 8, 2019.
  16. ↑ "About the IEEE Fellow program". www.ieee.org. Retrieved September 8, 2019.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.