Communication & Computation A need for a new unifying theory. Madhu Sudan Microsoft Research + MIT

Size: px
Start display at page:

Download "Communication & Computation A need for a new unifying theory. Madhu Sudan Microsoft Research + MIT"

Transcription

1 Communication & Computation A need for a new unifying theory Madhu Sudan Microsoft Research + MIT October 6-7, 2010 Emerging Frontiers of Information: Kickoff 1 of 13

2 Theory of Communication Shannon s architecture for communication over noisy channel m Encoder Noisy Channel Y = E(m) Ŷ Decoder D(Ŷ) = m? Yields reliable communication (and storage (= communication across time)). 04/28/2009 UT-Austin: Communication & Computation 2 of 13

3 Encoders & Decoders? Mathematically: (arbitrary) functions. Physically: Pieces of hardware to compute certain functions. (Mathematical/Physical question): Why should the set of functions required have nice hardware to compute them? October 6-7, 2010 Emerging Frontiers of Information: Kickoff 3 of 13

4 Theory of Computing Encodings of other machines Turing architecture von Neumann architecture Universal Machine Finite State CPU Control R/W RAM One machine to rule them all! 04/28/2009 UT-Austin: Communication & Computation 4 of 13

5 Consequence Any ((polynomial time) computable) function does have nice hardware. However Requires reliable CPU $ RAM Requires reliable RAM Conclusion: Computing needs Communication Communication needs Computing (we are extremely lucky to get out of the loop) October 6-7, 2010 Emerging Frontiers of Information: Kickoff 5 of 13

6 ~ 70 years since Computing and Communication thriving Separate theoretically Unified physically (in gadgets in my pocket). My Opinion: Need to unify the theories Why? Need to know the limits of what can be done Need to know what is being done? What are? Modern practice has rich mix of computing/communication apps? What is the problem space? What is the solution space? October 6-7, 2010 Emerging Frontiers of Information: Kickoff 6 of 13

7 Communication: Goals, Semantics To make for reliable, useful, communication: Need to formalize: Goals of communication In each usage Why is each player communicating? What is the end effect that it desires? What is each player assuming about others? How will it know if something goes wrong? Communication should preserve meaning: Players allow for, and recover from, misunderstandings at endpoints. October 6-7, 2010 Emerging Frontiers of Information: Kickoff 7 of 13

8 The Meaning of Bits Alice Freeze! Channel Bob Bob Why did miscommunication occur? Alice assumed Bob knows colloquial English; But she s actually talking to some Bob who doesn t. October 6-7, 2010 Emerging Frontiers of Information: Kickoff 8 of 13

9 Modelling Miscommunication Classical Semantic Shannon Communication Model Model A 1 B 1 A 2 A 3 A Channel B B 2 B 3 A k B j October 6-7, 2010 Emerging Frontiers of Information: Kickoff 9 of 13

10 Our claims (based on joint works with Juba, Goldreich, Kalai, Khanna) Semantic Communication can be achieved with almost full diversity If goals of communication are formally captured and sensible ; and players are helpful [GJS] Communication does offer advantages even in purely informational settings [JS1] Can be attained almost w.l.o.efficiency [JS2] Explains difference between engineered and natural communication (e.g., ambiguity in natural language) [JKKS] October 6-7, 2010 Emerging Frontiers of Information: Kickoff 10 of 13

11 Communicating Knowledge [JS1] Knowledge (X) = Subset of Information (X) Useful/Useable Not known without X. [Goldwasser,Micali,Rackoff ~86] Knowledge Information (usually <<) In all practical settings: Suffices to communication Knowledge. Can be communicated with misunderstanding. Can be used to overcome misunderstanding. Because it is useful! October 6-7, 2010 Emerging Frontiers of Information: Kickoff 11 of 13

12 Going Forward Need to build robust theory of why (anyone/everyone) communicate(s) Combine with Semantics Needed to improve Improve Reliability Reduce Vulnerability Increase efficiency A 1 B 1 A 2 A 3 A k Channel B 2 B 3 B j Safely transfer all information to digital form. October 6-7, 2010 Emerging Frontiers of Information: Kickoff 12 of 13

13 References [JS1]: Juba and Sudan, STOC [GJS]: Goldreich, Juba, and Sudan, ECCC 2009 [JS2]: Juba and Sudan, ICS 2011 (to appear) [JKKS]: Juba, Kalai, Khanna, Sudan, ICS 2011 (to appear) October 6-7, 2010 Emerging Frontiers of Information: Kickoff 13 of 13

Copyright 2003 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Slides prepared by Walid A. Najjar & Brian J.

