DOCSLIB.ORG

Error Correction, Precoding and Bitloading Algorithms in High-Speed Access Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Error Correction, Precoding and Bitloading Algorithms in High-Speed Access Networks Foutcorrectie, precodering en bitallocatie-algoritmes in hogesnelheidstoegangsnetwerken Error Correction, Precoding and Bitloading Algorithms in High-Speed Access Networks Julie Neckebroek Promotor: prof. dr. ir. M. Moeneclaey Proefschrift ingediend tot het behalen van de graad van Doctor in de ingenieurswetenschappen: computerwetenschappen Vakgroep Telecommunicatie en Informatieverwerking Voorzitter: prof. dr. ir. H. Bruneel Faculteit Ingenieurswetenschappen en Architectuur Academiejaar 2016 - 2017 ISBN 978-90-8578-949-9 NUR 958 Wettelijk depot: D/2016/10.500/81 Members of the Jury Prof. Marc Moeneclaey • Ghent University Prof. Gert De Cooman • Ghent University Prof. Wout Joseph • Ghent University Prof. Mamoun Guenach • Nokia, Ghent University Prof. Jérôme Louveaux • Université catholique de Louvain, Louvain-la-Neuve Prof. Marc Moonen • KU Leuven i ii Dankwoord 9 jaar is niet de typische termijn van een doctoraat en hoewel ik het me initieel anders had vooropgesteld, vlogen de jaren voorbij. Gedurende die periode heb ik vele kansen gekregen en ik maak graag gebruik van deze paragraaf om de personen die ik dankbaar ben even in de aandacht te brengen. De dag dat mijn promotor professor Marc Moeneclaey naar me toe kwam om me te vragen als onderzoeker te starten bij DIGCOM, onder de vorm van een doctoraat, zal ik niet snel vergeten. Ik had alle keuzevakken gevolgd die gegeven werden bij DIGCOM (ondanks hun moeilijkheidsgraad) en was er dat jaar ook met mijn thesis gestart. Kortom, ik vond het fantastisch steeds meer bij te leren over wat er gebeurde in het gebied van de digitale communicatie. Ook al waren er interessante alternatieven, ik moest er niet lang over nadenken om daar te starten. Ik wil hierbij Marc dan in eerste instantie ook bedanken, voor de kans die hij mij gegeven heeft, al die tijd bezig te zijn met dingen die ik echt graag deed. Daarnaast ben ik Marc ook dankbaar voor zijn geweldige rol als promotor. Zijn deur stond al die jaren steeds open en het is indrukwekkend hoe hij elk ingewikkeld probleem op enkele bladen papier herleidt tot iets veel eenvoudigers. Ik heb heel veel van hem geleerd en ben dankbaar dat ik met hem heb mogen samenwerken. iii Ook Frederik Vanhaverbeke wil ik bedanken voor de begeleiding en de weg- wijs gedurende mijn thesis en de eerste jaren van mijn doctoraat. Voor de technische ondersteuning gaat mijn oprechte dank naar Davy en Philippe. Het dagelijkse werk dat zij uitvoeren is zeer waardevol. Het volledige systeem veilig, snel en up running houden en daarnaast ook steeds bereikbaar zijn voor hulp. Ook dankbaar ben ik de mensen van het secretariaat: Patrick, Sylvia en Annette. Zij maken ons het dagelijkse leven iets eenvoudiger door alle administratieve beslommeringen op zich te nemen. Zij zijn steeds bereidwillig en bezorgen de pakjes tot op onze bureau. Dankzij de samenwerking met Alcatel-Lucent (dat ondertussen Nokia heet) heb ik kunnen ervaren hoe onderzoek in de industrie zich afspeelt. Ik bedank dan ook in het bijzonder Mamoun Guenach, Jochen Maes, Michael Timmers, Werner Coomans, Paschalis Tsiaflakis, Rodrigo Moraes voor deze kans om mee te werken aan de ontwikkeling van G.fast. Ook Danny De Vleeschauwer, Koen- raad Laevens en Natalie Degrande ben ik dankbaar voor de interessante samen- werking. Voor de goede sfeer, ontspannende middaglunches in ons ‘favoriet’ restaurant De Brug, spelletjesavonden, badmintonwedstrijden, kubbtornooien, wedstrijden van de Rode Duivels, analyses van Game of Thrones afleveringen, ijsjes bij mooi weer, alle loop en triatlon events, de sportieve fietstocht,. bedank ik mijn collega’s en lunchgenoten uitvoerig! Ook de fijne momenten op conferenties in Barcelona, Taiwan, Londen, Budapest,. zal ik niet snel vergeten. Vele collega’s zijn ondertussen ook echte vrienden geworden. Mijn ouders wil ik graag bedanken voor al de kansen en ervaringen die ze me gegeven hebben. Het is echt ongelooflijk hoeveel ze op verschillende vlakken in ons geïnvesteerd hebben en mee gebouwd hebben aan de mensen die we vandaag geworden zijn. Zonder hen was het zeker onmogelijk geweest. Ik wil ook andere dichte familieleden bedanken voor hun oprechte interesse en steun. Voor ik dit dankwoord afsluit mag ik één iemand niet vergeten. Hij maakt mij het leven niet altijd gemakkelijk, maar desondanks is hij na al die jaren een deel van mij geworden en weet ik ondertussen dat ik niet meer zonder hem kan. Met hem is het leven nooit saai en heb ik vele nieuwe wegen betreden. Bedankt daarvoor! Julie Neckebroek - November 2016 iv Contents List of Abbreviations ix List of Notations xiii Nederlandstalige Samenvatting xvii English Summary xxi 1 Introduction 3 1.1 Background.............................. 3 1.2 Motivation .............................. 5 1.3 Outline ................................ 5 2 Error Control 7 2.1 UncodedTransmission ........................ 7 2.2 BasicPrinciplesofTCM....................... 8 2.2.1 SetPartitioning........................ 9 2.2.2 General Structure of TCM Encoder . 10 2.2.3 Convolutional Encoding . 10 v CONTENTS 2.2.4 TrellisDecoding ....................... 12 2.3 LDPCCodes ............................. 14 2.3.1 IterativeDecoding . 15 2.3.2 EXIT charts . 19 2.4 Space-TimeCodes .......................... 20 2.5 Reed-Solomon Codes . 21 2.6 Interleaving .............................. 23 2.7 Automatic Repeat Request Protocols . 25 2.8 Performance Indicators . 27 I Transmission over the DSL Channel 29 3 Introduction to DSL Communication 31 3.1 History ................................ 31 3.2 Crosstalk and Precoding . 35 3.3 ImpulsiveNoise............................ 36 4 DSL System Description 39 4.1 DSLChannelModel ......................... 39 4.2 Constellation Types . 43 4.2.1 Square-QAM . 44 4.2.2 Cross-QAM . 44 4.2.3 2-QAM . 46 4.2.4 8-QAM . 46 4.3 LinearPrecoding ........................... 47 4.3.1 Derivation of Linear Precoding Structure . 47 4.3.2 Transmit Energy . 49 4.3.3 Alternative Linear Precoding Structure . 49 4.3.4 Comparison of Different Constellations . 50 4.4 Nonlinear Precoding . 50 4.4.1 Derivation of Nonlinear Precoding Structure . 50 (k) 4.4.2 Selection of Ai ....................... 52 4.4.3 Transmit Energy . 52 4.4.4 Comparison of Constellations . 53 4.5 ImpulsiveNoise............................ 60 5 Error Performance with Linear and Nonlinear Precoding 65 5.1 Uncoded Transmission . 66 5.1.1 Linear Precoding . 66 5.1.2 Nonlinear Precoding . 70 5.1.3 RuleofThumb ........................ 70 5.1.4 Numerical Results . 71 5.2 Trellis-CodedModulation . 75 vi CONTENTS 5.2.1 TrellisCodeDescription . 75 5.2.2 Linear Precoding . 80 5.2.3 Nonlinear Precoding . 82 5.2.4 RuleofThumb ........................ 84 5.2.5 Numerical Results . 85 5.3 LDPCCodes ............................. 89 5.3.1 LDPC Code Description . 89 5.3.2 LDPCDecoding ....................... 91 5.3.3 Mutual Information of LLRs . 92 5.3.4 EXIT Chart Analysis. 93 5.3.5 Analysis of Finite-Length LDPC Codes . 97 5.3.6 RuleofThumb ........................ 98 5.3.7 Numerical Results . 99 5.4 TheEffectofIN ........................... 104 5.4.1 Uncoded Transmission and TCM . 104 5.4.2 LDPC Codes . 107 5.5 Interleaving against IN . 112 5.5.1 TCM + tone-interleaving . 116 5.5.2 RS+byte-interleaver+TCM . 117 5.6 Use of ARQ against IN . 122 5.6.1 Latency Constraint . 124 5.6.2 Theoretical Performance Analysis of ARQ . 127 6 Bitloading Algorithms 131 6.1 Shannon’s Channel Coding Theorem . 131 6.1.1 Information-Theoretic Bounds on Bitloading for Given SNR133 6.2 Practical Bitloading as a Function of SNR . 136 6.2.1 Bitloading Based on BER versus SNR Curves . 136 6.2.2 Bitloading Based on SNR Gap Γ . 136 6.3 Bitloading and Energy Allocation . 140 6.4 Extended Zanatta-Filho Algorithm . 141 6.5 Column Norm Scaling Algorithm . 144 6.6 EZF and CNS Complexity . 146 7 Information Rates in the Absence of Impulsive Noise 147 7.1 Uncoded Transmission . 148 7.2 TCM..................................153 7.3 LDPCCodes .............................159 7.4 RS+Byte-Interleaver+TCM . 162 7.5 Comparison . 164 7.6 ARQ..................................165 vii CONTENTS 8 Information Rates in the Presence of Impulsive Noise 173 8.1 Uncoded Transmission . 174 8.2 TCM..................................174 8.3 LDPCCodes .............................179 8.4 RS+Byte-Interleaver+TCM . 179 8.5 Information Rate Comparison . 182 8.6 Unknown Parameters of IN Model . 184 8.7 ARQ..................................186 II Video Transmission over Wireless Channel 195 9 Application Layer ARQ for Protecting Video Packets over an Indoor MIMO-OFDM Link with Correlated Block Fading 197 9.1 Introduction.............................. 198 9.2 SystemDescription. 200 9.3 System Analysis . 203 9.4 Numerical Results . 206 9.5 Conclusions and Remarks . 212 9.A Appendix ...............................215 9.A.1 Monte Carlo Integration with Importance Sampling . 215 10 Concluding Remarks and Directions for Future Research 217 10.1 Summarizing Conclusions . 217 10.2 Future Work . 219 10.2.1 Extensions to Our Work that Qualify for Future Research 219 10.2.2 Hybrid ARQ . 220 10.2.3 Other Correcting Codes . 225 10.3 Publications . 231 Bibliography 233 viii Abbreviations ADC Analog to Digital Converter ADSL Asymmetric Digital Subscriber Line ARQ Automatic Repeat Request ATP Aggregate Transmission Power BER Bit Error Rate CND Check Node Decoder CNS Column Norm Scaling CO Central Office CP Customer Premises CRC Cyclic Redundancy Check DMT Discrete Multitone DP Distribution Point DSL Digital Subscriber Line DSLAM DSL Access Multiplexer DTU Data Transfer Unit EZF
Load more

