DOCSLIB.ORG

MÁSTER UNIVERSITARIO EN INGENIERÍA DE TELECOMUNICACIÓN TRABAJO FIN DE MASTER Analysis and Implementation of New Techniques Fo

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
MÁSTER UNIVERSITARIO EN INGENIERÍA DE TELECOMUNICACIÓN TRABAJO FIN DE MASTER Analysis and Implementation of New Techniques Fo MÁSTER UNIVERSITARIO EN INGENIERÍA DE TELECOMUNICACIÓN TRABAJO FIN DE MASTER Analysis and Implementation of New Techniques for the Enhancement of the Reliability and Delay of Haptic Communications LUIS AMADOR GONZÁLEZ 2017 MASTER UNIVERSITARIO EN INGENIERÍA DE TELECOMUNICACIÓN TRABAJO FIN DE MASTER Título: Analysis and Implementation of New Techniques for the Enhancement of the Reliability and Delay of Haptic Communications Autor: D. Luis Amador González Tutor: D. Hamid Aghvami Ponente: D. Santiago Zazo Bello Departamento: MIEMBROS DEL TRIBUNAL Presidente: D. Vocal: D. Secretario: D. Suplente: D. Los miembros del tribunal arriba nombrados acuerdan otorgar la calificación de: ……… Madrid, a de de 20… UNIVERSIDAD POLITÉCNICA DE MADRID ESCUELA TÉCNICA SUPERIOR DE INGENIEROS DE TELECOMUNICACIÓN MASTER UNIVERSITARIO EN INGENIERÍA DE TELECOMUNICACIÓN TRABAJO FIN DE MASTER Analysis and Implementation of New Techniques for the Enhancement of the Reliability and Delay of Haptic Communications LUIS AMADOR GONZÁLEZ 2017 CONTENTS LIST OF FIGURES .....................................................................................2 LIST OF TABLES ......................................................................................3 ABBREVIATIONS .....................................................................................4 SUMMARY ............................................................................................5 RESUMEN .............................................................................................6 ACKNOWLEDGEMENTS .............................................................................7 1. INTRODUCTION .................................................................................8 1.1 Context .......................................................................................................................................... 8 1.2 Basics of a communication system ............................................................................................... 9 1.3 Encoding and decoding ............................................................................................................... 10 1.4 Research Objectives and Contribution ....................................................................................... 11 1.5 Thesis Organization ..................................................................................................................... 12 2. BACKGROUND ................................................................................ 15 2.1 Introduction to error control coding........................................................................................... 15 2.2 Linear Block Codes ...................................................................................................................... 16 2.2.1 Generator matrix for encoding ............................................................................................ 17 2.2.2 Parity Check Matrix .............................................................................................................. 17 2.2.3 Error Syndrome Testing ....................................................................................................... 18 2.2.4 Error Detection and Correction ........................................................................................... 19 2.2.5 Capabilities of Error Detection and Correction .................................................................... 20 2.3 Well-Known Block Codes ............................................................................................................ 22 2.3.1 Hamming codes.................................................................................................................... 22 2.3.2 Cyclic Codes .......................................................................................................................... 22 2.3.3 BCH Codes ............................................................................................................................ 27 2.3.4 Low Density Parity Check (LDPC) Codes............................................................................... 29 2.4 Haptics Communications ............................................................................................................ 31 2.4.1 Architecture ......................................................................................................................... 32 2.4.2 Haptic devices: Problems and challenges ............................................................................ 33 2.5 Explanation of the Patent to analyze and Implement ................................................................ 34 3. LDPC CODES ................................................................................. 36 3.1 Implementation .......................................................................................................................... 36 3.1.1 Parity check matrices: .......................................................................................................... 36 3.1.2 Encoding ............................................................................................................................... 37 3.1.3 Decoding .............................................................................................................................. 38 3.1.4 Block Size .............................................................................................................................. 38 3.2 LDPC Results for an AWGN Channel ........................................................................................... 38 3.2.1 First Embodiment: Haptic data sampled at 16 bit per DoF (6 DoF) ..................................... 38 3.2.2 Second Embodiment: Haptic data sampled at 32 bit per DoF (6DoF) ................................. 41 3.2.3 Third Embodiment: Haptic data sampled at 32 bit per DoF (7DoF) .................................... 43 3.3 Comparison of the three different block sizes for the BER and CWER ....................................... 45 3.4 Analysis of the Patent-Technique for LDPC ................................................................................ 46 4. SHORT LENGTH BCH CODES AND ITS COMPARISON WITH LDPC ................. 47 4.1 Implementation .......................................................................................................................... 47 4.1.1 Background information ...................................................................................................... 47 4.1.2 BCH Encoder and Decoder ................................................................................................... 48 4.1.3 Block Size .............................................................................................................................. 50 4.2 Results for an AWGN Channel .................................................................................................... 50 4.2.1 Comparing different block sizes for BCH ............................................................................. 50 4.2.2 Comparing the Patent-new technique and the normal-one-path case ............................... 51 4.2.3 Comparing BCH and LDPC over an AWGN Channel ............................................................. 52 5. ANALYSIS OF FADING CHANNELS ......................................................... 55 5.1 Challenge ..................................................................................................................................... 55 5.2 Classification ............................................................................................................................... 55 5.3 Fading Channel Models ............................................................................................................... 56 5.3.1 Frequency non selective: Flat fading channels .................................................................... 56 5.3.2 Frequency selective fading channels ................................................................................... 56 5.3.3 Slow versus Fast Fading Channels ........................................................................................ 57 5.4 Fading in Haptic Communications. Simulation Results. .............................................................. 58 5.4.1 Fading Environment: slow Rayleigh fading throughout bursts ............................................ 58 5.4.2 BCH Codes for Error Correction over a Rayleigh Channel .................................................... 59 5.4.3 BCH vs. LDPC Codes for Error Correction over a Rayleigh Channel ..................................... 60 5.4.4 Analysis of the Patent technique over a Rayleigh Channel with BCH Codes ....................... 61 6. IMPLEMENTATION OF DIVERSITY COMBINING TECHNIQUES ........................ 63 6.1 Diversity Combining Techniques ................................................................................................. 63 6.1.1 Maximum Ratio Combining ................................................................................................. 64 6.2 Increasing the number of RF paths for the Traditional Technique ............................................. 65 6.3 Increasing the number of paths for the Patent Technique......................................................... 67 6.4 Increasing the number of paths for both technique up to 4 (Traditional) and 8 (Patent) scaling the energy ........................................................................................................................................
Load more