Copyright 2003 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Slides prepared by Walid A. Najjar & Brian J. Introduction to Computing Systems from bits & gates to C & beyond Chapter 1 Welcome Aboard! This course is about: What computers consist of How computers work How they are organized internally What are

More information

Local Algorithms & Error-correction

Local Algorithms & Error-correction Local Algorithms & Error-correction Madhu Sudan Microsoft Research July 25, 2011 Local Error-Correction 1 Prelude Algorithmic Problems in Coding Theory New Paradigm in Algorithms The Marriage: Local Error-Detection

More information

Background Dirty Paper Coding Codeword Binning Code construction Remaining problems. Information Hiding. Phil Regalia

Background Dirty Paper Coding Codeword Binning Code construction Remaining problems. Information Hiding. Phil Regalia Information Hiding Phil Regalia Department of Electrical Engineering and Computer Science Catholic University of America Washington, DC 20064 regalia@cua.edu Baltimore IEEE Signal Processing Society Chapter,

More information

ICS312 Machine-level and Systems Programming

ICS312 Machine-level and Systems Programming Computer Architecture and Programming: Examples and Sample Problems ICS312 Machine-level and Systems Programming Henri Casanova (henric@hawaii.edu) 0000 1100 Somehow, the is initialized to some content,

More information

arxiv: v2 [cs.cc] 18 Mar 2013

arxiv: v2 [cs.cc] 18 Mar 2013 Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete Daniel Grier arxiv:1209.1750v2 [cs.cc] 18 Mar 2013 University of South Carolina grierd@email.sc.edu Abstract. A poset game is a

More information

Lecture 1 What is AI?

Lecture 1 What is AI? Lecture 1 What is AI? CSE 473 Artificial Intelligence Oren Etzioni 1 AI as Science What are the most fundamental scientific questions? 2 Goals of this Course To teach you the main ideas of AI. Give you

More information

Self-interested agents What is Game Theory? Example Matrix Games. Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1

Self-interested agents What is Game Theory? Example Matrix Games. Game Theory Intro. Lecture 3. Game Theory Intro Lecture 3, Slide 1 Game Theory Intro Lecture 3 Game Theory Intro Lecture 3, Slide 1 Lecture Overview 1 Self-interested agents 2 What is Game Theory? 3 Example Matrix Games Game Theory Intro Lecture 3, Slide 2 Self-interested

More information

Implementation of Recursively Enumerable Languages in Universal Turing Machine

Implementation of Recursively Enumerable Languages in Universal Turing Machine Implementation of Recursively Enumerable Languages in Universal Turing Machine Sumitha C.H, Member, ICMLC and Krupa Ophelia Geddam Abstract This paper presents the design and working of a Universal Turing

More information

Problem 4.R1: Best Range

Problem 4.R1: Best Range CSC 45 Problem Set 4 Due Tuesday, February 7 Problem 4.R1: Best Range Required Problem Points: 50 points Background Consider a list of integers (positive and negative), and you are asked to find the part

More information

Information & Communication

Information & Communication Information & Communication Bachelor Informatica 2014/15 January 2015 Some of these slides are copied from or heavily inspired by the University of Illinois at Chicago, ECE 534: Elements of Information

More information

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI

DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI DHANALAKSHMI COLLEGE OF ENGINEERING, CHENNAI Department of Computer Science and Engineering CS6503 THEORY OF COMPUTATION 2 Mark Questions & Answers Year / Semester: III / V Regulation: 2013 Academic year:

More information

EM Simulation of Automotive Radar Mounted in Vehicle Bumper

EM Simulation of Automotive Radar Mounted in Vehicle Bumper EM Simulation of Automotive Radar Mounted in Vehicle Bumper Abstract Trends in automotive safety are pushing radar systems to higher levels of accuracy and reliable target identification for blind spot

More information

The Nature of Informatics

The Nature of Informatics The Nature of Informatics Alan Bundy University of Edinburgh 19-Sep-11 1 What is Informatics? The study of the structure, behaviour, and interactions of both natural and artificial computational systems.

More information

COMPSCI 223: Computational Microeconomics - Practice Final

COMPSCI 223: Computational Microeconomics - Practice Final COMPSCI 223: Computational Microeconomics - Practice Final 1 Problem 1: True or False (24 points). Label each of the following statements as true or false. You are not required to give any explanation.

More information

Minmax and Dominance

Minmax and Dominance Minmax and Dominance CPSC 532A Lecture 6 September 28, 2006 Minmax and Dominance CPSC 532A Lecture 6, Slide 1 Lecture Overview Recap Maxmin and Minmax Linear Programming Computing Fun Game Domination Minmax

More information

Goals of this Course. CSE 473 Artificial Intelligence. AI as Science. AI as Engineering. Dieter Fox Colin Zheng

