Robust Coding Strategies and Physical Layer Service Integration for Bidirectional Relaying

Total Page:16

File Type:pdf, Size:1020Kb

Robust Coding Strategies and Physical Layer Service Integration for Bidirectional Relaying TECHNISCHE UNIVERSITÄT MÜNCHEN Lehrstuhl für Theoretische Informationstechnik Robust Coding Strategies and Physical Layer Service Integration for Bidirectional Relaying Rafael Felix Wyrembelski Vollständiger Abdruck der von der Fakultät für Elektrotechnik und Informationstechnik der Technischen Universität München zur Erlangung des akademischen Grades eines Doktor-Ingenieurs (Dr.-Ing.) genehmigten Dissertation. Vorsitzender: Univ.-Prof. Dr. sc. techn. Gerhard Kramer Prüfer der Dissertation: 1. Univ.-Prof. Dr.-Ing. Dr. rer. nat. Holger Boche 2. Prof. Dr. Vincent Poor (Princeton University, USA) Die Dissertation wurde am 06.10.2011 bei der Technischen Universität München eingereicht und durch die Fakultät für Elektrotechnik und Informationstechnik am 22.03.2012 angenom- men. Zusammenfassung Aktuelle Forschungsergebnisse zeigen, dass Relaiskonzepte die Leistungsfähigkeit und Ab- deckung drahtloser Kommunikationssysteme deutlich erhöhen können. In dieser Disserta- tion betrachten wir bidirektionale Relais-Kommunikation in einem Netzwerk mit drei Statio- nen, in dem zwei Stationen mit Hilfe einer Relaisstation kommunizieren. Im ersten Teil der Dissertation analysieren wir die Auswirkungen ungenauer Kanalkennt- nis an Sender und Empfängern und betrachten den dazugehörigen diskreten gedächtnis- losen bidirektionalen Compound Broadcastkanal. Wir leiten die Kapazitätsregion her und analysieren die Szenarien, in denen zusätzlich entweder der Sender oder die Empfänger per- fekte Kanalkenntnis besitzen. Hierbei zeigt sich, dass Kanalkenntnis an den Empfängern keinen Einfluss auf die Kapazitätsregion hat, während Kanalkenntnis am Sender diese ver- größern kann. Anschließend betrachten wir bidirektionale Relais-Kommunikation in unkoordinierten drahtlosen Netzwerken. In solchen Netzwerken wird die Kommunikation durch unbekannte, sich beliebig ändernde Interferenz gestört. Wir betrachten den diskreten gedächtnislosen bidirektionalen beliebig variierenden Broadcastkanal und leiten die Kapazitätsregion für deterministische und randomisierte Kodierungsstrategien her. Weiterhin analysieren wir Empfänger mit Listen-Dekodierern und charakterisieren die zugehörige Kapazitätsregion in Abhängigkeit der erlaubten Listengrößen und der Symmetrisierung des Kanals. Im letzten Teil der Dissertation betrachten wir die effiziente Implementierung verschiedener Dienste auf der physikalischen Schicht für bidirektionale Relais-Netzwerke mit diskreten gedächtnislosen Kanälen sowie für Netzwerke mit mehreren Antennen. Wir betrachten die Implementierung von Multicast Diensten und analysieren den bidirektionalen Broad- castkanal mit gemeinsamen Nachrichten. Wir leiten die entsprechende Kapazitätsregion her. Dabei zeigt sich, dass die kapazitätserreichenden Strategien für die bidirektionalen Broad- castkanäle mit und ohne gemeinsamen Nachrichten eng miteinander verbunden sind. An- schließend betrachten wir die Implementierung von zusätzlichen vertraulichen Nachrichten. Wir nutzen das Kriterium der informationstheoretischen Sicherheit, um die zugehörigen Sicherheitskapazitätsregionen herzuleiten. Im abschließenden Fazit geben wir einen Ausblick auf offene Probleme und zukünftige Forschungsrichtungen. iii Abstract Recent research developments show that the concept of bidirectional relaying significantly improves the performance and coverage in wireless networks. In this thesis we consider bidirectional relaying in a three-node network, where a relay establishes a bidirectional com- munication between two other nodes using a decode-and-forward protocol. In the first part we consider the problem of imperfect channel state information and study the discrete memoryless compound bidirectional broadcast channel. We derive the capacity region and further discuss the cases where either the transmitter or the receivers have perfect channel state information. It shows that channel knowledge on the receiver side has no influence on the achievable rates while on the transmitter side it increases the capacity. In the next part we consider bidirectional relaying in uncoordinated wireless networks, where the communication is disturbed by unknown varying interference from other transmitters outside the bidirectional relay network. Accordingly, we study the discrete memoryless arbitrarily varying bidirectional broadcast channel and derive the corresponding capacity regions for deterministic and random coding strategies. We further study the influence of list decoding and characterize the list capacity region in terms of the list sizes at the receivers and of the symmetrizability of the channel. Then we impose constraints on the permissible codewords and sequences of channel states and finally analyze the case of unknown varying additive interference. In the last part we address the problem of physical layer service integration in discrete memo- ryless and multi-antenna Gaussian bidirectional relay networks. First, we consider multicast services and, accordingly, study the bidirectional broadcast channel with common messages. We derive the capacity region and thereby establish a strong connection with the correspond- ing scenario without common messages. Then, we take into account that there are also ser- vices with certain secrecy constraints. We use the concept of information theoretic security to model this requirement and study the additional integration of confidential messages. We derive the capacity-equivocation and secrecy capacity regions. Finally, we end with a conclusion and give an outlook on open problems and future research directions. iv Acknowledgments During my time at the Technische Universität Berlin and the Technische Universität Mün- chen I had the opportunity to meet many interesting persons. First and foremost, I want to thank my advisor Prof. Holger Boche for giving me the opportunity to work with him. I am grateful for the scientific freedom, his support, and endless motivation. I would also like to express my sincere gratitude to Prof. Vincent Poor for serving as the second referee of this dissertation. Further, I thank Prof. Gerhard Kramer for acting as the chairman of my thesis committee. I want to thank all my colleagues for the pleasant social atmosphere and the stimulating discussions. Many thanks go to Tobias Oechtering for collaborating with me and guiding me in my first steps. Further, I thank Igor Bjelakovic´ for collaborating with me and teaching me information theory down to the very last detail. Special thanks go to Ullrich Mönich for sharing the room with me most of the time of our Ph.D. studies. My heartfelt gratitude goes to my family for their love and unquestioning support. Finally, my special and heartfelt thanks go to Anabel. Without her love and encouragement this work would not have been possible. v Contents 1 Introduction 1 1.1 Motivation . 1 1.2 Contribution and Outline of the Thesis . 4 2 Decode-and-Forward Bidirectional Relaying 7 2.1 Multiple Access Phase . 8 2.2 Bidirectional Broadcast Phase . 9 2.3 Bidirectional Achievable Rate Region . 12 3 Bidirectional Relaying Under Channel Uncertainty 13 3.1 Compound Multiple Access Channel . 15 3.2 Compound Bidirectional Broadcast Channel . 16 3.3 Universal Strategy and Capacity Region . 18 3.3.1 Finite Compound Channel . 19 3.3.2 Arbitrary Compound Channel . 23 3.4 Partial Channel State Information at Transmitter or Receivers . 25 3.4.1 CSI at the Receivers . 25 3.4.2 CSI at the Transmitter . 26 3.5 Numerical Example and Game-Theoretic Interpretation . 30 3.6 Discussion . 32 4 Bidirectional Relaying in Uncoordinated Networks 34 4.1 Arbitrarily Varying Multiple Access Channel . 36 4.2 Arbitrarily Varying Bidirectional Broadcast Channel . 40 4.3 Random Code Construction . 44 4.3.1 Compound Bidirectional Broadcast Channel . 46 4.3.2 Robustification . 47 4.3.3 Converse . 48 4.4 Deterministic Code Construction . 49 4.4.1 Random Code Reduction . 49 4.4.2 Elimination of Randomness . 51 4.5 List Decoding . 53 4.5.1 Symmetrizability . 53 vii Contents 4.5.2 Achieving Positive Rates . 54 4.6 Input and State Constraints . 66 4.6.1 Random Code Capacity Region . 69 4.6.2 Deterministic Code Capacity Region . 72 4.7 Unknown Varying Additive Interference . 78 4.7.1 Traditional Interference Coordination . 79 4.7.2 Relay-to-Receivers Coordination . 82 4.8 Discussion . 83 5 Physical Layer Service Integration in Bidirectional Relay Networks 85 5.1 Bidirectional Broadcast Channel with Common and Confidential Messages 87 5.2 Integration of Common Messages . 89 5.2.1 Capacity Region for Discrete Memoryless Channels . 89 5.2.2 Capacity Region for MIMO Gaussian Channels . 93 5.2.3 Covariance Optimization Problem . 97 5.2.4 Capacity Achieving Transmit Strategies . 98 5.2.5 Applications . 105 5.3 Integration of Confidential Messages . 106 5.3.1 Bidirectional Broadcast Channel with Confidential Messages . 106 5.3.2 Secrecy-Achieving Coding Strategy . 107 5.3.3 Converse . 115 5.4 Integration of Common and Confidential Messages . 117 5.4.1 Achievability . 119 5.4.2 Converse . 121 5.5 Confidential Messages in MIMO Gaussian Bidirectional Relay Networks . 122 5.5.1 Aligned MIMO Bidirectional Broadcast Channel . 124 5.5.2 General MIMO Bidirectional Broadcast Channel . 132 5.5.3 Numerical Example and Discussion . 135 5.6 Discussion . 138 6 Conclusion 139 A Additional Proofs 143 B Types and Typical Sequences 169 Publication List 176 References 180 viii List of Figures 2.1 Decode-and-Forward Bidirectional Relaying . 7 3.1 Bidirectional relaying under channel uncertainty . 14 3.2 Capacity regions of the compound BBC . 31 3.3 Compound BBC
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]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 63, No. 3, September 2013 Editor: Tara Javidi ISSN 1059-2362 Editorial committee: Ioannis Kontoyiannis, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Anand Sarwate, Andy Singer, and Sergio Verdú Annual Awards Announced The main annual awards of the • 2013 IEEE Jack Keil Wolf ISIT IEEE Information Theory Society Student Paper Awards were were announced at the 2013 ISIT selected and announced at in Istanbul this summer. the banquet of the Istanbul • The 2014 Claude E. Shannon Symposium. The winners were Award goes to János Körner. the following: He will give the Shannon Lecture at the 2014 ISIT in 1) Mohammad H. Yassaee, for Hawaii. the paper “A Technique for Deriving One-Shot Achiev - • The 2013 Claude E. Shannon ability Results in Network Award was given to Katalin János Körner Daniel Costello Information Theory”, co- Marton in Istanbul. Katalin authored with Mohammad presented her Shannon R. Aref and Amin A. Gohari Lecture on the Wednesday of the Symposium. If you wish to see her slides again or were unable to attend, a copy of 2) Mansoor I. Yousefi, for the paper “Integrable the slides have been posted on our Society website. Communication Channels and the Nonlinear Fourier Transform”, co-authored with Frank. R. Kschischang • The 2013 Aaron D. Wyner Distinguished Service Award goes to Daniel J. Costello. • Several members of our community became IEEE Fellows or received IEEE Medals, please see our web- • The 2013 IT Society Paper Award was given to Shrinivas site for more information: www.itsoc.org/honors Kudekar, Tom Richardson, and Rüdiger Urbanke for their paper “Threshold Saturation via Spatial Coupling: The Claude E.
    [Show full text]
  • Sharp Threshold Rates for Random Codes∗
    Sharp threshold rates for random codes∗ Venkatesan Guruswami1, Jonathan Mosheiff1, Nicolas Resch2, Shashwat Silas3, and Mary Wootters3 1Carnegie Mellon University 2Centrum Wiskunde en Informatica 3Stanford University September 11, 2020 Abstract Suppose that P is a property that may be satisfied by a random code C ⊂ Σn. For example, for some p 2 (0; 1), P might be the property that there exist three elements of C that lie in some Hamming ball of radius pn. We say that R∗ is the threshold rate for P if a random code of rate R∗ + " is very likely to satisfy P, while a random code of rate R∗ − " is very unlikely to satisfy P. While random codes are well-studied in coding theory, even the threshold rates for relatively simple properties like the one above are not well understood. We characterize threshold rates for a rich class of properties. These properties, like the example above, are defined by the inclusion of specific sets of codewords which are also suitably \symmetric." For properties in this class, we show that the threshold rate is in fact equal to the lower bound that a simple first-moment calculation obtains. Our techniques not only pin down the threshold rate for the property P above, they give sharp bounds on the threshold rate for list-recovery in several parameter regimes, as well as an efficient algorithm for estimating the threshold rates for list-recovery in general. arXiv:2009.04553v1 [cs.IT] 9 Sep 2020 ∗SS and MW are partially funded by NSF-CAREER grant CCF-1844628, NSF-BSF grant CCF-1814629, and a Sloan Research Fellowship.
    [Show full text]
  • Symposium in Remembrance of Rudolf Ahlswede
    in cooperation with Fakultät für Mathematik Department of Mathematics Symposium in Remembrance of Rudolf Ahlswede July 25 -26, 2011 Program and Booklet of Abstracts Symposium in Remembrance of Rudolf Ahlswede Bielefeld, Germany, July 25 -26, 2011 Program and Booklet of Abstracts Organizers: Harout Aydinian Ingo Alth¨ofer Ning Cai Ferdinando Cicalese Christian Deppe Gunter Dueck Ulrich Tamm Andreas Winter Contents 1 Program 1 2 Rudolf Ahlswede 1938-2010 5 Christian Deppe 3 Obituary of the ZIF 11 Manuela Lenzen 4 AZ-identity for regular posets 13 Harout Aydinian 5 Quantum information, the ambiguity of the past, and the complexity of the present 15 Charles Bennett 6 Local-global principles in discrete extremal problems 17 Sergei L. Bezrukov 7 Secure network coding 19 Ning Cai 8 Common randomness in information theory 21 Imre Csisz´ar 9 The deep impact of Rudolf Ahlswede on combinatorics 23 Gyula O. H. Katona 10 Common randomness and multiterminal secure computation 25 Prakash Narayan 11 String reconstruction from substring compositions 27 Alon Orlitsky 12 Stochastic search for locally clustered targets 29 K. R¨udigerReischuk 13 Information flows and bottle necks in dynamic communication networks 31 Soren Riis 14 On the complexity of families of binary sequences and lattices 33 Andras Sarkozy 15 Higher order extremal problems 35 L´aszl´oSz´ekely 16 A generalisation of the Gilbert-Varshamov bound and its asymptotic evaluation 37 Ludo Tolhuizen 17 Quantum channels and identification theory 39 Andreas Winter 18 List of Participants 41 iii Monday July 25, 2011 PROGRAM 10:15 Warm up: C. Bennett - Quantum information, the ambiguity of the past, and the complexity of the present 12:00 Welcome and registration at the ZiF - Chair C.
    [Show full text]
  • Reflections on ``Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes
    Reflections on \Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes" Venkatesan Guruswami∗ Madhu Sudany March 2002 n A t-error-correcting code over a q-ary alphabet Fq is a set C ⊆ Fq such that for any received n vector r 2 Fq there is at most one vector c 2 C that lies within a Hamming distance of t from r. The minimum distance of the code C is the minimum Hamming distance between any pair of distinct vectors c1; c2 2 C. In his seminal work introducing these concepts, Hamming pointed out that a code of minimum distance 2t + 1 is a t-error-correcting code. It also pointed out the obvious fact that such a code is not a t0-error-correcting code for any t0 > t. We conclude that a code can correct half as many errors as its distance and no more. The mathematical correctness of the above statements are indisputable, yet the interpretation is quite debatable. If a message encoded with a t-error-correcting code ends up getting corrupted in t0 > t places, the decoder may simply throw it hands up in the air and cite the above paragraph. Or, in an alternate notion of decoding, called list decoding, proposed in the late 1950s by Elias [10] and Wozencraft [43], the decoder could try to output a list of codewords within distance t0 of the received vector. If t0 is not much larger than t and the errors are caused by a probabilistic (non-malicious) channel, then most likely this list would have only one element | the transmitted codeword.
    [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]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 66, No. 4, December 2016 Editor: Michael Langberg ISSN 1059-2362 Editorial committee: Frank Kschischang, Giuseppe Caire, Meir Feder, Tracey Ho, Joerg Kliewer, Parham Noorzad, Anand Sarwate, Andy Singer, and Sergio Verdú President’s Column Alon Orlitsky One should never start with a cliche. So let me that would bring and curate information the- end with one: where did 2016 go? It seems like oretic lectures for large audiences. yesterday that I wrote my first column, and it’s already time to reflect on a year gone by? • Jeff Andrews and Elza Erkip are heading a BoG ad-hoc committee exploring the cre- And a remarkable year it was! Each of earth’s ation of a new publication connecting corners and all of life’s walks were abuzz with information theory to other topics and activity and change, and information theory communities, with two main formats con- followed suit. Adding to our society’s regu- sidered: a special topics journal, and a larly hectic conference meeting/publication popular magazine. calendar, we also celebrated Shannon’s 100th anniversary with fifty worldwide centennials, • Christina Fragouli and Anna Scaglione are numerous write-ups in major journals and co-authoring a children’s book on informa- magazines, and a coveted Google Doodle on tion theory, the first chapter is completed Shannon’s birthday. For the last time let me and the rest are expected next year. thank Christina Fragouli and Rudi Urbanke for co-chairing the hyperactive Centennials Committee. As the holidays ushered in, twelve-shy-one society members received jolly good tidings.
    [Show full text]
  • IEEE Information Theory Society Newsletter
    IEEE Information Theory Society Newsletter Vol. 53, No. 1, March 2003 Editor: Lance C. Pérez ISSN 1059-2362 LIVING INFORMATION THEORY The 2002 Shannon Lecture by Toby Berger School of Electrical and Computer Engineering Cornell University, Ithaca, NY 14853 1 Meanings of the Title Information theory has ... perhaps The title, ”Living Information Theory,” is a triple enten- ballooned to an importance beyond dre. First and foremost, it pertains to the information its actual accomplishments. Our fel- theory of living systems. Second, it symbolizes the fact low scientists in many different that our research community has been living informa- fields, attracted by the fanfare and by tion theory for more than five decades, enthralled with the new avenues opened to scientific the beauty of the subject and intrigued by its many areas analysis, are using these ideas in ... of application and potential application. Lastly, it is in- biology, psychology, linguistics, fun- tended to connote that information theory is decidedly damental physics, economics, the theory of the orga- alive, despite sporadic protestations to the contrary. nization, ... Although this wave of popularity is Moreover, there is a thread that ties together all three of certainly pleasant and exciting for those of us work- these meanings for me. That thread is my strong belief ing in the field, it carries at the same time an element that one way in which information theorists, both new of danger. While we feel that information theory is in- and seasoned, can assure that their subject will remain deed a valuable tool in providing fundamental in- vitally alive deep into the future is to embrace enthusias- sights into the nature of communication problems tically its applications to the life sciences.
    [Show full text]
  • Abelian Varieties in Coding and Cryptography
    IEEE Information Theory Society Newsletter Vol. 61, No. 1, March 2011 Editor: Tracey Ho ISSN 1045-2362 Editorial committee: Helmut Bölcskei, Giuseppe Caire, Meir Feder, Joerg Kliewer, Anand Sarwate, and Andy Singer President’s Column Giuseppe Caire I am deeply honored to serve as your Society too often forgotten by many politicians and peo- president for 2011. I’d like to begin with ac- ple with responsibilities around the world. On knowledging my recent predecessors, Frank the other hand, we have a lot of work to do and Kschischang (Junior Past President) and Andrea we must be proactive in facing the challenges Goldsmith (Senior Past President), as well as that the future is putting in front of us. Dave Forney, who has offi cially ended his ser- vice as an offi cer of the IT Society on December While our Information Theory Transactions 31st, 2010, after a long and perhaps unmatched continues to rank at the top of the ISI Journal history of leadership and guidance, that stands Citation Report among all journals in Electri- as a reference for all of us. Under their lead, the cal and Electronic Engineering and Computer IT Society has sailed through some signifi cant Science in total citations, and fi rst among all storms, such as an unprecedented economic re- journals in Electrical Engineering, Computer cession, causing turmoil for IEEE fi nances, and a Science and Applied Mathematics according number of sad events, including the premature to the Eigenfactor tm score, the “sub-to-pub” passing of Shannon Lecturer Rudolf Ahlswede time (i.e., the length of the time between fi rst and other notables.
    [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: BKD, 6th floor of Sirindhralai building Wednesday 13:45-15:15 Friday 13:45-15:15 1 “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]
  • Channel Coding in Optical Communication Systems
    Transport and Communications, 2016; Vol. II. DOI: 10.26552/tac.C.2016.2.1 ISSN: 1339-5130 1 Channel Coding in Optical Communication Systems Viktor Durcek1, Michal Kuba2, Milan Dado3 1,2,3Dept. of Telecommunications and Multimedia, Faculty of Electrical Engineering, University of Žilina, Univerzitná 8215/1, 010 26 Žilina, Slovakia Abstract In this paper, an overview of various types of error-correcting codes is present. Three generations of forward error correction methods used in optical communication systems are listed and described. Forward error correction schemes proposed for use in future high-speed optical networks can be found in the third generation of codes. Keywords FEC, channel coding, LDPC, Turbo codes JEL C690 Hamming codes are still used in some types of ECC 1. Introduction memories [2], [4-5]. In 1954 David E. Muller described a class of Forward Error Correction (FEC) is an important part of multiple-error-correcting codes [6] and Irving S. Reed modern communication systems. Throughout history new proposed the first algorithm for decoding these codes types of channel codes and FEC schemes with higher (known as majority decoding) [7]. Today this class of binary error-correcting performance were introduced. In section 2 linear block codes is called Reed-Muller codes. Their of this paper, an overview of different types of channel advantage is simple description and simple decoding codes is shown. Methods of error correction used in optical algorithm [2]. networks are described and divided into generations in Convolutional codes are a class of linear time-invariant section 3. FEC schemes proposed to be used in future tree codes and can be generated by a linear shift-register optical networks are also mentioned in section 3.
    [Show full text]