Recommended publications
  • 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
    1 Channel Coding: The Road to Channel Capacity Daniel J. Costello, Jr., Fellow, IEEE, and G. David Forney, Jr., Fellow, IEEE Submitted to the Proceedings of the IEEE First revision, November 2006 Abstract Starting from Shannon’s celebrated 1948 channel coding theorem, we trace the evolution of channel coding from Hamming codes to capacity-approaching codes. We focus on the contributions that have led to the most significant improvements in performance vs. complexity for practical applications, particularly on the additive white Gaussian noise (AWGN) channel. We discuss algebraic block codes, and why they did not prove to be the way to get to the Shannon limit. We trace the antecedents of today’s capacity-approaching codes: convolutional codes, concatenated codes, and other probabilistic coding schemes. Finally, we sketch some of the practical applications of these codes. Index Terms Channel coding, algebraic block codes, convolutional codes, concatenated codes, turbo codes, low-density parity- check codes, codes on graphs. I. INTRODUCTION The field of channel coding started with Claude Shannon’s 1948 landmark paper [1]. For the next half century, its central objective was to find practical coding schemes that could approach channel capacity (hereafter called “the Shannon limit”) on well-understood channels such as the additive white Gaussian noise (AWGN) channel. This goal proved to be challenging, but not impossible. In the past decade, with the advent of turbo codes and the rebirth of low-density parity-check codes, it has finally been achieved, at least in many cases of practical interest. As Bob McEliece observed in his 2004 Shannon Lecture [2], the extraordinary efforts that were required to achieve this objective may not be fully appreciated by future historians.
    [Show full text]
  • President's Column
    IEEE Information Theory Society Newsletter Vol. 53, No. 3, September 2003 Editor: Lance C. Pérez ISSN 1059-2362 President’s Column Han Vinck This message is written after re- tion of the electronic library, many turning from an exciting Informa- universities and companies make tion Theory Symposium in this product available to their stu- Yokohama, Japan. Our Japanese dents and staff members. For these colleagues prepared an excellent people there is no direct need to be technical program in the beautiful an IEEE member. IEEE member- and modern setting of Yokohama ship reduced in general by about city. The largest number of contri- 10% and the Society must take ac- butions was in the field of LDPC tions to make the value of member- coding, followed by cryptography. ship visible to you and potential It is interesting to observe that new members. This is an impor- quantum information theory gets tant task for the Board and the more and more attention. The Jap- Membership Development com- anese hospitality contributed to IT Society President Han Vinck playing mittee. The Educational Commit- the general success of this year’s traditional Japanese drums. tee, chaired by Ivan Fair, will event. In spite of all the problems contribute to the value of member- with SARS, the Symposium attracted approximately 650 ship by introducing new activities. The first action cur- participants. At the symposium we announced Bob rently being undertaken by this committee is the McEliece to be the winner of the 2004 Shannon Award. creation of a web site whose purpose is to make readily The Claude E.
    [Show full text]
  • A Study on Convolutional Codes. Classification, New Families And
    A Study on Convolutional Codes. Classification, New Families and Decoding Jos´eIgnacio Iglesias Curto Tesis Doctoral dirigida por Jos´eMar´ıaMu˜nozPorras Jos´e Angel´ Dom´ınguez P´erez Departamento de Matem´aticas Universidad de Salamanca ii A Study on Convolutional Codes. Classification, New Families and Decoding Tesis presentada por Jos´eIgnacio Iglesias Curto para optar al t´ıtulo de Doctor por la Universidad de Salamanca Jos´eIgnacio Iglesias Curto, Doctorando Jos´eMar´ıaMu˜noz Porras, Director Jos´e Angel´ Dom´ınguez P´erez, Codirector Departamento de Matem´aticas Universidad de Salamanca iv Agradecimientos Mi primer agradecimiento es para mis padres, Jos´ey Petra, y para mis hermanos, Pedro y Ma Eugenia, que en todos estos a˜nos me han cuidado y apoyado y de cuyos esfuerzos me he servido para desarrollar mi formaci´ony poder dedicarme a la elaboraci´onde este trabajo. Y para el resto de mi familia, que han seguido muy de cerca mi esfuerzo en el desarrollo del mismo. Este´ no hubiera sido posible sin la direcci´on, consejo y orientaci´onde Jos´eMar´ıa Mu˜nozPorras, a quien debo agradecer la atenci´on, la ayuda y la confianza prestadas en todo este tiempo. Tambi´enquiero agradecer a Francisco Jos´ePlaza, Jos´e Angel´ Dom´ınguez, Gloria Serrano y Esteban G´omez su colaboraci´on, sus correcciones y sus observaciones, que me han ayudado enormemente. As´ı como al resto de profesores y personal del Departamento de Matem´aticasde la Universidad de Salamanca, que directa o indirectamente han facilitado mi trabajo y creado un entorno distendido donde poder llevarlo a cabo.
    [Show full text]
  • University of California Los Angeles
    University of California Los Angeles Robust Communication and Optimization over Dynamic Networks A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Electrical Engineering by Can Karakus 2018 c Copyright by Can Karakus 2018 ABSTRACT OF THE DISSERTATION Robust Communication and Optimization over Dynamic Networks by Can Karakus Doctor of Philosophy in Electrical Engineering University of California, Los Angeles, 2018 Professor Suhas N. Diggavi, Chair Many types of communication and computation networks arising in modern systems have fundamentally dynamic, time-varying, and ultimately unreliably available resources. Specifi- cally, in wireless communication networks, such unreliability may manifest itself as variability in channel conditions, intermittent availability of undedicated resources (such as unlicensed spectrum), or collisions due to multiple-access. In distributed computing, and specifically in large-scale distributed optimization and machine learning, this phenomenon manifests itself in the form of communication bottlenecks, straggling or failed nodes, or running background processes which hamper or slow down the computational task. In this thesis, we develop information-theoretically-motivated approaches that make progress towards building robust and reliable communication and computation networks built upon unreliable resources. In the first part of the thesis, we focus on three problems in wireless networks which involve opportunistically harnessing time-varying resources while providing theoretical per- formance guarantees. First, we show that in full-duplex uplink-downlink cellular networks, a simple, low-overhead user scheduling scheme that exploits the variations in channel con- ditions can be used to optimally mitigate inter-user interference in the many-user regime. Next, we consider the use of intermittently available links over unlicensed spectral bands to enhance communication over the licensed cellular band.
    [Show full text]
  • Andrew J. and Erna Viterbi Family Archives, 1905-20070335
    http://oac.cdlib.org/findaid/ark:/13030/kt7199r7h1 Online items available Finding Aid for the Andrew J. and Erna Viterbi Family Archives, 1905-20070335 A Guide to the Collection Finding aid prepared by Michael Hooks, Viterbi Family Archivist The Andrew and Erna Viterbi School of Engineering, University of Southern California (USC) First Edition USC Libraries Special Collections Doheny Memorial Library 206 3550 Trousdale Parkway Los Angeles, California, 90089-0189 213-740-5900 [email protected] 2008 University Archives of the University of Southern California Finding Aid for the Andrew J. and Erna 0335 1 Viterbi Family Archives, 1905-20070335 Title: Andrew J. and Erna Viterbi Family Archives Date (inclusive): 1905-2007 Collection number: 0335 creator: Viterbi, Erna Finci creator: Viterbi, Andrew J. Physical Description: 20.0 Linear feet47 document cases, 1 small box, 1 oversize box35000 digital objects Location: University Archives row A Contributing Institution: USC Libraries Special Collections Doheny Memorial Library 206 3550 Trousdale Parkway Los Angeles, California, 90089-0189 Language of Material: English Language of Material: The bulk of the materials are written in English, however other languages are represented as well. These additional languages include Chinese, French, German, Hebrew, Italian, and Japanese. Conditions Governing Access note There are materials within the archives that are marked confidential or proprietary, or that contain information that is obviously confidential. Examples of the latter include letters of references and recommendations for employment, promotions, and awards; nominations for awards and honors; resumes of colleagues of Dr. Viterbi; and grade reports of students in Dr. Viterbi's classes at the University of California, Los Angeles, and the University of California, San Diego.
    [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]
  • Mobile Communications ECS
    Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong [email protected] Overview of Digital Communication Systems Office Hours: BKD 3601-7 Monday 14:00-16:00 Wednesday 14:40-16:00 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 (Con’t) 1948: A Mathematical Theory of Communication Bell System Technical Journal, vol. 27, pp. 379-423, July- October, 1948. September 1949: Book published. Include a new section by Warren Weaver that applied Shannon's theory to Invent Information Theory: human communication. Simultaneously founded the subject, introduced all of the Create the architecture and major concepts, and stated and concepts governing digital proved all the fundamental communication.
    [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]
  • 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 Tuesday 9:00-10:00 Wednesday 14:20-15:20 1 Thursday 9:00-10:00 “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 An Interesting Book The Logician and the Engineer: How George Boole and Claude Shannon Created the Information Age by Paul J. Nahin ISBN: 9780691151007 http://press.princeton.edu/titles/ 9819.html 6 C.
    [Show full text]