DOCSLIB.ORG

Signal Computing: Digital Signals in the Software Domain

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Signal Computing: Digital Signals in the Software Domain Michael Stiber Bilin Zhang Stiber Eric C. Larson Signal Computing: Digital Signals in the Software Domain Spring 2020 Michael Stiber Bilin Zhang Stiber University of Washington Bothell 18115 Campus Way NE Bothell, Washington 98011 Eric C. Larson Southern Methodist University Lyle School of Engineering 3145 Dyer Street Dallas, TX 75205 Copyright © 2002–2020 by Michael and Bilin Stiber and Eric C. Larson This material is based upon work supported by the National Science Foundation under Grant No. 0443118. Cover art by Eduardo Sainos. This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-sa/4.0/. Contents Preface xiii Objectives ........................................ xiv Prerequisites ...................................... xiv About This Book .................................... xvi Typographical Conventions .............................. xvi Further Reading .................................... xvii 1 Signals in the Physical World 1 1.1 Multimedia and Sensation ............................ 1 1.2 Sensation and Perception ............................. 2 1.3 Computer Video Displays ............................ 4 1.4 Multimedia System Operation .......................... 5 1.5 Vibrations and Sound ............................... 6 1.6 Phasors ...................................... 9 1.7 Spectra ...................................... 14 1.7.1 Interlude: Vectors ............................. 15 1.7.2 Derivation of the Fourier Series ..................... 17 1.8 Problems ...................................... 25 1.9 Further Reading .................................. 29 2 Signals in the Computer 31 2.1 From the physical to the digital ......................... 31 2.2 Measuring Noise .................................. 32 2.3 Sampling ...................................... 33 2.3.1 Aliasing .................................. 35 2.4 Quantization ................................... 38 2.5 Dynamic Range .................................. 41 2.6 Periodic and Aperiodic Signals .......................... 41 2.7 Problems ...................................... 42 Signal Computing i 2.8 Further Reading .................................. 43 3 Filtering and Feedforward Filters 45 3.1 Introduction .................................... 45 3.2 Feedforward Filters ................................ 46 3.2.1 Delaying a phasor ............................. 46 3.2.2 A simple feedforward filter ........................ 47 3.2.3 Digital Filters ............................... 50 3.2.4 Delay as an Operator ........................... 52 3.2.5 The z-plane ................................ 55 3.2.6 Phase Response .............................. 59 3.2.7 Implementing Digital Filters ....................... 62 3.3 Problems ...................................... 64 3.4 Further Reading .................................. 65 4 The Z-Transform and Convolution 67 4.1 Domains ...................................... 67 4.2 The z-transform .................................. 68 4.2.1 Example: z-transform of an impulse ................... 69 4.2.2 Example: z-transform of exponential signal ............... 70 4.3 Convolution .................................... 75 4.3.1 Example of Convolution ......................... 75 4.3.2 Implementing Convolution ........................ 76 4.4 Properties of the Z-Transform .......................... 79 4.4.1 Example: Time Shifting ......................... 80 4.4.2 Example: Convolution .......................... 80 4.5 Impulse Response and the Transfer Function .................. 82 4.6 Problems ...................................... 83 4.7 Further Reading .................................. 83 5 Feedback Filters 85 5.1 Introduction .................................... 85 5.1.1 Poles .................................... 85 5.1.2 Example: Computing Transfer Function and Impulse Response .... 88 5.1.3 Stability .................................. 88 5.1.4 Resonance and Bandwidth ........................ 91 5.2 Mixing Feedback and Feedforward Filters .................... 95 5.3 Implementation .................................. 95 5.3.1 Avoiding Complex Numbers ....................... 96 5.3.2 Limitations of Numerical Accuracy ................... 97 5.4 Problems ...................................... 99 5.5 Further Reading .................................. 99 Signal Computing ii 6 Spectral Analysis 101 6.1 The Fourier Transform .............................. 101 6.1.1 Example: Fourier transform of a rectangular pulse ........... 102 6.2 The Discrete Fourier Transform ......................... 104 6.2.1 Derivation of the IDFT [Optional] .................. 106 6.2.2 Finite vs. Infinite Signals ......................... 107 6.2.3 Properties of the DFT .......................... 107 6.2.4 Computing the DFT Directly ...................... 111 6.2.5 The Fast Fourier Transform Algorithm ................. 112 6.3 The inverse DFT ................................. 118 6.3.1 Example: Sum of Two Sinusoids ..................... 119 6.4 Power Leakage [Optional] ........................... 120 6.5 Tradeo↵Between Time and Frequency Resolution [Optional] ........ 124 6.6 Windowing [Optional] ............................. 128 6.7 Problems ...................................... 134 6.8 Further Reading .................................. 135 7 Compression 137 7.1 Signals and Information ............................. 137 7.2 Entropy (Lossless) Compression ......................... 141 7.2.1 Repetitive Sequence Compression .................... 141 7.2.2 Statistical Compression .......................... 142 7.3 Source (Lossy) Compression ........................... 144 7.3.1 Di↵erential Compression ......................... 145 7.3.2 Transform Compression ......................... 146 7.4 Problems ...................................... 147 7.5 Further Reading .................................. 148 8 Audio & Video Compression and Coding 149 8.0.1 Issues in Coding Method Selection ................... 149 8.1 Audio Coding Standards ............................. 150 8.1.1 Speech Coding for Telephony ...................... 150 8.1.2 High-Quality Audio Coding ....................... 151 8.2 Still Image Coding Standards .......................... 153 8.2.1 JPEG ................................... 153 8.3 Video Coding Standards ............................. 159 8.3.1 MPEG Coding .............................. 159 8.4 Problems ...................................... 161 8.5 Further Reading .................................. 162 Signal Computing iii 9 Review and Conclusions 163 9.1 A Generic Digital Multimedia System ...................... 163 9.2 Compact Discs .................................. 163 9.2.1 Data Encoding .............................. 165 9.2.2 CD System Signal Processing ...................... 168 9.3 Conclusion ..................................... 170 9.4 Further Reading .................................. 170 A Answers to Self-Test Exercises 171 A.1 Chapter 1:SignalsinthePhysicalWorld.................... 171 A.2 Chapter 2:SignalsintheComputer....................... 173 A.3 Chapter 3: Filtering and Feedforward Filters .................. 174 A.4 Chapter 4:TheZ-TransformandConvolution ................. 176 A.5 Chapter 5: Feedback Filters ........................... 178 A.6 Chapter 6: Spectral Analysis ........................... 178 A.7 Chapter 7:Compression ............................. 181 A.8 Chapter 8: Audio & Video Compression and Coding ............. 182 A.9 Chapter 9:ReviewandConclusions....................... 182 Index 183 Signal Computing iv List of Figures 0.1 Course conceptual road map ........................... xv 1.1 Schematic diagram of a CRT. .......................... 4 1.2 Interlaced and non-interlaced raster scanning .................. 5 1.3 Real periodic signals ............................... 7 1.4 Components of a phasor are sinusoids. ..................... 9 1.5 Graphical summation of vectors. ......................... 10 1.6 Phasor representation of beating. ........................ 13 1.7 Amplitude vs. time representation of beating. ................. 13 1.8 A train of periodic rectangular pulses ...................... 21 1.9 The sinc function. ................................. 22 1.10 First 12 terms in the Fourier series for a periodic sequence of rectangular pulses 24 1.11 First 100 terms in the Fourier series for a periodic sequence of rectangular pulses 25 1.12 Spectrum of a periodic sequence of rectangular pulses ............. 26 1.13 Spectrum of a periodic sequence of rectangular pulses; varying pulse width . 27 1.14 Spectrum of a periodic sequence of rectangular pulses; varying period .... 28 2.1 Block diagram of the data acquisition process. ................. 31 2.2 Sample and hold output ............................. 34 2.3 Sampling and apparent frequency ........................ 35 2.4 Error in output for 8-bit ADC .......................... 39 3.1 Four frequency components ........................... 46 3.2 Filter frequency response ............................. 47 3.3 A filtered signal .................................. 47 3.4 Unfiltered vs. filtered signal ........................... 48 3.5 A basic feedforward filter block diagram. ................... 48 3.6 Treat transfer function as a black box. ..................... 55 3.7 Two zero filter r =0.9,! ˆ = ⇡/2. ....................... 58 0 ± 3.8 Two zero filter r =0.9,! ˆ = 5⇡/6. .....................
Recommended publications
  • MASTERCLASS GNUPG MASTERCLASS You Wouldn’T Want Other People Opening Your Letters and BEN EVERARD Your Data Is No Different

    MASTERCLASS GNUPG MASTERCLASS You Wouldn’T Want Other People Opening Your Letters and BEN EVERARD Your Data Is No Different

    MASTERCLASS GNUPG MASTERCLASS You wouldn’t want other people opening your letters and BEN EVERARD your data is no different. Encrypt it today! SECURE EMAIL WITH GNUPG AND ENIGMAIL Send encrypted emails from your favourite email client. our typical email is about as secure as a The first thing that you need to do is create a key to JOHN LANE postcard, which is good news if you’re a represent your identity in the OpenPGP world. You’d Ygovernment agency. But you wouldn’t use a typically create one key per identity that you have. postcard for most things sent in the post; you’d use a Most people would have one identity, being sealed envelope. Email is no different; you just need themselves as a person. However, some may find an envelope – and it’s called “Encryption”. having separate personal and professional identities Since the early 1990s, the main way to encrypt useful. It’s a personal choice, but starting with a single email has been PGP, which stands for “Pretty Good key will help while you’re learning. Privacy”. It’s a protocol for the secure encryption of Launch Seahorse and click on the large plus-sign email that has since evolved into an open standard icon that’s just below the menu. Select ‘PGP Key’ and called OpenPGP. work your way through the screens that follow to supply your name and email address and then My lovely horse generate the key. The GNU Privacy Guard (GnuPG), is a free, GPL-licensed You can, optionally, use the Advanced Key Options implementation of the OpenPGP standard (there are to add a comment that can help others identify your other implementations, both free and commercial – key and to select the cipher, its strength and set when the PGP name now refers to a commercial product the key should expire.
  • Digital Signals

    Digital Signals

    Technical Information Digital Signals 1 1 bit t Part 1 Fundamentals Technical Information Part 1: Fundamentals Part 2: Self-operated Regulators Part 3: Control Valves Part 4: Communication Part 5: Building Automation Part 6: Process Automation Should you have any further questions or suggestions, please do not hesitate to contact us: SAMSON AG Phone (+49 69) 4 00 94 67 V74 / Schulung Telefax (+49 69) 4 00 97 16 Weismüllerstraße 3 E-Mail: [email protected] D-60314 Frankfurt Internet: http://www.samson.de Part 1 ⋅ L150EN Digital Signals Range of values and discretization . 5 Bits and bytes in hexadecimal notation. 7 Digital encoding of information. 8 Advantages of digital signal processing . 10 High interference immunity. 10 Short-time and permanent storage . 11 Flexible processing . 11 Various transmission options . 11 Transmission of digital signals . 12 Bit-parallel transmission. 12 Bit-serial transmission . 12 Appendix A1: Additional Literature. 14 99/12 ⋅ SAMSON AG CONTENTS 3 Fundamentals ⋅ Digital Signals V74/ DKE ⋅ SAMSON AG 4 Part 1 ⋅ L150EN Digital Signals In electronic signal and information processing and transmission, digital technology is increasingly being used because, in various applications, digi- tal signal transmission has many advantages over analog signal transmis- sion. Numerous and very successful applications of digital technology include the continuously growing number of PCs, the communication net- work ISDN as well as the increasing use of digital control stations (Direct Di- gital Control: DDC). Unlike analog technology which uses continuous signals, digital technology continuous or encodes the information into discrete signal states (Fig. 1). When only two discrete signals states are assigned per digital signal, these signals are termed binary si- gnals.
  • Radar Transmitter/Receiver

    Radar Transmitter/Receiver

    Introduction to Radar Systems Radar Transmitter/Receiver Radar_TxRxCourse MIT Lincoln Laboratory PPhu 061902 -1 Disclaimer of Endorsement and Liability • The video courseware and accompanying viewgraphs presented on this server were prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor any of their employees, nor the Massachusetts Institute of Technology and its Lincoln Laboratory, nor any of their contractors, subcontractors, or their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, products, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government, any agency thereof, or any of their contractors or subcontractors or the Massachusetts Institute of Technology and its Lincoln Laboratory. • The views and opinions expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof or any of their contractors or subcontractors Radar_TxRxCourse MIT Lincoln Laboratory PPhu 061802 -2 Outline • Introduction • Radar Transmitter • Radar Waveform Generator and Receiver • Radar Transmitter/Receiver Architecture
  • Wiretapping End-To-End Encrypted Voip Calls Real-World Attacks on ZRTP

    Wiretapping End-To-End Encrypted Voip Calls Real-World Attacks on ZRTP

    Institute of Operating Systems and Computer Networks Wiretapping End-to-End Encrypted VoIP Calls Real-World Attacks on ZRTP Dominik Schürmann, Fabian Kabus, Gregor Hildermeier, Lars Wolf, 2017-07-18 wiretapping difficulty End-to-End Encryption SIP + DTLS-SRTP (SIP + Datagram Transport Layer Security-SRTP) End-to-End Encryption & Authentication SIP + SRTP + ZRTP Introduction Man-in-the-Middle ZRTP Attacks Conclusion End-to-End Security for Voice Calls Institute of Operating Systems and Computer Networks No End-to-End Security PSTN (Public Switched Telephone Network) SIP + (S)RTP (Session Initiation Protocol + Secure Real-Time Transport Protocol) 2017-07-18 Dominik Schürmann Wiretapping End-to-End Encrypted VoIP Calls Page 2 of 13 wiretapping difficulty End-to-End Encryption & Authentication SIP + SRTP + ZRTP Introduction Man-in-the-Middle ZRTP Attacks Conclusion End-to-End Security for Voice Calls Institute of Operating Systems and Computer Networks No End-to-End Security PSTN (Public Switched Telephone Network) SIP + (S)RTP (Session Initiation Protocol + Secure Real-Time Transport Protocol) End-to-End Encryption SIP + DTLS-SRTP (SIP + Datagram Transport Layer Security-SRTP) 2017-07-18 Dominik Schürmann Wiretapping End-to-End Encrypted VoIP Calls Page 2 of 13 wiretapping difficulty Introduction Man-in-the-Middle ZRTP Attacks Conclusion End-to-End Security for Voice Calls Institute of Operating Systems and Computer Networks No End-to-End Security PSTN (Public Switched Telephone Network) SIP + (S)RTP (Session Initiation Protocol + Secure Real-Time
  • CS 255: Intro to Cryptography 1 Introduction 2 End-To-End

    CS 255: Intro to Cryptography 1 Introduction 2 End-To-End

    Programming Assignment 2 Winter 2021 CS 255: Intro to Cryptography Prof. Dan Boneh Due Monday, March 1st, 11:59pm 1 Introduction In this assignment, you are tasked with implementing a secure and efficient end-to-end encrypted chat client using the Double Ratchet Algorithm, a popular session setup protocol that powers real- world chat systems such as Signal and WhatsApp. As an additional challenge, assume you live in a country with government surveillance. Thereby, all messages sent are required to include the session key encrypted with a fixed public key issued by the government. In your implementation, you will make use of various cryptographic primitives we have discussed in class—notably, key exchange, public key encryption, digital signatures, and authenticated encryption. Because it is ill-advised to implement your own primitives in cryptography, you should use an established library: in this case, the Stanford Javascript Crypto Library (SJCL). We will provide starter code that contains a basic template, which you will be able to fill in to satisfy the functionality and security properties described below. 2 End-to-end Encrypted Chat Client 2.1 Implementation Details Your chat client will use the Double Ratchet Algorithm to provide end-to-end encrypted commu- nications with other clients. To evaluate your messaging client, we will check that two or more instances of your implementation it can communicate with each other properly. We feel that it is best to understand the Double Ratchet Algorithm straight from the source, so we ask that you read Sections 1, 2, and 3 of Signal’s published specification here: https://signal.
  • Lecture 11 : Discrete Cosine Transform Moving Into the Frequency Domain

    Lecture 11 : Discrete Cosine Transform Moving Into the Frequency Domain

    Lecture 11 : Discrete Cosine Transform Moving into the Frequency Domain Frequency domains can be obtained through the transformation from one (time or spatial) domain to the other (frequency) via Fourier Transform (FT) (see Lecture 3) — MPEG Audio. Discrete Cosine Transform (DCT) (new ) — Heart of JPEG and MPEG Video, MPEG Audio. Note : We mention some image (and video) examples in this section with DCT (in particular) but also the FT is commonly applied to filter multimedia data. External Link: MIT OCW 8.03 Lecture 11 Fourier Analysis Video Recap: Fourier Transform The tool which converts a spatial (real space) description of audio/image data into one in terms of its frequency components is called the Fourier transform. The new version is usually referred to as the Fourier space description of the data. We then essentially process the data: E.g . for filtering basically this means attenuating or setting certain frequencies to zero We then need to convert data back to real audio/imagery to use in our applications. The corresponding inverse transformation which turns a Fourier space description back into a real space one is called the inverse Fourier transform. What do Frequencies Mean in an Image? Large values at high frequency components mean the data is changing rapidly on a short distance scale. E.g .: a page of small font text, brick wall, vegetation. Large low frequency components then the large scale features of the picture are more important. E.g . a single fairly simple object which occupies most of the image. The Road to Compression How do we achieve compression? Low pass filter — ignore high frequency noise components Only store lower frequency components High pass filter — spot gradual changes If changes are too low/slow — eye does not respond so ignore? Low Pass Image Compression Example MATLAB demo, dctdemo.m, (uses DCT) to Load an image Low pass filter in frequency (DCT) space Tune compression via a single slider value n to select coefficients Inverse DCT, subtract input and filtered image to see compression artefacts.
  • FALL 2020 E-NEWSLETTER at Digital Mountain We Assist Our Clients with Their Computer Forensics, E-Discovery, Cybersecurity and Data Analytics Needs

    FALL 2020 E-NEWSLETTER at Digital Mountain We Assist Our Clients with Their Computer Forensics, E-Discovery, Cybersecurity and Data Analytics Needs

    FALL 2020 E-NEWSLETTER At Digital Mountain we assist our clients with their computer forensics, e-discovery, cybersecurity and data analytics needs. For this E-Newsletter, we focus on ephemeral communications and the affect of disappearing messages on discovery cases. Ephemeral Applications: Digital Trick or Treat The trick in trick or treating is one that has evolved from the neighbor who dons a monster mask when opening the door to the disappearance of peanut butter cups when Dad does the safety check of the night’s candy haul. Our digital communications have gone through an analogous transformation as we first marveled at how much data our devices could hold. Just as we upgraded from a small plastic pumpkin to a pillowcase for larger candy collections - we saved a growing plethora of emails, text messages, digital images, voice messages, and all manner of documents on mobile devices. Now, with the rise of discovery, we want our vulnerable data to disappear as if it were our least favorite candy. Ephemeral applications may be just the trick for that unwanted data. Call It What You Will There is no consensus about what constitutes an ephemeral application beyond the understanding that there is an element of impermanence. In 2016, three Georgia Tech College of Computing researchers proposed the creation of “ephemeral apps” that would allow users to engage with apps on a trial basis that would “pop-up instantaneously” on devices and then disappear after a certain period (https://www.cc.gatech.edu/~kbhardwa/papers/eapps.pdf). At the opposite end of the spectrum, in 2017 fan favorite Snapchat modified its app to allow recipients to determine when photographs and video would disappear rather than the burn after reading settings that propelled Snapchat’s rapid rise (https://www.vox.com/2017/5/9/15595040/snapchat-product-update-limitless-q1-earnings).
  • (MSEE) COMMUNICATION, NETWORKING, and SIGNAL PROCESSING TRACK*OPTIONS Curriculum Program of Study Advisor: Dr

    (MSEE) COMMUNICATION, NETWORKING, and SIGNAL PROCESSING TRACK*OPTIONS Curriculum Program of Study Advisor: Dr

    MASTER OF SCIENCE IN ELECTRICAL ENGINEERING (MSEE) COMMUNICATION, NETWORKING, AND SIGNAL PROCESSING TRACK*OPTIONS Curriculum Program of Study Advisor: Dr. R. Sankar Name USF ID # Term/Year Address Phone Email Advisor Areas of focus: Communications (Systems/Wireless Communications), Networking, and Digital Signal Processing (Speech/Biomedical/Image/Video and Multimedia) Course Title Number Credits Semester Grade 1. Mathematics: 6 hours Random Process in Electrical Engineering EEE 6545 3 Select one other from the following Linear and Matrix Algebra EEL 6935 3 Optimization Methods EEL 6935 3 Statistical Inference EEL 6936 3 Engineering Apps for Vector Analysis** EEL 6027 3 Engineering Apps for Complex Analysis** EEL 6022 3 2. Focus Area Core Courses: 15 hours (Select a major core with 2 sets of sequences from groups A or B and a minor core (one course from the other group) A. Communications and Networking Digital Communication Systems EEL 6534 3 Mobile and Personal Communication EEL 6593 3 Broadband Communication Networks EEL 6506 3 Wireless Network Architectures and Protocols EEL 6597 3 Wireless Communications Lab EEL 6592 3 B. Signal Processing Digital Signal Processing I EEE 6502 3 Digital Signal Processing II EEL 6752 3 Speech Signal Processing EEL 6586 3 Deep Learning EEL 6935 3 Real-Time DSP Systems Lab (DSP/FPGA Lab) EEL 6722C 3 3. Electives: 3 hours A. Communications, Networking, and Signal Processing Selected Topics in Communications EEL 7931 3 Network Science EEL 6935 3 Wireless Sensor Networks EEL 6935 3 Digital Signal Processing III EEL 6753 3 Biomedical Image Processing EEE 6514 3 Data Analytics for Electrical and System Engineers EEL 6935 3 Biomedical Systems and Pattern Recognition EEE 6282 3 Advanced Data Analytics EEL 6935 3 B.
  • Pgpfone Pretty Good Privacy Phone Owner’S Manual Version 1.0 Beta 7 -- 8 July 1996

    Pgpfone Pretty Good Privacy Phone Owner’S Manual Version 1.0 Beta 7 -- 8 July 1996

    Phil’s Pretty Good Software Presents... PGPfone Pretty Good Privacy Phone Owner’s Manual Version 1.0 beta 7 -- 8 July 1996 Philip R. Zimmermann PGPfone Owner’s Manual PGPfone Owner’s Manual is written by Philip R. Zimmermann, and is (c) Copyright 1995-1996 Pretty Good Privacy Inc. All rights reserved. Pretty Good Privacy™, PGP®, Pretty Good Privacy Phone™, and PGPfone™ are all trademarks of Pretty Good Privacy Inc. Export of this software may be restricted by the U.S. government. PGPfone software is (c) Copyright 1995-1996 Pretty Good Privacy Inc. All rights reserved. Phil’s Pretty Good engineering team: PGPfone for the Apple Macintosh and Windows written mainly by Will Price. Phil Zimmermann: Overall application design, cryptographic and key management protocols, call setup negotiation, and, of course, the manual. Will Price: Overall application design. He persuaded the rest of the team to abandon the original DOS command-line approach and designed a multithreaded event-driven GUI architecture. Also greatly improved call setup protocols. Chris Hall: Did early work on call setup protocols and cryptographic and key management protocols, and did the first port to Windows. Colin Plumb: Cryptographic and key management protocols, call setup negotiation, and the fast multiprecision integer math package. Jeff Sorensen: Speech compression. Will Kinney: Optimization of GSM speech compression code. Kelly MacInnis: Early debugging of the Win95 version. Patrick Juola: Computational linguistic research for biometric word list. -2- PGPfone Owner’s
  • Internet Telephony with Linphone WELLWELL CONNECTEDCONNECTED

    Internet Telephony with Linphone WELLWELL CONNECTEDCONNECTED

    Linphone COVER STORY Internet telephony with Linphone WELLWELL CONNECTEDCONNECTED When you want to call your friends in distant countries, don’t pick up municate with the VoIP provider, so you will need to install the library first. To do the phone; just put on your headset and fire up Linphone. so, open a terminal window, then be- come root by typing su and supplying BY SIMONE SCHÄFER the root password. Unpack the archive by typing tar xzf libosip2-2.2.0.tar.gz, ne of the most popular methods wants to take incoming calls via Purtel. and then change to the new directory (cd for accessing Voice over IP tech- The procedures are similar for other pro- libosip2-2.2.0). The following commands Onology is through a so-called viders. will build and install the library: softphone. A softphone is simply a com- puter program running on your desktop Installation ./configure --prefix=/usr that handles call establishment and com- The source code for the 1.1.0 release, make munication. Linphone [1] is one of the and the libraries, are available on the most popular softphone applications for DVD with this issue below LinuxUser/ Phone Numbers and SIP Ids Linux. Linphone is optimized for the linphone/. In the simplest of all cases, the phone Gnome desktop, although that doesn’t Mandriva Linux 2006 has the current number will be a simple telephone num- mean you can’t run it on KDE. This arti- 1.1.0 version. Gentoo Linux users can ber followed by the SIP domain, such as cles describes how to install, configure, install Linphone 1.1.0 simply by running [email protected].
  • Chapter 1 Computers and Digital Basics Computer Concepts 2014 1 Your Assignment…

    Chapter 1 Computers and Digital Basics Computer Concepts 2014 1 Your Assignment…

    Chapter 1 Computers and Digital Basics Computer Concepts 2014 1 Your assignment… Prepare an answer for your assigned question. Use Chapter 1 in the book and this PowerPoint to procure information. Prepare a PowerPoint presentation to: 1. Show your answer and additional information/facts – make sure you understand and can explain your answer. Provide as must information and detail as possible. Add graphics to enhance. 2. Where in the book did you find your information? Include the page number. 3. What more do you need to find out to help you better understand this question? Be prepared to share your information with the class. Chapter 1: Computers and Digital Basics 2 1 The Digital Revolution The digital revolution is an ongoing process of social, political, and economic change brought about by digital technology, such as computers and the Internet The technology driving the digital revolution is based on digital electronics and the idea that electrical signals can represent data, such as numbers, words, pictures, and music Chapter 1: Computers and Digital Basics 6 1 The Digital Revolution Digitization is the process of converting text, numbers, sound, photos, and video into data that can be processed by digital devices The digital revolution has evolved through four phases, beginning with big, expensive, standalone computers, and progressing to today’s digital world in which small, inexpensive digital devices are everywhere Chapter 1: Computers and Digital Basics 7 1 The Digital Revolution Chapter 1: Computers and Digital Basics
  • Lecture Notes for Digital Electronics

    Lecture Notes for Digital Electronics

    Lecture Notes for Digital Electronics Raymond E. Frey Physics Department University of Oregon Eugene, OR 97403, USA [email protected] March, 2000 1 Basic Digital Concepts By converting continuous analog signals into a finite number of discrete states, a process called digitization, then to the extent that the states are sufficiently well separated so that noise does create errors, the resulting digital signals allow the following (slightly idealized): • storage over arbitrary periods of time • flawless retrieval and reproduction of the stored information • flawless transmission of the information Some information is intrinsically digital, so it is natural to process and manipulate it using purely digital techniques. Examples are numbers and words. The drawback to digitization is that a single analog signal (e.g. a voltage which is a function of time, like a stereo signal) needs many discrete states, or bits, in order to give a satisfactory reproduction. For example, it requires a minimum of 10 bits to determine a voltage at any given time to an accuracy of ≈ 0:1%. For transmission, one now requires 10 lines instead of the one original analog line. The explosion in digital techniques and technology has been made possible by the incred- ible increase in the density of digital circuitry, its robust performance, its relatively low cost, and its speed. The requirement of using many bits in reproduction is no longer an issue: The more the better. This circuitry is based upon the transistor, which can be operated as a switch with two states. Hence, the digital information is intrinsically binary. So in practice, the terms digital and binary are used interchangeably.