Goals of this Course. CSE 473 Artificial Intelligence. AI as Science. AI as Engineering. Dieter Fox Colin Zheng CSE 473 Artificial Intelligence Dieter Fox Colin Zheng www.cs.washington.edu/education/courses/cse473/08au Goals of this Course To introduce you to a set of key: Paradigms & Techniques Teach you to identify

More information

Introduction. Lecture 0 ICOM 4075

Introduction. Lecture 0 ICOM 4075 Introduction Lecture 0 ICOM 4075 Information Ageis the term used to refer to the present era, beginning in the 80 s. The name alludes to the global economy's shift in focus away from the manufacturing

More information

Senior Math Circles February 10, 2010 Game Theory II

Senior Math Circles February 10, 2010 Game Theory II 1 University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles February 10, 2010 Game Theory II Take-Away Games Last Wednesday, you looked at take-away

More information

Computing and Communications 2. Information Theory -Channel Capacity

Computing and Communications 2. Information Theory -Channel Capacity 1896 1920 1987 2006 Computing and Communications 2. Information Theory -Channel Capacity Ying Cui Department of Electronic Engineering Shanghai Jiao Tong University, China 2017, Autumn 1 Outline Communication

More information

Lecture 1 What is AI?

Lecture 1 What is AI? Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey With material adapted from Oren Etzioni (UW) and Stuart Russell (UC Berkeley) Outline 1) What is AI: The Course 2) What is AI:

More information

The Co-Evolvability of Games in Coevolutionary Genetic Algorithms

The Co-Evolvability of Games in Coevolutionary Genetic Algorithms The Co-Evolvability of Games in Coevolutionary Genetic Algorithms Wei-Kai Lin Tian-Li Yu TEIL Technical Report No. 2009002 January, 2009 Taiwan Evolutionary Intelligence Laboratory (TEIL) Department of

More information

Digital Transmission using SECC Spring 2010 Lecture #7. (n,k,d) Systematic Block Codes. How many parity bits to use?

Digital Transmission using SECC Spring 2010 Lecture #7. (n,k,d) Systematic Block Codes. How many parity bits to use? Digital Transmission using SECC 6.02 Spring 2010 Lecture #7 How many parity bits? Dealing with burst errors Reed-Solomon codes message Compute Checksum # message chk Partition Apply SECC Transmit errors

More information

Single Error Correcting Codes (SECC) 6.02 Spring 2011 Lecture #9. Checking the parity. Using the Syndrome to Correct Errors

Single Error Correcting Codes (SECC) 6.02 Spring 2011 Lecture #9. Checking the parity. Using the Syndrome to Correct Errors Single Error Correcting Codes (SECC) Basic idea: Use multiple parity bits, each covering a subset of the data bits. No two message bits belong to exactly the same subsets, so a single error will generate

More information

Game theory Computational Models of Cognition

Game theory Computational Models of Cognition Game theory Taxonomy Rational behavior Definitions Common games Nash equilibria Mixed strategies Properties of Nash equilibria What do NE mean? Mutually Assured Destruction 6 rik@cogsci.ucsd.edu Taxonomy

More information

Introduction to Computer Science

Introduction to Computer Science Introduction to CS, 2003 p.1 Introduction to Computer Science Ian Leslie with thanks to Robin Milner, Andrew Pitts and others... Computer Laboratory In the beginning... Introduction to CS, 2003 p.2 Introduction

More information

Algorithmic Game Theory and Applications. Kousha Etessami

Algorithmic Game Theory and Applications. Kousha Etessami Algorithmic Game Theory and Applications Lecture 17: A first look at Auctions and Mechanism Design: Auctions as Games, Bayesian Games, Vickrey auctions Kousha Etessami Food for thought: sponsored search

More information

Introduction to Coding Theory

Introduction to Coding Theory Coding Theory Massoud Malek Introduction to Coding Theory Introduction. Coding theory originated with the advent of computers. Early computers were huge mechanical monsters whose reliability was low compared

More information

TIME encoding of a band-limited function,,

TIME encoding of a band-limited function,, 672 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 53, NO. 8, AUGUST 2006 Time Encoding Machines With Multiplicative Coupling, Feedforward, and Feedback Aurel A. Lazar, Fellow, IEEE

More information

On Range of Skill. Thomas Dueholm Hansen and Peter Bro Miltersen and Troels Bjerre Sørensen Department of Computer Science University of Aarhus

On Range of Skill. Thomas Dueholm Hansen and Peter Bro Miltersen and Troels Bjerre Sørensen Department of Computer Science University of Aarhus On Range of Skill Thomas Dueholm Hansen and Peter Bro Miltersen and Troels Bjerre Sørensen Department of Computer Science University of Aarhus Abstract At AAAI 07, Zinkevich, Bowling and Burch introduced

