DOCSLIB.ORG

Vladimir Aleksandrovich Kotelnikov: Pioneer of the Sampling Theorem, Cryptography, Optimal Detection, Planetary Mapping

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Vladimir Aleksandrovich Kotelnikov: Pioneer of the Sampling Theorem, Cryptography, Optimal Detection, Planetary Mapping Open Research Online The Open University’s repository of research publications and other research outputs Vladimir Aleksandrovich Kotelnikov: Pioneer of the sampling theorem, cryptography, optimal detection, planetary mapping Journal Item How to cite: Bissell, Christopher (2009). Vladimir Aleksandrovich Kotelnikov: Pioneer of the sampling theorem, cryptography, optimal detection, planetary mapping. IEEE Communications Magazine, 47(10) pp. 24–32. For guidance on citations see FAQs. c 2009 IEEE Version: Version of Record Link(s) to article on publisher’s website: http://dx.doi.org/doi:10.1109/MCOM.2009.5273804 Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online’s data policy on reuse of materials please consult the policies page. oro.open.ac.uk LYT-HISTORY-October 9/22/09 5:04 PM Page 24 HISTORY OF COMMUNICATIONS EDITED BY MISCHA SCHWARTZ INTRODUCTION BY EDITOR Kotelnikov has been well known for many years as the author Kotelnikov both as a human being and as an outstanding engi- of the monograph Theory of Optimum Noise Immunity. Those neer/scientist portrayed so effectively in Prof. Bissell’s article that of us teaching communication theory many years ago savored follows. It is especially interesting to learn that Dr. Kotelnikov our copies of the book, and often used it to augment textbook was probably the first person to demonstrate the by now well- material covering the subject. What was less known was who this known sampling theorem in the time domain. I commend the man was, and with what other activities he was involved. It is article to your attention. therefore a particular pleasure for me personally to see Vladimir —Mischa Schwarz VLADIMIR ALEKSANDROVICH KOTELNIKOV: PIONEER OF THE SAMPLING THEOREM, CRYPTOGRAPHY, OPTIMAL DETECTION, PLANETARY MAPPING… CHRIS BISSELL, OPEN UNIVERSITY ABSTRACT 1924. Shortly afterward Vladimir Alek- Russian monograph (essentially the In 1933 the young Russian communica- sandrovich began to study radio engi- author’s 1947 dissertation), appeared in tions engineer Vladimir Aleksandrovich neering as an undergraduate at what the United States in 1959. Kotelnikov’s Kotelnikov published a paper in which subsequently became the Moscow distinguished later career included a he formulated, for the first time in an Power Engineering Institute (MEI), leading role in the Soviet space pro- engineering context, the sampling theo- and he remained there to do postgradu- gram, directing work on planetary rem for lowpass and bandpass signals. ate work — although his ambition had observation and mapping, for which he He also considered the bandwidth been to join the Central Radio Labora- was awarded the prestigious Lenin requirements of discrete signal trans- tory. While still a postgraduate student Prize in 1964. He was Vice President of mission for telegraphy and images. he wrote the classic paper in which he the Soviet Academy of Sciences from Kotelnikov subsequently worked on derived, for the first time in an engi- 1969 to 1988. Other awards include the scrambling, cryptography, optimal neering context, the sampling theorem German Eduard Rhein Prize in 1999 detection, and planetary radar (includ- for band limited signals. At MEI he and the IEEE Alexander Graham Bell ing the radar-assisted cartography of also met his future wife, Anna Ivanovna Medal in 2000. In 2003 Kotelnikov cel- Venus). He was awarded numerous Bogatskaya; they married in 1938 and ebrated his 95th birthday; greetings Soviet and international prizes, and had three children. from Vladimir Putin, President of the played a major role in Soviet academic Following wartime research and Russian Federation, and congratulatory and professional life in the field of radio development work in Ufa (one of the remarks from the IEEE can be found engineering. Yet his achievements are temporary locations of scientific insti- in [1]. He died in February 2005. Most still comparatively little known outside tutions evacuated from Moscow), he of the biographical details in this arti- Russia. returned to Moscow in 1944, where he cle derive from [2]. became professor and then Dean of INTRODUCTION the Radioengineering Faculty at MEI THE SAMPLING THEOREM Vladimir Aleksandrovich Kotelnikov and finally, in 1954, Director of the Different societies quite naturally asso- was born in 1908 in Kazan into a family new Institute of Radioengineering and ciate seminal work with pioneers from with a long academic tradition. His Electronics of the USSR Academy of their own history, particularly when father was a university professor of Sciences. He was one of the founder such work is carried out independently mathematics, his aunt also taught math- members (1945) and later long-term within a few years in various geographi- ematics at a university, and his grandfa- President of the Popov Society for cal locations. The sampling theorem is ther had been Dean of Physics and Radio Engineering, Electronics and thus associated with Claude Shannon Mathematics at the University of Kazan Telecommunications. He gained his [3, 4] (and, somewhat erroneously, with as well as assistant to Nikolai Doctorate of Sciences1 in 1947 on the Harry Nyquist [5]) in the West, and Lobachevskii, one of the pioneers of topic of optimal detection and became with Vladimir Kotelnikov in Russia [6]. non-Euclidian geometry. a full Academician in 1953 — unusual- (Nyquist’s classic 1928 paper considered The first few years of the young ly, without the intervening stage of the maximum signaling rate over a band Vladimir’s life were happy, but in 1914 “corresponding member.” His book limited channel. He also noted the nec- the family attempted to move to Kiev, The Theory of Optimum Noise essary and sufficient conditions on the arriving on the day when the German Immunity, a translation of the 1956 number of coefficients of a Fourier Army broke through the Russian lines. series representing a band limited sig- Great upheavals and family tragedy nal. Because of this, and because the occurred as a result of a dreadful 1 The Russian Doktor Nauk degree is a higher Nyquist rate is equal numerically to the sequence of events: not only the First research degree awarded to distinguished minimum sampling rate for a band lim- World War, but then the Russian Rev- researchers on the basis of a thesis, not to be ited signal, the contributions of Nyquist olution, and finally a typhus outbreak in confused with the kandidat degree more akin to and Shannon to the notion of sampling 1921 that killed both his mother and his a Western Ph.D. or equivalent, which Kotel- have often become confused. Nyquist aunt. nikov was awarded in 1938 without a formal The family moved to Moscow in dissertation or viva voce examination. (Continued on page 26) 24 0163-6804/09/$25.00 © 2009 IEEE IEEE Communications Magazine • October 2009 Authorized licensed use limited to: The Open University. Downloaded on January 19, 2010 at 04:08 from IEEE Xplore. Restrictions apply. LYT-HISTORY-October 9/22/09 5:08 PM Page 26 CONEC IP67 Rated Connectors HISTORY OF COMMUNICATIONS When the Going Gets Tough. (Continued from page 24) did not consider explicitly the question of sampling a signal in the time domain.) Kotelnikov’s work is much less well known globally than that of the Ameri- can engineers; one of the aims of this paper is to contribute to an understand- ing of the international context of infor- mation engineering from the 1930s onward. Kotelnikov’s publication On the RJ 45 Cat.5e plug and receptacle Capacity of the “Ether” and Cables in housing kit, bayonet coupling, Electrical Communication was intended black plastic version, Partno. 17-10000 (receptacle) 17-10001 (plug) for a conference that never took place. Papers were, however, published in 1933. English translations have appeared as Chapter 2 of [7], in [2], and as [8]. Note, however, that [2] and [7] appear RJ 45 Cat.5e plug and receptacle housing kit, bayonet to have been translated by non-native coupling, plastic metallized version, Partno. 17-10011 (receptacle) 17-10013 (plug, plastic English speakers, and contain some coupling ring) 17-10044 (plug, metal coupling ring) minor stylistic and/or terminological inadequacies as indicated below. SETTING THE SCENE RJ45 Cat.5e plug Kotelnikov begins his 1933 paper by and receptacle stating the problem, which had gained housing kit, full metal version, M28 thread Figure 1. Kotelnikov as a young man. coupling ring, Partno. 17-100934 (receptacle) 17- in importance as a result of technologi- 100944 (plug plastic coupling ring) cal developments in telecommunica- tions in the 1920s and 1930s: THEORY In both wired and wireless engineering, The next eight pages of the paper USB 2.0 plug any transmission requires the use of not sim- derive theoretical results relating to and receptacle housing kit, bayonet coupling, ply a single frequency, but a whole range of lowpass and bandpass signals and their black plastic version, frequencies. As a result, only a limited num- transmission. Most significant, Kotel- Partno. 17-200161 (receptacle) 17-200121 (plug) ber of radio stations (broadcasting different nikov shows that any lowpass band programs) can operate simultaneously. Nei- limited function can be represented by ther is it possible to convey more than a a sequence of appropriate sin x/x wave- given number of channels at any one time forms; thus, a lowpass signal with USB 2.0 plug over a pair of wires, since the frequency bandwidth f can be reconstructed from and receptacle housing kit, full band of one channel must not overlap that a sequence of samples spaced at 1/2f metal version, M28 thread coupling ring, of another: such an overlap would lead to intervals used to weight sin x/x wave- Partno. 17-200321 (receptacle) 17-200331 (plug) mutual interference. forms.
Load more