Recommended publications
  • Digital Communication Systems 2.2 Optimal Source Coding
    Digital Communication Systems EES 452 Asst. Prof. Dr. Prapun Suksompong [email protected] 2. Source Coding 2.2 Optimal Source Coding: Huffman Coding: Origin, Recipe, MATLAB Implementation 1 Examples of Prefix Codes Nonsingular Fixed-Length Code Shannon–Fano code Huffman Code 2 Prof. Robert Fano (1917-2016) Shannon Award (1976 ) Shannon–Fano Code Proposed in Shannon’s “A Mathematical Theory of Communication” in 1948 The method was attributed to Fano, who later published it as a technical report. Fano, R.M. (1949). “The transmission of information”. Technical Report No. 65. Cambridge (Mass.), USA: Research Laboratory of Electronics at MIT. Should not be confused with Shannon coding, the coding method used to prove Shannon's noiseless coding theorem, or with Shannon–Fano–Elias coding (also known as Elias coding), the precursor to arithmetic coding. 3 Claude E. Shannon Award Claude E. Shannon (1972) Elwyn R. Berlekamp (1993) Sergio Verdu (2007) David S. Slepian (1974) Aaron D. Wyner (1994) Robert M. Gray (2008) Robert M. Fano (1976) G. David Forney, Jr. (1995) Jorma Rissanen (2009) Peter Elias (1977) Imre Csiszár (1996) Te Sun Han (2010) Mark S. Pinsker (1978) Jacob Ziv (1997) Shlomo Shamai (Shitz) (2011) Jacob Wolfowitz (1979) Neil J. A. Sloane (1998) Abbas El Gamal (2012) W. Wesley Peterson (1981) Tadao Kasami (1999) Katalin Marton (2013) Irving S. Reed (1982) Thomas Kailath (2000) János Körner (2014) Robert G. Gallager (1983) Jack KeilWolf (2001) Arthur Robert Calderbank (2015) Solomon W. Golomb (1985) Toby Berger (2002) Alexander S. Holevo (2016) William L. Root (1986) Lloyd R. Welch (2003) David Tse (2017) James L.
    [Show full text]
  • Principles of Communications ECS 332
    Principles of Communications ECS 332 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพันธ ์ สขสมปองุ ) [email protected] 1. Intro to Communication Systems Office Hours: Check Google Calendar on the course website. Dr.Prapun’s Office: 6th floor of Sirindhralai building, 1 BKD 2 Remark 1 If the downloaded file crashed your device/browser, try another one posted on the course website: 3 Remark 2 There is also three more sections from the Appendices of the lecture notes: 4 Shannon's insight 5 “The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.” Shannon, Claude. A Mathematical Theory Of Communication. (1948) 6 Shannon: Father of the Info. Age Documentary Co-produced by the Jacobs School, UCSD- TV, and the California Institute for Telecommunic ations and Information Technology 7 [http://www.uctv.tv/shows/Claude-Shannon-Father-of-the-Information-Age-6090] [http://www.youtube.com/watch?v=z2Whj_nL-x8] C. E. Shannon (1916-2001) Hello. I'm Claude Shannon a mathematician here at the Bell Telephone laboratories He didn't create the compact disc, the fax machine, digital wireless telephones Or mp3 files, but in 1948 Claude Shannon paved the way for all of them with the Basic theory underlying digital communications and storage he called it 8 information theory. C. E. Shannon (1916-2001) 9 https://www.youtube.com/watch?v=47ag2sXRDeU C. E. Shannon (1916-2001) One of the most influential minds of the 20th century yet when he died on February 24, 2001, Shannon was virtually unknown to the public at large 10 C.
    [Show full text]
  • Marconi Society - Wikipedia
    9/23/2019 Marconi Society - Wikipedia Marconi Society The Guglielmo Marconi International Fellowship Foundation, briefly called Marconi Foundation and currently known as The Marconi Society, was established by Gioia Marconi Braga in 1974[1] to commemorate the centennial of the birth (April 24, 1874) of her father Guglielmo Marconi. The Marconi International Fellowship Council was established to honor significant contributions in science and technology, awarding the Marconi Prize and an annual $100,000 grant to a living scientist who has made advances in communication technology that benefits mankind. The Marconi Fellows are Sir Eric A. Ash (1984), Paul Baran (1991), Sir Tim Berners-Lee (2002), Claude Berrou (2005), Sergey Brin (2004), Francesco Carassa (1983), Vinton G. Cerf (1998), Andrew Chraplyvy (2009), Colin Cherry (1978), John Cioffi (2006), Arthur C. Clarke (1982), Martin Cooper (2013), Whitfield Diffie (2000), Federico Faggin (1988), James Flanagan (1992), David Forney, Jr. (1997), Robert G. Gallager (2003), Robert N. Hall (1989), Izuo Hayashi (1993), Martin Hellman (2000), Hiroshi Inose (1976), Irwin M. Jacobs (2011), Robert E. Kahn (1994) Sir Charles Kao (1985), James R. Killian (1975), Leonard Kleinrock (1986), Herwig Kogelnik (2001), Robert W. Lucky (1987), James L. Massey (1999), Robert Metcalfe (2003), Lawrence Page (2004), Yash Pal (1980), Seymour Papert (1981), Arogyaswami Paulraj (2014), David N. Payne (2008), John R. Pierce (1979), Ronald L. Rivest (2007), Arthur L. Schawlow (1977), Allan Snyder (2001), Robert Tkach (2009), Gottfried Ungerboeck (1996), Andrew Viterbi (1990), Jack Keil Wolf (2011), Jacob Ziv (1995). In 2015, the prize went to Peter T. Kirstein for bringing the internet to Europe. Since 2008, Marconi has also issued the Paul Baran Marconi Society Young Scholar Awards.
    [Show full text]
  • Channel Coding
    INVITED PAPER Channel Coding: The Road to Channel Capacity Fifty years of effort and invention have finally produced coding schemes that closely approach Shannon’s channel capacity limit on memoryless communication channels. By Daniel J. Costello, Jr., Fellow IEEE, and G. David Forney, Jr., Life Fellow IEEE ABSTRACT | Starting from Shannon’s celebrated 1948 channel As Bob McEliece observed in his 2004 Shannon coding theorem, we trace the evolution of channel coding from Lecture [2], the extraordinary efforts that were required Hamming codes to capacity-approaching codes. We focus on to achieve this objective may not be fully appreciated by the contributions that have led to the most significant future historians. McEliece imagined a biographical note improvements in performance versus complexity for practical in the 166th edition of the Encyclopedia Galactica along the applications, particularly on the additive white Gaussian noise following lines. channel. We discuss algebraic block codes, and why they did not prove to be the way to get to the Shannon limit. We trace Claude Shannon: Born on the planet Earth (Sol III) the antecedents of today’s capacity-approaching codes: con- in the year 1916 A.D. Generally regarded as the volutional codes, concatenated codes, and other probabilistic father of the Information Age, he formulated the coding schemes. Finally, we sketch some of the practical notion of channel capacity in 1948 A.D. Within applications of these codes. several decades, mathematicians and engineers had devised practical ways to communicate reliably at KEYWORDS | Algebraic block codes; channel coding; codes on data rates within 1% of the Shannon limit ..
    [Show full text]
  • Digital Communication Systems ECS 452
    Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong (ผศ.ดร.ประพันธ ์ สขสมปองุ ) [email protected] 1. Intro to Digital Communication Systems Office Hours: BKD, 6th floor of Sirindhralai building Monday 10:00-10:40 Tuesday 12:00-12:40 1 Thursday 14:20-15:30 “The fundamental problem of communication is that of reproducing at one point either exactly or approximately a message selected at another point.” Shannon, Claude. A Mathematical Theory Of Communication. (1948) 2 Shannon: Father of the Info. Age Documentary Co-produced by the Jacobs School, UCSD-TV, and the California Institute for Telecommunications and Information Technology Won a Gold award in the Biography category in the 2002 Aurora Awards. 3 [http://www.uctv.tv/shows/Claude-Shannon-Father-of-the-Information-Age-6090] [http://www.youtube.com/watch?v=z2Whj_nL-x8] C. E. Shannon (1916-2001) 1938 MIT master's thesis: A Symbolic Analysis of Relay and Switching Circuits Insight: The binary nature of Boolean logic was analogous to the ones and zeros used by digital circuits. The thesis became the foundation of practical digital circuit design. The first known use of the term bit to refer to a “binary digit.” Possibly the most important, and also the most famous, master’s thesis of the century. It was simple, elegant, and important. 4 C. E. Shannon: Master Thesis 5 Boole/Shannon Celebration Events in 2015 and 2016 centered around the work of George Boole, who was born 200 years ago, and Claude E. Shannon, born 100 years ago. Events were scheduled both at the University College Cork (UCC), Ireland and the Massachusetts Institute of Technology (MIT) 6 http://www.rle.mit.edu/booleshannon/ An Interesting Book The Logician and the Engineer: How George Boole and Claude Shannon Created the Information Age by Paul J.
    [Show full text]
  • Distance Path Because, 01 1 Regardless of What Happens Subsequently, This Path Will 0 × 4 Have a Larger Hamming 11 1/10 (1) 1 Distance from Y
    Direct Minimum Distance Decoding y Suppose = [11 01 11]. y Find . y Find the message which corresponds to the (valid) codeword with minimum (Hamming) distance from . y ܠപൌො ݀ ܠപǡܡ ܠപ പ + + 89 Direct Minimum Distance Decoding + y Suppose = [11 01 11]. y Find . + y Find the message which corresponds to the (valid) codeword with minimum (Hamming) distance from . ࢟ = [ 11 01 11 ]. 00 0/00 0/00 0/00 For 3-bit message, 3 10 there are 2 = 8 possible codewords. We can list all possible codewords. However, here, let’s first try to work 01 on the distance directly. 11 1/10 90 Direct Minimum Distance Decoding y Suppose = [11 01 11]. y Find . y Find the message which corresponds to the (valid) codeword with minimum (Hamming) distance from . The number in parentheses on each ࢟ = [ 11 01 11 ]. branch is the branch metric, obtained 0/00 (2) 0/00 (1) 0/00 (2) by counting the differences between 00 the encoded bits and the corresponding bits in ࢟. 10 01 11 1/10 (1) 91 Direct Minimum Distance Decoding y Suppose = [11 01 11]. y Find . y Find the message which corresponds to the (valid) codeword with minimum (Hamming) distance from . ࢟ = [ 11 01 11 ]. b d(x,y) 0/00 (2) 0/00 (1) 0/00 (2) 00 000 2+1+2 = 5 001 2+1+0 = 3 010 2+1+1 = 4 10 011 2+1+1 = 4 100 0+2+0 = 2 01 101 0+2+2 = 4 110 0+0+1 = 1 11 1/10 (1) 111 0+0+1 = 1 92 Viterbi decoding y Developed by Andrew J.
    [Show full text]
  • Digital Communication Systems ECS 452
    Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong [email protected] 4. Mutual Information and Channel Capacity Office Hours: Check Google Calendar on the course website. Dr.Prapun’s Office: 6th floor of Sirindhralai building, 1 BKD Reference for this chapter Elements of Information Theory By Thomas M. Cover and Joy A. Thomas 2nd Edition (Wiley) Chapters 2, 7, and 8 1st Edition available at SIIT library: Q360 C68 1991 2 Recall: Entropy [Page 72] 3 Recall: Entropy Entropy measures the amount of uncertainty (randomness) in a RV. Three formulas for calculating entropy: [Defn 2.41] Given a pmf of a RV , ≡∑ log . Set 0log00. [2.44] Given a probability vector , ≡∑ log. [Defn 2.47] Given a number , binary entropy ≡ log 1 log 1 function [2.56] Operational meaning: Entropy of a random variable is the average length of its shortest description. 4 Recall: Entropy Important Bounds deterministic uniform The entropy of a uniform (discrete) random variable: The entropy of a Bernoulli random variable: binary entropy function 5 Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong [email protected] Information-Theoretic Quantities 6 ECS315 vs. ECS452 ECS315 ECS452 We talked about randomness but we did not We study entropy. have a quantity that formally measures the amount of randomness. Back then, we studied variance and standard deviation. We talked about independence but we did We study mutual not have a quantity that completely measures information. the amount of dependency. Back then, we studied correlation, covariance, and uncorrelated random variables. 7 Recall: ECS315 2019/1 8 Information-Theoretic Quantities Information Diagram 9 Entropy and Joint Entropy Entropy Amount of randomness in Amount of randomness in , Joint Entropy , Amount of randomness in pair In general, There might be some shared randomness between and .
    [Show full text]
  • Ieee Richard W. Hamming Medal Recipients
    IEEE RICHARD W. HAMMING MEDAL RECIPIENTS 2021 RAYMOND W. YEUNG (FIEEE)— “For fundamental contributions to information theory Choh-Ming Li Professor of and pioneering network coding and its applications.” Information Engineering, The Chinese University of Hong Kong, Hong Kong, China 2020 CYNTHIA DWORK “For foundational work in privacy, cryptography, and Gordon McKay Professor of distributed computing, and for leadership in developing Computer Science, Harvard differential privacy.” University, Cambridge, Massachusetts, USA 2019 DAVID TSE “For seminal contributions to wireless network Professor, Stanford University, information theory and wireless network systems.” Stanford, California, USA 2018 ERDAL ARIKAN “For contributions to information and communications Professor, Department of theory, especially the discovery of polar codes and Electrical Engineering, Bilkent polarization techniques.” University, Ankara, Turkey 2017 SHLOMO SHAMAI “For fundamental contributions to information theory Professor, Technion-Israel and wireless communications.” Institute of Technology, Haifa, Israel 2016 ABBAS EL GAMAL “For contributions to network multi-user information Professor and Department theory and for wide ranging impact on programmable Chair, Department of Electrical circuit architectures.” Engineering, Stanford University, Stanford, California, USA 2015 IMRE CSISZAR “For contributions to information theory, information- Research Professor, A. Rényi theoretic security, and statistics.” Institute of Mathematics, Hungarian Academy of Sciences,
    [Show full text]
  • The Marconi Society Marconigram
    JOHN M. CIOFFI WINS 01 MARCONI PRIZE 02 SYmpOSIUM PROGRAM 03 NEW YORK FORUM ISSUE 5 SUMMER 2006 04 REGISTRATION FORM The Marconi Society Marconigram A P U B L I C at I O N P RODUCED BY T H E ma R C O N I S OCIE T Y at C O L U M BI A U N I V E R S I T Y 2006 MARCONI PRIZE TO BE AwARDED ON WEST COAST TO JOHN M. CIOFFI SOCIETY BOARD OF DIRECTORS Leading Stanford Researcher Board Chairman Robert W. Lucky and DSL Pioneer Receives Top Honor President John Jay Iselin Secretary-Treasurer Stanford University Electrical Society’s 32-year history that the William Wright, II Engineering Professor John M. event has been held on the West Cioffi, a prolific inventor whose Coast. The all-day Symposium Acting Director pioneering research helped create will take place at the Computer Nancy W. Collins DSL (digital subscriber line) History Museum. Public Affairs circuits which brings broadband “The annual Marconi Prize Hatti L. Hamlin Internet access to hundreds recognizes those living scientists of millions of people, has been who, like Guglielmo Marconi, Directors Sir Eric Ash named the 2006 Marconi Fellow. the inventor of radio, share the Paul Baran The prestigious award recognizes determination that advances in Alan Brinkley scientific contributions in the field communications and information George Bugliarello of communications science and technology be directed to the Jonathan Cole the Internet. social, economic and cultural Federico Faggin improvement of all humanity,” said Cioffi, they include Larry Page and Zvi Galil “LastING CONTRIBUTIONS John Jay Iselin, president of the Sergey Brin (Google co-founders), Robert W.
    [Show full text]
  • IEEE Information Theory Society Board of Governors Meeting
    itNL1206.qxd 11/7/06 8:58 AM Page 1 IEEE Information Theory Society Newsletter Vol. 56, No. 4, December 2006 Editor: Daniela Tuninetti ISSN 1059-2362 President’s Column David L. Neuhoff I would like to begin this column Finally, two areas of concern to information theorists were with a summary of the highlights of discussed. First, the apparently declining funding for infor- the September Board of Governors mation theory research in the US was discussed. It was decid- meeting at the Allerton Conference ed to form an ad hoc committee to examine the situation. on Communication, Control and Second, Sandeep Pradhan described the difficulty of obtain- Computing in Monticello, Illinois, ing classic information theory books that are now out of print. USA. As typically happens, recent The Board shares this concern and asked Sandeep to look for and forthcoming conferences and and propose possible solutions. workshops were reviewed. A pro- posal from Bill Ryan and Krishna By the time you read this, you should have seen the IEEE Narayanan to hold an IT Workshop membership renewal brochure for 2007, and I hope, renewed David L. Neuhoff in Lake Tahoe, California, USA, Sept. your IT membership. I also hope that you noticed the “IT 2-6, 2007 was approved. This joins Conference Digital Library” in the “What’s New for 2007”, as the June ISIT in Nice, France, and the July IT Workshop in well as the IT section of the brochure. This indicates that Bergen, Norway, as the principal IT sponsored meetings for online access to IT sponsored conference workshop proceed- 2007.
    [Show full text]
  • Here Are Considerable If You Like Numbers: 836 Participants of Which Hurdles to Be Passed
    IEEE Information Theory Society Newsletter Vol. 67, No. 3, September 2017 EDITOR: Michael Langberg, Ph.D. ISSN 1059-2362 Editorial committee: Alexander Barg, Giuseppe Caire, Meir Feder, Joerg Kliewer, Frank Kschischang, Prakash Narayan, Parham Noorzad, Anand Sarwate, Andy Singer, and Sergio Verdú. President’s Column Rüdiger Urbanke It was a pleasure to see many of you at ISIT in this to the printing of the first issues. Much still Aachen. As expected, it was perfectly organized. needs to be clarified and there are considerable If you like numbers: 836 participants of which hurdles to be passed. In particular, we are a 290 were students, 649 presentations out of 1028 relatively small Society with already many submissions in 160 sessions. But as impressive ongoing activities. It therefore remains to be as these numbers are, arguably more important seen if we can muster the necessary (human) is the content. And I saw much to my liking. resources. But I am excited about both of these The two keynotes by Urbashi Mitra and David projects and I hope you are as well. Tse (Shannon Lecture) perhaps best captured the new spirit of our society to boldly branch You probably have all heard by now that our out into new areas such as biology or machine Society is producing a Shannon documen- learning. We have much to contribute as these tary, directed by Mark Levinson, of Particle two talks showed. I would like to thank both Fever fame. It is a large undertaking by any of them for having the courage and foresight to measure and you might be eager to hear how lead the way.
    [Show full text]