More information

Interpolation Error in Waveform Table Lookup

Interpolation Error in Waveform Table Lookup Carnegie Mellon University Research Showcase @ CMU Computer Science Department School of Computer Science 1998 Interpolation Error in Waveform Table Lookup Roger B. Dannenberg Carnegie Mellon University

More information

From Wireless Network Coding to Matroids. Rico Zenklusen

From Wireless Network Coding to Matroids. Rico Zenklusen From Wireless Network Coding to Matroids Rico Zenklusen A sketch of my research areas/interests Computer Science Combinatorial Optimization Matroids & submodular funct. Rounding algorithms Applications

More information

ECE 4400:693 - Information Theory

ECE 4400:693 - Information Theory ECE 4400:693 - Information Theory Dr. Nghi Tran Lecture 1: Introduction & Overview Dr. Nghi Tran (ECE-University of Akron) ECE 4400:693 Information Theory 1 / 26 Outline 1 Course Information 2 Course Overview

More information

Design High speed Reed Solomon Decoder on FPGA

Design High speed Reed Solomon Decoder on FPGA Design High speed Reed Solomon Decoder on FPGA Saroj Bakale Agnihotri College of Engineering, 1 Wardha, India. sarojvb87@gmail.com Dhananjay Dabhade Assistant Professor, Agnihotri College of Engineering,

More information

Error Control Coding. Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria

Error Control Coding. Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria Error Control Coding Aaron Gulliver Dept. of Electrical and Computer Engineering University of Victoria Topics Introduction The Channel Coding Problem Linear Block Codes Cyclic Codes BCH and Reed-Solomon

More information

Computer Science as a Discipline

Computer Science as a Discipline Computer Science as a Discipline 1 Computer Science some people argue that computer science is not a science in the same sense that biology and chemistry are the interdisciplinary nature of computer science

More information

On the Complexity of Broadcast Setup

On the Complexity of Broadcast Setup On the Complexity of Broadcast Setup Martin Hirt, Pavel Raykov ETH Zurich, Switzerland {hirt,raykovp}@inf.ethz.ch July 5, 2013 Abstract Byzantine broadcast is a distributed primitive that allows a specific

More information

CS429: Computer Organization and Architecture

CS429: Computer Organization and Architecture CS429: Computer Organization and Architecture Dr. Bill Young Department of Computer Sciences University of Texas at Austin Last updated: November 8, 2017 at 09:27 CS429 Slideset 14: 1 Overview What s wrong

More information

Error Correcting Code

Error Correcting Code Error Correcting Code Robin Schriebman April 13, 2006 Motivation Even without malicious intervention, ensuring uncorrupted data is a difficult problem. Data is sent through noisy pathways and it is common

More information

Compressive Imaging: Theory and Practice

Compressive Imaging: Theory and Practice Compressive Imaging: Theory and Practice Mark Davenport Richard Baraniuk, Kevin Kelly Rice University ECE Department Digital Revolution Digital Acquisition Foundation: Shannon sampling theorem Must sample

More information

Problem Set 4 Due: Wednesday, November 12th, 2014

Problem Set 4 Due: Wednesday, November 12th, 2014 6.890: Algorithmic Lower Bounds Prof. Erik Demaine Fall 2014 Problem Set 4 Due: Wednesday, November 12th, 2014 Problem 1. Given a graph G = (V, E), a connected dominating set D V is a set of vertices such

More information

Oracle Turing Machine. Kaixiang Wang

Oracle Turing Machine. Kaixiang Wang Oracle Turing Machine Kaixiang Wang Pre-background: What is Turing machine Oracle Turing Machine Definition Function Complexity Why Oracle Turing Machine is important Application of Oracle Turing Machine

More information

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood

Game Theory. Department of Electronics EL-766 Spring Hasan Mahmood Game Theory Department of Electronics EL-766 Spring 2011 Hasan Mahmood Email: hasannj@yahoo.com Course Information Part I: Introduction to Game Theory Introduction to game theory, games with perfect information,

More information

6.450: Principles of Digital Communication 1

6.450: Principles of Digital Communication 1 6.450: Principles of Digital Communication 1 Digital Communication: Enormous and normally rapidly growing industry, roughly comparable in size to the computer industry. Objective: Study those aspects of

More information

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014

Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical

More information

6.004 Computation Structures Spring 2009

6.004 Computation Structures Spring 2009 MIT OpenCourseWare http://ocw.mit.edu 6.004 Computation Structures Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Welcome to 6.004! Course

More information

Knights, Spies, Games and Social Networks