Recommended publications
  • The Mathemathics of Secrets.Pdf
    THE MATHEMATICS OF SECRETS THE MATHEMATICS OF SECRETS CRYPTOGRAPHY FROM CAESAR CIPHERS TO DIGITAL ENCRYPTION JOSHUA HOLDEN PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Copyright c 2017 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu Jacket image courtesy of Shutterstock; design by Lorraine Betz Doneker All Rights Reserved Library of Congress Cataloging-in-Publication Data Names: Holden, Joshua, 1970– author. Title: The mathematics of secrets : cryptography from Caesar ciphers to digital encryption / Joshua Holden. Description: Princeton : Princeton University Press, [2017] | Includes bibliographical references and index. Identifiers: LCCN 2016014840 | ISBN 9780691141756 (hardcover : alk. paper) Subjects: LCSH: Cryptography—Mathematics. | Ciphers. | Computer security. Classification: LCC Z103 .H664 2017 | DDC 005.8/2—dc23 LC record available at https://lccn.loc.gov/2016014840 British Library Cataloging-in-Publication Data is available This book has been composed in Linux Libertine Printed on acid-free paper. ∞ Printed in the United States of America 13579108642 To Lana and Richard for their love and support CONTENTS Preface xi Acknowledgments xiii Introduction to Ciphers and Substitution 1 1.1 Alice and Bob and Carl and Julius: Terminology and Caesar Cipher 1 1.2 The Key to the Matter: Generalizing the Caesar Cipher 4 1.3 Multiplicative Ciphers 6
    [Show full text]
  • CECS 228 Lectures
    CECS 228 Lectures Darin Goldstein 1 Modular Arithmetic Introduction The modulus relation is special and is used in computer science all the time. You can think of all numbers in the world of (mod n) as being represented by what is left over when they are divided by n; therefore, all numbers are related to some number between 0 and n-1 in world of (mod n). You are allowed to add, subtract, and multiply in the world of (mod n), but not divide! Why not? What is 4 divided by 2 in the word of (mod 4)? Is it 0 or 2? Calculate the following expressions: • 7 + 9(mod 11) • 4 · 6(mod 11) • 43 · 172(mod 5) • 10017(mod 6) • 97(1023)52(mod 3) 1.1 Application Consider the following network: 1 Imagine that there is a source that is sending data through the network. (Netflix is streaming a movie, for example, to two customers.) For the sake of clarity, assume that the source can send only a single bit through each line segment per time unit. If there is only one customer (either side), then it is clear that the source can simultaneously send two bits of information through the network, both aimed at the same destination. However, if both of the destination nodes are considered customers, then there is contention for the middle link. If we treat the data as if it were water flowing through a pipe, it is clear that the source can only send 1 bit to each destination. In other words, Netflix would have to send the same bit to both customers, one to the left and one to the right, cutting down the throughput from 2 bits with one customer to 1 bit for 2 customers.
    [Show full text]
  • Social Movements and Electromagnetic Cyberspace
    rssN 2305-3224 |ililil]ruilffi[ililil] tnlfir i0) 06pa:onaHue u coBpeMeHHocrb. 2012, Ns 6(10) -43- rE OIO-]tr{TI{KA I{ IE O3I{OHOMIIITA Vl[t 81.2 (anr:r.) f79 SOCIAL MOVEMENTS AND ELECTROMAGNETIC CYBERSPACE Gleason G. Revolutions are always unexpected. Many ofthe great revolutions ofthe modem world - the Ameri- can Revolution of 1776, the French Revolution of 1789, the Russian Revolution of 1917. the Chinese Revo- political llH lution of 1949, the Iranian Revolution of 1978 as well as many others - are examples of sweeping change that toppled old regimes and replaced them with a new political order. These revolutions shared many features, but they were also different in many important respects. The revolutions differed in motiva- tion, in the values they championed, and the effects they brought about. All these revolutions prevailed be- cause in each case new political leaders and new social movements combined in ways which exceeded the HH lbl anticipations and capacities of the status-quo regimes which resisted them and which they replaced. It is quite possible that factors auguring for change in mary societies and in many circumstances were anticipated l..a and countered or deterred. Arguably, these were places ripe for revolution in which revolutions did not take place. The balance between the factors of change and the factors of stability shifted toward stability. What is so often unanticipated and unexpected is how the factors shift away from stability toward change [1]. As we survey the "Arab Spring" transformation that swept across the African Maghreb and the Middle East and compare these events with past revolutions, one particular feature stands out - the great speed at which these events took place.
    [Show full text]
  • One-Time Pad History
    One-Time Pad A one-time pad is a form of encryption that is difficult to decipher or crack if one is not the intended recipient. If done correctly, the strength of encryption of plaintext can almost be impossible to break in a useful timeframe. The system takes each character from plaintext and uses modular addition with a character from a pad or secret key of the same length of the plaintext to create ciphertext. If the key used to create the ciphertext is really random, as large or larger than the plaintext, never reused in any form, and kept truly secret, the ciphertext is unable to be decrypted in a usable timeframe. Although one-time pads are theoretically sound, there have been a number of practical implementation issues keeping the pads from seeing widespread use. When was the One-Time Pad Discovered? The one-time pad has been invented, an re-invented several times over the years. The technique was first described in 1882 by Frank Miller, and later “re-discovered in 1917” with a successful patent claim made a few years later. The current one-time pad concept is based on the Vernam cipher created by Gilbert Vernam and other co-workers. His cipher combined a message with a key that was read from a punch tape. In the original form of the cipher, the encoded messages could eventually be cracked since the key tape was setup on a loop that resulted in the key being reused making the cipher open to cryptanalysis. The “one-time” aspect of the cipher came into play a bit later when Joseph Mauborgne discovered the fact that if they key tape was fully random, cryptanalysis would be difficult if not impossible.
    [Show full text]
  • Creating a Rocket Industry Rockets and People Volume II: Creating a Rocket Industry
    Rockets and People Volume II: Creating a Rocket Industry Rockets and People Volume II: Creating a Rocket Industry Boris Chertok Asif Siddiqi, Series Editor For sale by the Superintendent of Documents, U.S. Government Printing Office Internet: bookstore.gpo.gov Phone: toll free (866) 512-1800; DC area (202) 512-1800 Fax: (202) 512-2250 Mail: Stop SSOP, Washington, DC 20402-0001 The NASA History Series National Aeronautics and Space Administration NASA History Division Office of External Relations Washington, DC June 2006 NASA SP-2006-4110 I dedicate this book to the cherished memory of my wife and friend, Yekaterina Semyonova Golubkina. Library of Congress Cataloging-in-Publication Data Chertok, B. E. (Boris Evseevich), 1912– [Rakety i lyudi. English] Rockets and People: Creating a Rocket Industry (Volume II) / by Boris E. Chertok ; [edited by] Asif A. Siddiqi. p. cm. — (NASA History Series) (NASA SP-2006-4110) Includes bibliographical references and index. 1. Chertok, B. E. (Boris Evseevich), 1912– 2. Astronautics— Soviet Union—Biography. 3. Aerospace engineers—Soviet union— Biography. 4. Astronautics—Soviet Union—History. I. Siddiqi, Asif A., 1966- II. Title. III. Series. IV. SP-2006-4110. TL789.85.C48C4813 2006 629.1’092—dc22 2006020825 Contents Series Introduction by Asif A. Siddiqi ix Introduction to Volume II xxi A Few Notes about Transliteration and Translation xxiii List of Abbreviations xxv 1 Three New Technologies, Three State Committees 1 2 The Return 25 3 From Usedom Island to Gorodomlya Island 43 4 Institute No. 88 and Director
    [Show full text]
  • ELEC 3004 Quiz 1 Review
    ELEC 3004 Quiz 1 Review PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Fri, 30 Mar 2012 09:52:21 UTC Contents Articles Signals 1 Signal (electronics) 1 Even and odd functions 3 Linear system 6 Time-invariant system 8 Causal system 10 Sampling 12 Sampling (signal processing) 12 Nyquist–Shannon sampling theorem 16 Aliasing 29 Quantization (signal processing) 34 Convolution 42 Convolution 42 Appendix: Systems & Laplace 53 Ordinary differential equation 53 Laplace transform applied to differential equations 62 Fourier transform 63 Harmonic oscillator 83 References Article Sources and Contributors 94 Image Sources, Licenses and Contributors 96 Article Licenses License 97 1 Signals Signal (electronics) A signal is any stream of quantities in time or spatial sequence. Signals categorizes to the fields of communications, signal processing, and to electrical engineering more generally. Signals may contain and transport information in coded form like modulation. In that case the actual quantities are finally not used, but are decoded in a detector or demodulator. In the physical world, any quantity measurable through time or over space can be taken as a signal. Within a complex society, any set of human information or machine data can also be taken as a signal. Such information or machine data (for example, the dots on a screen, the ink making up text on a paper page, or the words now flowing into the reader's mind) must all be part of systems existing in the physical world – either living or non-living. Despite the complexity of such systems, their outputs and inputs can often be represented as simple quantities measurable through time or across space.
    [Show full text]
  • Pestel Analysis of Russia
    A Global Country Study Report On Russia Submitted to Institute Code: 769 Institute Name: GIDC Rajju Shroff ROFEL Institute of Management Studies Vapi In partial Fulfilment of the Requirement of the award for the degree of Master of Business Administration (MBA) By Gujarat Technological University Ahmedabad Prepared by: Students of MBA (Semester - III and IV) PART – I OVERVIEW OF BUSINESS & TRADE IN RUSSIA DEMOGRAPHIC PROFILE OF RUSSIA Population – 138,739,892 (July 2011 est.) Age structure – 0-14 years: 15.2% (male 10,818,203/female 10,256,611) 15-64 years: 71.8% (male 47,480,851/female 52,113,279) 65 years and over: 13% (male 5,456,639/female 12,614,309) (2011 est.) Median age – Total: 38.7 years Male: 35.5 years Female: 41.9 years (2011 est.) Population growth rate – 0.47% (2011 est.) Birth rate – 11.05 births/1,000 population (2011 est.) Death rate – 16.04 deaths/1,000 population (July 2011 est.) Urbanization – Urban population: 73% of total population (2010) Rate of urbanization: -0.2% annual rate of change (2010-15 est.) Sex ratio – At birth: 1.06 male(s)/female Under 15 years: 1.06 male(s)/female 15-64 years: 0.92 male(s)/female 65 years and over: 0.44 male(s)/female Total population ratio: 0.85 male(s)/female (2011 est.) Infant mortality rate – Total: 10.08 deaths/1,000 live births Male: 11.58 deaths/1,000 live births Female: 8.49 deaths/1,000 live births (2011 est.) Life expectancy at birth – Total population: 66.29 years Male: 59.8 years Female: 73.17 years (2011 est.) Ethnic groups – Russian 79.8%, Tatar 3.8%, Ukrainian 2%,
    [Show full text]
  • Shannon, Beethoven, and the Compact Disc
    itNL1207.qxd 11/19/07 11:31 AM Page 1 IEEE Information Theory Society Newsletter Vol. 57, No. 4, Dec. 2007 Editor: Daniela Tuninetti ISSN 1059-2362 Teaching it XXVIII Shannon Lecture, presented on Thursday, June 28, 2007 at the 2007 IEEE International Symposium on Information Theory, Nice, France Sergio Verdú Having attended all Shannon Lectures since Bob Soon after I began doing research in information Gallager’s in 1983, I have enjoyed the variety of theory, I started teaching it, and since then, one ways in which Shannon lecturers have risen to has influenced and (hopefully) benefited from the challenge, ranging from surveys to open the other. I structured my Shannon lecture so as problems, from tutorials to unveiling of new to highlight several points of departure of my research results. My favorite Shannon lectures teaching from the traditional approaches, while managed to find a unifying theme with a strong giving myself a chance to showcase some of my autobiographical component mixed with a sense own research results. I reckon that for any sixty- of historical perspective. year old discipline one would be hard-pressed to argue that there is anything radically new we As I started to ponder a topic for my lecture, it can come up with while teaching the basics. became apparent that identifying a unifying Furthermore, the presumption is that after so theme in my information theory research would many excellent and influential textbooks, the be challenging. Over the years, I have moved established approaches should have found a from problem to problem with scarcely more pretty good approximation to the most enlight- sense of recognizable direction than a random ening path.
    [Show full text]
  • Computer-History2
    1948: Information Theory first use of the "bit" term Claude Shannon (1916-2001) Source: Shannon C., "A Mathematical Theory of Communication", C.Shannon, Bell System Technical Journal, 1948 1 / 30 Shannon Entropy (bits) Shannon Entropy = Expected Value (average) of the Information Contained in Each Message b=2, P(x ) = 2-n, =2n i m m m m H(X) = - ∑ P(x ) log P(x ) = - ∑ (2-n) log (2-n) = - log (2-n) ∑ (2-n) i 2 i 2 2 i=1 i=1 n i=1 m 2 -n ∑ P(x ) = ∑ (2 ) = 1 i i=1 i=1 -n H(X) = - log (2 ) (1) = - (-n) log (2) (1) = - (-n) (1) (1) = n (bits) 2 2 log ( ) bits needed to represent a variable that can take one of values 2 m m if m is a power of 2, m=2n, if these values are equally probable, the Entropy equal to the number of bits n 2 / 30 1949: Teorema di Nyquist-Shannon S(t) fM Harry Nyquist ΔT t Claude Shannon (1889-1976) (1916-2001) Dato un segnale analogico S(t) la cui banda di frequenze sia limitata dalla frequenza , fM il segnale S(t) puo© essere univocamente ricostruito a partire dai suoi campioni presi a frequenza = 1 / se > 2 fS ΔT fS fM (es. = 20 KHz, > 40 KHz, ΔT < 1/40.000 = 2.5 10-5 sec. = 25 μsec) fM fS See also 1933: Vladimir Kotelnikov (1908-2005) Information Theory and Radar Astronomy Pioneer Soviet Union, Russian Academy of Science Shannon, Claude E. (January 1949). "Communication in the presence of noise".
    [Show full text]
  • Rockets and People
    Rockets and People Volume III:Hot Days of the Cold War For sale by the Superintendent of Documents, U.S. Government Printing Office ISBN 978-0-16-081733-5 Internet: bookstore.gpo.gov Phone: toll free (866) 512-1800; DC area (202) 512-1800 9 0 0 0 0 Fax: (202) 512-2104 Mail: Stop IDCC, Washington, DC 20402-0001 ISBN 978-0-16-081733-5 9 780160 817335 For sale by the Superintendent of Documents, U.S. Government Printing Office ISBN 978-0-16-081733-5 Internet: bookstore.gpo.gov Phone: toll free (866) 512-1800; DC area (202) 512-1800 9 0 0 0 0 Fax: (202) 512-2104 Mail: Stop IDCC, Washington, DC 20402-0001 ISBN 978-0-16-081733-5 9 780160 817335 Rockets and People Volume III:Hot Days of the Cold War Boris Chertok Asif Siddiqi, Series Editor The NASA History Series National Aeronautics and Space Administration NASA History Division Office of External Relations Washington, DC May 2009 NASA SP-2009-4110 Library of Congress Cataloging-in-Publication Data Chertok, B. E. (Boris Evseevich), 1912– [Rakety i lyudi. English] Rockets and People: Hot Days of the Cold War (Volume III) / by Boris E. Chertok ; [edited by] Asif A. Siddiqi. p. cm. — (NASA History Series) (NASA SP-2009-4110) Includes bibliographical references and index. 1. Chertok, B. E. (Boris Evseevich), 1912– 2. Astronautics— Soviet Union—Biography. 3. Aerospace engineers—Soviet Union— Biography. 4. Astronautics—Soviet Union—History. I. Siddiqi, Asif A., 1966– II. Title. III. Series. IV. SP-2009-4110. TL789.85.C48C4813 2009 629.1’092—dc22 2009020825 I dedicate this book to the cherished memory of my wife and friend, Yekaterina Semyonova Golubkina.
    [Show full text]