Knights, Spies, Games and Social Networks Knights, Spies, Games and Social Networks Mark Wildon 16 February 2010 The Knights and Spies Problem In a room there are 100 people. Each person is either a knight or a spy. Knights always tell the truth,

More information

lecture 6 Informatics luis rocha 2017 I501 introduction to informatics INDIANA UNIVERSITY

lecture 6 Informatics luis rocha 2017 I501 introduction to informatics INDIANA UNIVERSITY Informatics lecture 6 Readings until now Presentations Piantadosi, S. T.,et al (2011). Word lengths are optimized for efficient communication. PNAS, 108(9), 3526 3529. Malic, Vincent Gauvrit et al (2017).

More information

A Balanced Introduction to Computer Science, 3/E

A Balanced Introduction to Computer Science, 3/E A Balanced Introduction to Computer Science, 3/E David Reed, Creighton University 2011 Pearson Prentice Hall ISBN 978-0-13-216675-1 Chapter 10 Computer Science as a Discipline 1 Computer Science some people

More information

Modeling, Analysis and Optimization of Networks. Alberto Ceselli

Modeling, Analysis and Optimization of Networks. Alberto Ceselli Modeling, Analysis and Optimization of Networks Alberto Ceselli alberto.ceselli@unimi.it Università degli Studi di Milano Dipartimento di Informatica Doctoral School in Computer Science A.A. 2015/2016

More information

Game theory attempts to mathematically. capture behavior in strategic situations, or. games, in which an individual s success in

Game theory attempts to mathematically. capture behavior in strategic situations, or. games, in which an individual s success in Game Theory Game theory attempts to mathematically capture behavior in strategic situations, or games, in which an individual s success in making choices depends on the choices of others. A game Γ consists

More information

SHANNON S source channel separation theorem states

SHANNON S source channel separation theorem states IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 9, SEPTEMBER 2009 3927 Source Channel Coding for Correlated Sources Over Multiuser Channels Deniz Gündüz, Member, IEEE, Elza Erkip, Senior Member,

More information

and problem sheet 7

and problem sheet 7 1-18 and 15-151 problem sheet 7 Solutions to the following five exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Friday nd November 018. Problem 1 Let A N + and

More information

AN EFFICIENT ALGORITHM FOR THE REMOVAL OF IMPULSE NOISE IN IMAGES USING BLACKFIN PROCESSOR

AN EFFICIENT ALGORITHM FOR THE REMOVAL OF IMPULSE NOISE IN IMAGES USING BLACKFIN PROCESSOR AN EFFICIENT ALGORITHM FOR THE REMOVAL OF IMPULSE NOISE IN IMAGES USING BLACKFIN PROCESSOR S. Preethi 1, Ms. K. Subhashini 2 1 M.E/Embedded System Technologies, 2 Assistant professor Sri Sai Ram Engineering

More information

Chapter 1 An Introduction to Computer Science. INVITATION TO Computer Science 1

Chapter 1 An Introduction to Computer Science. INVITATION TO Computer Science 1 Chapter 1 An Introduction to Computer Science INVITATION TO Computer Science 1 Introduction Misconceptions Computer science is: The study of computers The study of how to write computer programs The study

More information

Multi-Platform Soccer Robot Development System

Multi-Platform Soccer Robot Development System Multi-Platform Soccer Robot Development System Hui Wang, Han Wang, Chunmiao Wang, William Y. C. Soh Division of Control & Instrumentation, School of EEE Nanyang Technological University Nanyang Avenue,

More information

Course Outline. Textbook: G. Michael Schneider and Judith L. Gersting, "Invitation to Computer Science C++ Version," 3rd Edition, Thomson, 2004.

Course Outline. Textbook: G. Michael Schneider and Judith L. Gersting, Invitation to Computer Science C++ Version, 3rd Edition, Thomson, 2004. 2005/Sep/12 1 Course Outline Textbook: G. Michael Schneider and Judith L. Gersting, "Invitation to Computer Science C++ Version," 3rd Edition, Thomson, 2004. Outline 1. The Algorithm Foundations of Computer

More information

Error Code Update Xbox 360 E74 Repair Tips

Error Code Update Xbox 360 E74 Repair Tips Error Code Update Xbox 360 E74 Repair Tips Note If you see error code "E74" on your screen, see E74 error message. Your original Xbox 360 console must be repaired at our service center. Start. Do you have

More information

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan Design of intelligent surveillance systems: a game theoretic case Nicola Basilico Department of Computer Science University of Milan Introduction Intelligent security for physical infrastructures Our objective:

More information

LECTURE 2: PD, PID, and Feedback Compensation. ( ) = + We consider various settings for Zc when compensating the system with the following RL:

LECTURE 2: PD, PID, and Feedback Compensation. ( ) = + We consider various settings for Zc when compensating the system with the following RL: LECTURE 2: PD, PID, and Feedback Compensation. 2.1 Ideal Derivative Compensation (PD) Generally, we want to speed up the transient response (decrease Ts and Tp). If we are lucky then a system s desired

More information

SYNTHESIS OF CYCLIC ENCODER AND DECODER FOR HIGH SPEED NETWORKS

SYNTHESIS OF CYCLIC ENCODER AND DECODER FOR HIGH SPEED NETWORKS SYNTHESIS OF CYCLIC ENCODER AND DECODER FOR HIGH SPEED NETWORKS MARIA RIZZI, MICHELE MAURANTONIO, BENIAMINO CASTAGNOLO Dipartimento di Elettrotecnica ed Elettronica, Politecnico di Bari v. E. Orabona,

More information

Signals and Systems Lecture 9 Communication Systems Frequency-Division Multiplexing and Frequency Modulation (FM)

Signals and Systems Lecture 9 Communication Systems Frequency-Division Multiplexing and Frequency Modulation (FM) Signals and Systems Lecture 9 Communication Systems Frequency-Division Multiplexing and Frequency Modulation (FM) April 11, 2008 Today s Topics 1. Frequency-division multiplexing 2. Frequency modulation

More information

Emerging Frontiers of Science of Information

Emerging Frontiers of Science of Information Emerging Frontiers of Science of Information NSF STC 2010 Bryn Mawr Howard MIT Princeton Purdue Stanford UC Berkeley UC San Diego UIUC National Science Foundation STC Team Wojciech Szpankowski, Purdue

More information

Full text available at: Algorithmic Results in List Decoding

Full text available at:  Algorithmic Results in List Decoding Algorithmic Results in List Decoding Algorithmic Results in List Decoding Venkatesan Guruswami Department of Computer Science & Engineering University of Washington Seattle WA 98195, USA venkat@cs.washington.edu

More information

Section Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning

Section Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Section 7.1 Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Probability of an Event Pierre-Simon Laplace (1749-1827) We first study Pierre-Simon

More information

Lecture 7. Review Blind search Chess & search. CS-424 Gregory Dudek

Lecture 7. Review Blind search Chess & search. CS-424 Gregory Dudek Lecture 7 Review Blind search Chess & search Depth First Search Key idea: pursue a sequence of successive states as long as possible. unmark all vertices choose some starting vertex x mark x list L = x

More information

IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING.

IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. IMPERIAL COLLEGE of SCIENCE, TECHNOLOGY and MEDICINE, DEPARTMENT of ELECTRICAL and ELECTRONIC ENGINEERING. COMPACT LECTURE NOTES on COMMUNICATION THEORY. Prof. Athanassios Manikas, version Spring 22 Digital

More information

Membrane Computing as Multi Turing Machines

Membrane Computing as Multi Turing Machines Volume 4 No.8, December 2012 www.ijais.org Membrane Computing as Multi Turing Machines Mahmoud Abdelaziz Amr Badr Ibrahim Farag ABSTRACT A Turing machine (TM) can be adapted to simulate the logic of any

More information

Physical Layer Security for Wireless Networks

Physical Layer Security for Wireless Networks Physical Layer Security for Wireless Networks Şennur Ulukuş Department of ECE University of Maryland ulukus@umd.edu Joint work with Shabnam Shafiee, Nan Liu, Ersen Ekrem, Jianwei Xie and Pritam Mukherjee.

More information

EENG 444 / ENAS 944 Digital Communication Systems

EENG 444 / ENAS 944 Digital Communication Systems EENG 444 / ENAS 944 Digital Communication Systems Introduction!! Wenjun Hu Communication Systems What s the first thing that comes to your mind? Communication Systems What s the first thing that comes

More information

Proceedings Cognitive Distributed Computing and Its Impact on Information Technology (IT) as We Know It

Proceedings Cognitive Distributed Computing and Its Impact on Information Technology (IT) as We Know It Proceedings Cognitive Distributed Computing and Its Impact on Information Technology (IT) as We Know It Rao Mikkilineni C 3 DNA, 7533 Kingsbury Ct, Cupertino, CA 95014, USA; rao@c3dna.com; Tel.: +1-408-406-7639

More information

Optimal Rhode Island Hold em Poker

Optimal Rhode Island Hold em Poker Optimal Rhode Island Hold em Poker Andrew Gilpin and Tuomas Sandholm Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 {gilpin,sandholm}@cs.cmu.edu Abstract Rhode Island Hold

More information

arxiv: v2 [cs.ai] 15 Jul 2016

arxiv: v2 [cs.ai] 15 Jul 2016 SIMPLIFIED BOARDGAMES JAKUB KOWALSKI, JAKUB SUTOWICZ, AND MAREK SZYKUŁA arxiv:1606.02645v2 [cs.ai] 15 Jul 2016 Abstract. We formalize Simplified Boardgames language, which describes a subclass of arbitrary

More information

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides

Game Theory Lecturer: Ji Liu Thanks for Jerry Zhu's slides Game Theory ecturer: Ji iu Thanks for Jerry Zhu's slides [based on slides from Andrew Moore http://www.cs.cmu.edu/~awm/tutorials] slide 1 Overview Matrix normal form Chance games Games with hidden information

More information

Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies

Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com

More information

of the hypothesis, but it would not lead to a proof. P 1

of the hypothesis, but it would not lead to a proof. P 1 Church-Turing thesis The intuitive notion of an effective procedure or algorithm has been mentioned several times. Today the Turing machine has become the accepted formalization of an algorithm. Clearly

More information

The attribution problem in Cognitive Science. Thinking Meat?! Formal Systems. Formal Systems have a history

The attribution problem in Cognitive Science. Thinking Meat?! Formal Systems. Formal Systems have a history The attribution problem in Cognitive Science Thinking Meat?! How can we get Reason-respecting behavior out of a lump of flesh? We can t see the processes we care the most about, so we must infer them from

More information

Decision Based Median Filter Algorithm Using Resource Optimized FPGA to Extract Impulse Noise

Decision Based Median Filter Algorithm Using Resource Optimized FPGA to Extract Impulse Noise Journal of Embedded Systems, 2014, Vol. 2, No. 1, 18-22 Available online at http://pubs.sciepub.com/jes/2/1/4 Science and Education Publishing DOI:10.12691/jes-2-1-4 Decision Based Median Filter Algorithm

More information

Guess the Mean. Joshua Hill. January 2, 2010

Guess the Mean. Joshua Hill. January 2, 2010 Guess the Mean Joshua Hill January, 010 Challenge: Provide a rational number in the interval [1, 100]. The winner will be the person whose guess is closest to /3rds of the mean of all the guesses. Answer:

More information

Chess, a mathematical definition

Chess, a mathematical definition Chess, a mathematical definition Jeroen Warmerdam, j.h.a.warmerdam@planet.nl August 2011, Voorschoten, The Netherlands, Introduction We present a mathematical definition for the game of chess, based on

More information

Solution: Alice tosses a coin and conveys the result to Bob. Problem: Alice can choose any result.

Solution: Alice tosses a coin and conveys the result to Bob. Problem: Alice can choose any result. Example - Coin Toss Coin Toss: Alice and Bob want to toss a coin. Easy to do when they are in the same room. How can they toss a coin over the phone? Mutual Commitments Solution: Alice tosses a coin and

More information

CT111 Introduction to Communication Systems Lecture 9: Digital Communications

CT111 Introduction to Communication Systems Lecture 9: Digital Communications CT111 Introduction to Communication Systems Lecture 9: Digital Communications Yash M. Vasavada Associate Professor, DA-IICT, Gandhinagar 31st January 2018 Yash M. Vasavada (DA-IICT) CT111: Intro to Comm.

More information

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown

Domination Rationalizability Correlated Equilibrium Computing CE Computational problems in domination. Game Theory Week 3. Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown Game Theory Week 3 Kevin Leyton-Brown, Slide 1 Lecture Overview 1 Domination 2 Rationalizability 3 Correlated Equilibrium 4 Computing CE 5 Computational problems in

More information

Capacity-Achieving Rateless Polar Codes

Capacity-Achieving Rateless Polar Codes Capacity-Achieving Rateless Polar Codes arxiv:1508.03112v1 [cs.it] 13 Aug 2015 Bin Li, David Tse, Kai Chen, and Hui Shen August 14, 2015 Abstract A rateless coding scheme transmits incrementally more and

More information

Analyzing Games: Solutions

Analyzing Games: Solutions Writing Proofs Misha Lavrov Analyzing Games: olutions Western PA ARML Practice March 13, 2016 Here are some key ideas that show up in these problems. You may gain some understanding of them by reading

More information

Simulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction

Simulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction Simulink Modelling of Reed-Solomon (Rs) Code for Error Detection and Correction Okeke. C Department of Electrical /Electronics Engineering, Michael Okpara University of Agriculture, Umudike, Abia State,

More information

arxiv: v1 [cs.cc] 2 Dec 2014

arxiv: v1 [cs.cc] 2 Dec 2014 Braid is undecidable Linus Hamilton arxiv:1412.0784v1 [cs.cc] 2 Dec 2014 December 3, 2014 Abstract Braid is a 2008 puzzle game centered around the ability to reverse time. We show that Braid can simulate

More information

Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey

Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey Outline 1) What is AI: The Course 2) What is AI: The Field 3) Why to take the class (or not) 4) A Brief History of AI 5) Predict

More information

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan

Design of intelligent surveillance systems: a game theoretic case. Nicola Basilico Department of Computer Science University of Milan Design of intelligent surveillance systems: a game theoretic case Nicola Basilico Department of Computer Science University of Milan Outline Introduction to Game Theory and solution concepts Game definition

More information

Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes

Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 9, SEPTEMBER 2003 2141 Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes Jilei Hou, Student

More information

arxiv: v2 [cs.dl] 6 Feb 2011

arxiv: v2 [cs.dl] 6 Feb 2011 Can Knowledge be preserved in the long run? arxiv:1011.1979v2 [cs.dl] 6 Feb 2011 Rina Panigrahy Microsoft Research, Mountain View, CA rina@microsoft.com June 15, 2018 Abstract Can (scientific) knowledge

More information

Know your energy. Modbus Register Map EM etactica Power Meter

Know your energy. Modbus Register Map EM etactica Power Meter Know your energy Modbus Register Map EM etactica Power Meter Revision history Version Action Author Date 1.0 Initial document KP 25.08.2013 1.1 Document review, description and register update GP 26.08.2013

More information

Laurea Specialistica in Ingegneria. Ingegneria dell'automazione: Sistemi in Tempo Reale

Laurea Specialistica in Ingegneria. Ingegneria dell'automazione: Sistemi in Tempo Reale Laurea Specialistica in Ingegneria dell'automazione Sistemi in Tempo Reale email: palopoli@sssup.it Tel. 050 883444 Introduzione Lecture schedule Introduction Selected topics on discrete time and sampled

More information

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players).

Game Theory Refresher. Muriel Niederle. February 3, A set of players (here for simplicity only 2 players, all generalized to N players). Game Theory Refresher Muriel Niederle February 3, 2009 1. Definition of a Game We start by rst de ning what a game is. A game consists of: A set of players (here for simplicity only 2 players, all generalized

More information

ICE1495 Independent Study for Undergraduate Project (IUP) A. Lie Detector. Prof. : Hyunchul Park Student : Jonghun Park Due date : 06/04/04

ICE1495 Independent Study for Undergraduate Project (IUP) A. Lie Detector. Prof. : Hyunchul Park Student : Jonghun Park Due date : 06/04/04 ICE1495 Independent Study for Undergraduate Project (IUP) A Lie Detector Prof. : Hyunchul Park Student : 20020703 Jonghun Park Due date : 06/04/04 Contents ABSTRACT... 2 1. INTRODUCTION... 2 1.1 BASIC

More information

A Problem in Real-Time Data Compression: Sunil Ashtaputre. Jo Perry. and. Carla Savage. Center for Communications and Signal Processing

A Problem in Real-Time Data Compression: Sunil Ashtaputre. Jo Perry. and. Carla Savage. Center for Communications and Signal Processing A Problem in Real-Time Data Compression: How to Keep the Data Flowing at a Regular Rate by Sunil Ashtaputre Jo Perry and Carla Savage Center for Communications and Signal Processing Department of Computer

More information

wireless transmission of short packets

wireless transmission of short packets wireless transmission of short packets Petar Popovski Aalborg University, Denmark AAU, June 2016 P. Popovski (Aalborg Uni) short packets AAU, Jun. 2016 1 / 19 short data packets gaining in importance with

More information

Fictitious Play applied on a simplified poker game

Fictitious Play applied on a simplified poker game Fictitious Play applied on a simplified poker game Ioannis Papadopoulos June 26, 2015 Abstract This paper investigates the application of fictitious play on a simplified 2-player poker game with the goal

More information

Lec 19 Error and Loss Control I: FEC

Lec 19 Error and Loss Control I: FEC Multimedia Communication Lec 19 Error and Loss Control I: FEC Zhu Li Course Web: http://l.web.umkc.edu/lizhu/teaching/ Z. Li, Multimedia Communciation, Spring 2017 p.1 Outline ReCap Lecture 18 TCP Congestion

More information

Lecture 2. 1 Nondeterministic Communication Complexity

Lecture 2. 1 Nondeterministic Communication Complexity Communication Complexity 16:198:671 1/26/10 Lecture 2 Lecturer: Troy Lee Scribe: Luke Friedman 1 Nondeterministic Communication Complexity 1.1 Review D(f): The minimum over all deterministic protocols

More information

Green Codes : Energy-efficient short-range communication

Green Codes : Energy-efficient short-range communication Green Codes : Energy-efficient short-range communication Pulkit Grover Department of Electrical Engineering and Computer Sciences University of California at Berkeley Joint work with Prof. Anant Sahai

More information