Solution of Linear Systems
|
|
- Tamsin Thornton
- 5 years ago
- Views:
Transcription
1 Solution of Linear Systems Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico November 30, 2011 CPD (DEI / IST) Parallel and Distributed Computing / 28
2 Outline Solving Linear Systems Direct Methods: solution is sought directly, at once Gaussian Elimination LU Factorization Pivoting CPD (DEI / IST) Parallel and Distributed Computing / 28
3 Linear Systems Probably the single most used procedure in the world. Linear Systems are the model for many modern day problems in mathematics in physics in economics and pretty much in any field What about nonlinear systems? Is that not a more general model? Yes, but how do we solve nonlinear systems? We linearize and iterate until we have a solution At each iteration we solve a linear system Also, how do we solve differential equations? We discretize in time and solve for each timepoint At each timepoint it may be a nonlinear system, so we linearize it In the end we still solve a linear systems, actually many of them CPD (DEI / IST) Parallel and Distributed Computing / 28
4 Direct Methods Gaussian Elimination Reduce Ax = b to upper triangular system, Tx = c: Forward Elimination Use Back Substitution to solve Tx = c. CPD (DEI / IST) Parallel and Distributed Computing / 28
5 Direct Methods Gaussian Elimination Reduce Ax = b to upper triangular system, Tx = c: Forward Elimination Use Back Substitution to solve Tx = c. a 00 a 01 a 02 a 0n a 10 a 11 a 12 a 1n a 20 a 21 a 22 a 2n a m0 a m1 a m2 a mn x 0 x 1 x 2. x n = b 0 b 1 b 2. b n CPD (DEI / IST) Parallel and Distributed Computing / 28
6 Direct Methods Gaussian Elimination Reduce Ax = b to upper triangular system, Tx = c: Forward Elimination Use Back Substitution to solve Tx = c. t 00 t 01 t 02 t 0n 0 t 11 t 12 t 1n 0 0 t 22 t 2n t mn x 0 x 1 x 2. x n = c 0 c 1 c 2. c n CPD (DEI / IST) Parallel and Distributed Computing / 28
7 Direct Methods Gaussian Elimination Reduce Ax = b to upper triangular system, Tx = c: Forward Elimination Use Back Substitution to solve Tx = c. t 00 t 01 t 02 t 0n 0 t 11 t 12 t 1n 0 0 t 22 t 2n t mn x 0 x 1 x 2. x n = c 0 c 1 c 2. c n Back Substitution 1 one element of x can be immediately computed 2 use this value to simplify system, revealing another element that can be immediately computed 3 repeat CPD (DEI / IST) Parallel and Distributed Computing / 28
8 Forward Elimination, recall steps 1x 0 +1x 1 1x 2 +4x 3 = 8 1x 0 1x 1 4x 2 +5x 3 = 13 1x 0 1x 2 6x 2 8x 3 = 13 1x 0 1x 3 2x 2 = 9 CPD (DEI / IST) Parallel and Distributed Computing / 28
9 Forward Elimination, recall steps 1x 0 +1x 1 1x 2 +4x 3 = 8 1x 0 1x 1 4x 2 +5x 3 = 13 1x 0 1x 2 6x 2 8x 3 = 13 1x 0 1x 3 2x 2 = 9 Pivot: p 21 = a 21 /a 11, multiply by 1 st row, add to 2 nd row CPD (DEI / IST) Parallel and Distributed Computing / 28
10 Forward Elimination, recall steps 1x 0 +1x 1 1x 2 +4x 3 = 8 1x 0 1x 1 4x 2 +5x 3 = 13 1x 0 1x 2 6x 2 8x 3 = 13 1x 0 1x 3 2x 2 = 9 Pivot: p 21 = a 21 /a 11, multiply by 1 st row, add to 2 nd row 1x 0 +1x 1 1x 2 4x 3 = 8 2x 1 3x 2 1x 3 = 5 1x 0 1x 2 6x 2 8x 3 = 13 1x 0 1x 3 2x 2 = 9 CPD (DEI / IST) Parallel and Distributed Computing / 28
11 Forward Elimination, recall steps 1x 0 +1x 1 1x 2 +4x 3 = 8 1x 0 1x 1 4x 2 +5x 3 = 13 1x 0 1x 2 6x 2 8x 3 = 13 1x 0 1x 3 2x 2 = 9 Also for p 31 = a 31 /a 11, p 41 = a 41 /a 11 1x 0 +1x 1 1x 2 4x 3 = 8 2x 1 3x 2 1x 3 = 5 2x 2 5x 2 4x 3 = 5 2x 3 1x 2 4x 3 = 1 CPD (DEI / IST) Parallel and Distributed Computing / 28
12 Forward Elimination, recall steps 1x 0 +1x 1 1x 2 4x 3 = 8 2x 1 3x 2 1x 3 = 5 2x 2 5x 2 4x 3 = 5 2x 3 1x 2 4x 3 = 1 Pivot: p 32 = a 32 /a 22 1x 0 +1x 1 1x 2 4x 3 = 8 2x 1 3x 2 1x 3 = 5 2x 2 3x 3 = 0 2x 3 1x 2 4x 3 = 1 CPD (DEI / IST) Parallel and Distributed Computing / 28
13 Back Substitution 1x 0 +1x 1 1x 2 +4x 3 = 8 2x 1 3x 2 +1x 3 = 5 2x 2 3x 3 = 0 2x 3 = 4 CPD (DEI / IST) Parallel and Distributed Computing / 28
14 Back Substitution 1x 0 +1x 1 1x 2 +4x 3 = 8 2x 1 3x 2 +1x 3 = 5 2x 2 3x 3 = 0 2x 3 = 4 x 3 = 2 1x 0 +1x 1 1x 2 = 0 2x 1 3x 2 = 3 2x 2 = 6 2x 3 = 4 CPD (DEI / IST) Parallel and Distributed Computing / 28
15 Back Substitution 1x 0 +1x 1 1x 2 = 0 2x 1 3x 2 = 3 2x 2 = 6 2x 3 = 4 CPD (DEI / IST) Parallel and Distributed Computing / 28
16 Back Substitution 1x 0 +1x 1 1x 2 = 0 2x 1 3x 2 = 3 2x 2 = 6 2x 3 = 4 x 3 = 2, x 2 = 3 1x 0 +1x 1 = 3 2x 1 = 12 2x 2 = 6 2x 3 = 4 CPD (DEI / IST) Parallel and Distributed Computing / 28
17 Back Substitution 1x 0 +1x 1 = 3 2x 1 = 12 2x 2 = 6 2x 3 = 4 CPD (DEI / IST) Parallel and Distributed Computing / 28
18 Back Substitution x 3 = 2, x 2 = 3, 1x 0 +1x 1 = 3 2x 1 = 12 2x 2 = 6 2x 3 = 4 x 1 = 6 1x 0 = 9 2x 1 = 12 2x 2 = 6 2x 3 = 4 CPD (DEI / IST) Parallel and Distributed Computing / 28
19 Back Substitution x 3 = 2, x 2 = 3, 1x 0 +1x 1 = 3 2x 1 = 12 2x 2 = 6 2x 3 = 4 x 1 = 6 1x 0 = 9 2x 1 = 12 2x 2 = 6 2x 3 = 4 x 3 = 2, x 2 = 3, x 1 = 6, x 0 = 9 CPD (DEI / IST) Parallel and Distributed Computing / 28
20 Pseudo-code for Back Substitution for i = n - 1 down to 1 do x[i] = b[i] / a[i,i] for j = 0 to i - 1 do b[j] = b[j] - x[i] * a[j,i] endfor endfor Complexity: Θ(n 2 ) CPD (DEI / IST) Parallel and Distributed Computing / 28
21 Pseudo-code for Back Substitution for i = n - 1 down to 1 do x[i] = b[i] / a[i,i] for j = 0 to i - 1 do b[j] = b[j] - x[i] * a[j,i] endfor endfor Complexity: Θ(n 2 ) Parallelization? CPD (DEI / IST) Parallel and Distributed Computing / 28
22 Pseudo-code for Back Substitution for i = n - 1 down to 1 do x[i] = b[i] / a[i,i] for j = 0 to i - 1 do b[j] = b[j] - x[i] * a[j,i] endfor endfor Complexity: Θ(n 2 ) Parallelization: cannot execute the outer loop in parallel can execute the inner loop in parallel CPD (DEI / IST) Parallel and Distributed Computing / 28
23 Row-oriented Algorithm for i = n - 1 down to 1 do x[i] = b[i] / a[i,i] for j = 0 to i - 1 do b[j] = b[j] - x[i] * a[j,i] endfor endfor associate primitive task with each row of A and corresponding elements of x and b during iteration i task associated with row j computes new value of b j task i must compute x i and broadcast its value agglomerate using rowwise interleaved striped decomposition CPD (DEI / IST) Parallel and Distributed Computing / 28
24 Complexity Analysis for i = n - 1 down to 1 do x[i] = b[i] / a[i,i] for j = 0 to i - 1 do b[j] = b[j] - x[i] * a[j,i] endfor endfor Complexity Analysis Computation Complexity: each process performs about n/(2p) iterations of loop j in all a total of n 1 iterations in all Overall computational complexity: Θ(n 2 /p) Communication Complexity: one broadcast per iteration, log p n 1 iterations Overall communication complexity: Θ(n log p) CPD (DEI / IST) Parallel and Distributed Computing / 28
25 Isoefficiency Analysis Isoefficiency analysis: T (n, 1) CT 0 (n, p) (T (n, 1) sequential time; T 0 (n, p) parallel overhead) Sequential time complexity: T (n, 1) = O(n 2 ) Parallel overhead dominated by broadcasts: O(n log p) T 0 (n, p) = p O(n log p) n 2 Cpn log p n Cp log p Scalability function: M(f (p))/p M(n) = n 2 M(Cp log p) p = C 2 p log 2 p Poor scalability... CPD (DEI / IST) Parallel and Distributed Computing / 28
26 LU Factorization Useful if solving for multiple right-hand-sides (same matrix) Ax = b 1, Ax = b 2, Compute LU factorization A = LU where L is unit lower triangular and U is upper triangular. Solution obtained in two steps Ly = b lower triangular system by forward-substitution to obtain vector y Ux = y upper triangular system by back-substitution to obtain solution x to original system CPD (DEI / IST) Parallel and Distributed Computing / 28
27 Factorization by Gaussian Elimination LU factorization can be computed by Gaussian elimination as follows, where U overwrites A for k = 1 to n 1 for i = k + 1 to n l ik = a ik /a kk end end for j = k + 1 to n for i = k + 1 to n a ij = a ij l ik a kj end end {loop over columns} {compute multipliers} {for current column} {apply transformation to} {remaining submatrix} CPD (DEI / IST) Parallel and Distributed Computing / 28
28 Factorization by Gaussian Elimination In general, row interchanges (pivoting) may be required to ensure existence of LU factorization and numerical stability of Gaussian elimination algorithm, but for simplicity we temporarily ignore this issue Gaussian elimination requires about n 3 /3 paired additions and multiplications, so model serial time as T 1 = t c n 3 /3 where t c is time required for multiply-add operation About n 2 /2 divisions also required, but we ignore this lower-order term CPD (DEI / IST) Parallel and Distributed Computing / 28
29 Loop Orderings for Gaussian Elimination Gaussian elimination has general form of triple-nested loop in which entries of L and U overwrite those of A for end for for end end a ij = a ij (a ik /a kk )a kj Perhaps most promising for parallel implementation are kij and kji forms, which differ only in accessing matrix by rows or columns, respectively CPD (DEI / IST) Parallel and Distributed Computing / 28
30 Gaussian Elimination Algorithm kij for of Gaussian elimination for k = 1 to n 1 for i = k + 1 to n l ik = a ik /a kk end end for j = k + 1 to n for i = k + 1 to n a ij = a ij l ik a kj end end Multipliers l ik computed outside inner loop for greater efficiency CPD (DEI / IST) Parallel and Distributed Computing / 28
31 Parallel Algorithm Partition For i, j = 1,, n, fine-grain task (i, j) stores a ij and computes and stores { uij, if i j l ij, if i > j yielding 2-D array of n 2 fine-grain tasks Communication Broadcast entries of A vertically to tasks below Broadcast entries of L horizontally to tasks to right CPD (DEI / IST) Parallel and Distributed Computing / 28
32 Fine-Grain Tasks and Communication CPD (DEI / IST) Parallel and Distributed Computing / 28
33 Fine-Grain Parallel Algorithm for k = 1 to min(i, j) 1 recv broadcast of a kj task (k, j) recv broadcast of l ik from task (i, k) a ij = a ij l ik a kj end if i j then else broadcast a ij to tasks (k, j), k = i + 1,, n recv broadcast of a jj from task (j, j) {vert bcast} {horiz bcast} {update entry} {vert bcast} {vert bcast} end l ij = a ij /a jj broadcast l ij to tasks (i, k), k = j + 1,, n {multiplier} {horiz bcast} CPD (DEI / IST) Parallel and Distributed Computing / 28
34 Agglomeration Agglomerate With n n array of fine-grain tasks, natural strategies are: 2-D: combine k k subarray of fine-grain tasks to form each coarse-grain task, yielding (n/k) 2 coarse-grain tasks 1-D column: combine n fine-grain tasks in each column into coarse-grain task, yielding n coarse-grain tasks 1-D row: combine n fine-grain tasks in each row into coarse-grain task, yielding n coarse-grain tasks CPD (DEI / IST) Parallel and Distributed Computing / 28
35 Mapping Map 2-D: assign (n/k) 2 /p coarse-grain tasks to each of p processes using any desired mapping in each dimension, treating target network as 2-D mesh 1-D: assign n/p coarse-grain tasks to each of p processes using any desired mapping, treating target network as 1-D mesh CPD (DEI / IST) Parallel and Distributed Computing / 28
36 Scalability for 2-D Agglomeration Updating by each process at step k requires about (n k) 2 /p operations Summing over n 1 steps T comp n 1 t c (n k) 2 /p k=1 t c n 3 /(3p) CPD (DEI / IST) Parallel and Distributed Computing / 28
37 Scalability for 2-D Agglomeration Similarly, amount of data broadcast at step k along each process row and column is about (n k)/ p, so on 2-D mesh T comm n 1 2(t s + t w (n k)/ p) k=1 2t s n + t w n 2 / p where we have allowed for overlap of broadcasts for successive steps Total execution time is Tp t c n 3 /(3p) + 2t s n + t w n 2 / p CPD (DEI / IST) Parallel and Distributed Computing / 28
38 Isoefficiency Analysis Isoefficiency analysis: T (n, 1) CT 0 (n, p) (T (n, 1) sequential time; T 0 (n, p) parallel overhead) Sequential time complexity: T (n, 1) = O(n 3 ) Parallel overhead dominated by broadcasts: O(2t s n + t w n 2 / p) = O(n 2 / p) T 0 (n, p) = p O(n 2 / p) n 3 C pn 2 n C p Scalability function: M(f (p))/p M(n) = n 2 M(C p) = C 2 p Perfect scalability! CPD (DEI / IST) Parallel and Distributed Computing / 28
39 Pivoting Pivoting is the action of exchanging matrix elements to use a different pivot Main reason is to choose pivot that creates fewer fillins during elimination: creates previous non-existent element Other reasons are numerical Partial pivoting complicates parallel implementation of Gaussian elimination and significantly affects potential performance With 2-D algorithm, pivot search is parallel but requires communication within process column and inhibits overlapping of successive steps With 1-D column algorithm, pivot search requires no communication but is purely serial Once pivot is found, index of pivot row must be communicated to other processes, and rows must be explicitly or implicitly interchanged in each process CPD (DEI / IST) Parallel and Distributed Computing / 28
40 Next Class Efficient parallelization of numerical algorithms Relaxation Methods Finite Difference discretization CPD (DEI / IST) Parallel and Distributed Computing / 28
Modified Generalized Integrated Interleaved Codes for Local Erasure Recovery
Modified Generalized Integrated Interleaved Codes for Local Erasure Recovery Xinmiao Zhang Dept. of Electrical and Computer Engineering The Ohio State University Outline Traditional failure recovery schemes
More informationOptimization of Multi-Channel BCH Error Decoding for Common Cases. Russell Dill Master's Thesis Defense April 20, 2015
Optimization of Multi-Channel BCH Error Decoding for Common Cases Russell Dill Master's Thesis Defense April 20, 2015 Bose-Chaudhuri-Hocquenghem (BCH) BCH is an Error Correcting Code (ECC) and is used
More informationVLSI System Testing. BIST Motivation
ECE 538 VLSI System Testing Krish Chakrabarty Built-In Self-Test (BIST): ECE 538 Krish Chakrabarty BIST Motivation Useful for field test and diagnosis (less expensive than a local automatic test equipment)
More informationMPEG has been established as an international standard
1100 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL. 9, NO. 7, OCTOBER 1999 Fast Extraction of Spatially Reduced Image Sequences from MPEG-2 Compressed Video Junehwa Song, Member,
More informationAN UNEQUAL ERROR PROTECTION SCHEME FOR MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS. M. Farooq Sabir, Robert W. Heath and Alan C. Bovik
AN UNEQUAL ERROR PROTECTION SCHEME FOR MULTIPLE INPUT MULTIPLE OUTPUT SYSTEMS M. Farooq Sabir, Robert W. Heath and Alan C. Bovik Dept. of Electrical and Comp. Engg., The University of Texas at Austin,
More informationMITOCW ocw f08-lec19_300k
MITOCW ocw-18-085-f08-lec19_300k The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free.
More informationUPDATE TO DOWNSTREAM FREQUENCY INTERLEAVING AND DE-INTERLEAVING FOR OFDM. Presenter: Rich Prodan
UPDATE TO DOWNSTREAM FREQUENCY INTERLEAVING AND DE-INTERLEAVING FOR OFDM Presenter: Rich Prodan 1 CURRENT FREQUENCY INTERLEAVER 2-D store 127 rows and K columns N I data subcarriers and scattered pilots
More informationHYBRID CONCATENATED CONVOLUTIONAL CODES FOR DEEP SPACE MISSION
HYBRID CONCATENATED CONVOLUTIONAL CODES FOR DEEP SPACE MISSION Presented by Dr.DEEPAK MISHRA OSPD/ODCG/SNPA Objective :To find out suitable channel codec for future deep space mission. Outline: Interleaver
More informationPost-Routing Layer Assignment for Double Patterning
Post-Routing Layer Assignment for Double Patterning Jian Sun 1, Yinghai Lu 2, Hai Zhou 1,2 and Xuan Zeng 1 1 Micro-Electronics Dept. Fudan University, China 2 Electrical Engineering and Computer Science
More informationImplementation of an MPEG Codec on the Tilera TM 64 Processor
1 Implementation of an MPEG Codec on the Tilera TM 64 Processor Whitney Flohr Supervisor: Mark Franklin, Ed Richter Department of Electrical and Systems Engineering Washington University in St. Louis Fall
More informationNote: Please use the actual date you accessed this material in your citation.
MIT OpenCourseWare http://ocw.mit.edu 18.06 Linear Algebra, Spring 2005 Please use the following citation format: Gilbert Strang, 18.06 Linear Algebra, Spring 2005. (Massachusetts Institute of Technology:
More informationCommunication Avoiding Successive Band Reduction
Communication Avoiding Successive Band Reduction Grey Ballard, James Demmel, Nicholas Knight UC Berkeley PPoPP 12 Research supported by Microsoft (Award #024263) and Intel (Award #024894) funding and by
More informationLUT Optimization for Distributed Arithmetic-Based Block Least Mean Square Adaptive Filter
LUT Optimization for Distributed Arithmetic-Based Block Least Mean Square Adaptive Filter Abstract: In this paper, we analyze the contents of lookup tables (LUTs) of distributed arithmetic (DA)- based
More information21.1. Unit 21. Hardware Acceleration
21.1 Unit 21 Hardware Acceleration 21.2 Motivation When designing hardware we have nearly unlimited control and parallelism at our disposal We can create structures that may dramatically improve performance
More informationREDUCED-COMPLEXITY DECODING FOR CONCATENATED CODES BASED ON RECTANGULAR PARITY-CHECK CODES AND TURBO CODES
REDUCED-COMPLEXITY DECODING FOR CONCATENATED CODES BASED ON RECTANGULAR PARITY-CHECK CODES AND TURBO CODES John M. Shea and Tan F. Wong University of Florida Department of Electrical and Computer Engineering
More informationSequential Logic Notes
Sequential Logic Notes Andrew H. Fagg igital logic circuits composed of components such as AN, OR and NOT gates and that do not contain loops are what we refer to as stateless. In other words, the output
More informationCPS311 Lecture: Sequential Circuits
CPS311 Lecture: Sequential Circuits Last revised August 4, 2015 Objectives: 1. To introduce asynchronous and synchronous flip-flops (latches and pulsetriggered, plus asynchronous preset/clear) 2. To introduce
More informationPermutations of the Octagon: An Aesthetic-Mathematical Dialectic
Proceedings of Bridges 2015: Mathematics, Music, Art, Architecture, Culture Permutations of the Octagon: An Aesthetic-Mathematical Dialectic James Mai School of Art / Campus Box 5620 Illinois State University
More informationMPEG-2. ISO/IEC (or ITU-T H.262)
1 ISO/IEC 13818-2 (or ITU-T H.262) High quality encoding of interlaced video at 4-15 Mbps for digital video broadcast TV and digital storage media Applications Broadcast TV, Satellite TV, CATV, HDTV, video
More information2. AN INTROSPECTION OF THE MORPHING PROCESS
1. INTRODUCTION Voice morphing means the transition of one speech signal into another. Like image morphing, speech morphing aims to preserve the shared characteristics of the starting and final signals,
More informationA Framework for Segmentation of Interview Videos
A Framework for Segmentation of Interview Videos Omar Javed, Sohaib Khan, Zeeshan Rasheed, Mubarak Shah Computer Vision Lab School of Electrical Engineering and Computer Science University of Central Florida
More informationCS 61C: Great Ideas in Computer Architecture
CS 6C: Great Ideas in Computer Architecture Combinational and Sequential Logic, Boolean Algebra Instructor: Alan Christopher 7/23/24 Summer 24 -- Lecture #8 Review of Last Lecture OpenMP as simple parallel
More informationDesign for Test. Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective.
Design for Test Definition: Design for test (DFT) refers to those design techniques that make test generation and test application cost-effective. Types: Design for Testability Enhanced access Built-In
More informationChapter 5: Synchronous Sequential Logic
Chapter 5: Synchronous Sequential Logic NCNU_2016_DD_5_1 Digital systems may contain memory for storing information. Combinational circuits contains no memory elements the outputs depends only on the inputs
More informationSequential Logic. Analysis and Synthesis. Joseph Cavahagh Santa Clara University. r & Francis. TaylonSi Francis Group. , Boca.Raton London New York \
Sequential Logic Analysis and Synthesis Joseph Cavahagh Santa Clara University r & Francis TaylonSi Francis Group, Boca.Raton London New York \ CRC is an imprint of the Taylor & Francis Group, an informa
More informationPart 1: Introduction to Computer Graphics
Part 1: Introduction to Computer Graphics 1. Define computer graphics? The branch of science and technology concerned with methods and techniques for converting data to or from visual presentation using
More information1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.
[Question 1 is compulsory] 1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. Figure 1.1 b) Minimize the following Boolean functions:
More informationLecture 3: Nondeterministic Computation
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 3: Nondeterministic Computation David Mix Barrington and Alexis Maciel July 19, 2000
More informationProceedings of the Third International DERIVE/TI-92 Conference
Description of the TI-92 Plus Module Doing Advanced Mathematics with the TI-92 Plus Module Carl Leinbach Gettysburg College Bert Waits Ohio State University leinbach@cs.gettysburg.edu waitsb@math.ohio-state.edu
More informationAn Efficient High Speed Wallace Tree Multiplier
Chepuri satish,panem charan Arur,G.Kishore Kumar and G.Mamatha 38 An Efficient High Speed Wallace Tree Multiplier Chepuri satish, Panem charan Arur, G.Kishore Kumar and G.Mamatha Abstract: The Wallace
More informationMVP: Capture-Power Reduction with Minimum-Violations Partitioning for Delay Testing
MVP: Capture-Power Reduction with Minimum-Violations Partitioning for Delay Testing Zhen Chen 1, Krishnendu Chakrabarty 2, Dong Xiang 3 1 Department of Computer Science and Technology, 3 School of Software
More informationPitch correction on the human voice
University of Arkansas, Fayetteville ScholarWorks@UARK Computer Science and Computer Engineering Undergraduate Honors Theses Computer Science and Computer Engineering 5-2008 Pitch correction on the human
More informationMultimedia Communications. Image and Video compression
Multimedia Communications Image and Video compression JPEG2000 JPEG2000: is based on wavelet decomposition two types of wavelet filters one similar to what discussed in Chapter 14 and the other one generates
More informationPart 2.4 Turbo codes. p. 1. ELEC 7073 Digital Communications III, Dept. of E.E.E., HKU
Part 2.4 Turbo codes p. 1 Overview of Turbo Codes The Turbo code concept was first introduced by C. Berrou in 1993. The name was derived from an iterative decoding algorithm used to decode these codes
More informationObjectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath
Objectives Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath In the previous chapters we have studied how to develop a specification from a given application, and
More informationcs281: Introduction to Computer Systems Lab07 - Sequential Circuits II: Ant Brain
cs281: Introduction to Computer Systems Lab07 - Sequential Circuits II: Ant Brain 1 Problem Statement Obtain the file ant.tar from the class webpage. After you untar this file in an empty directory, you
More informationA Low-Power 0.7-V H p Video Decoder
A Low-Power 0.7-V H.264 720p Video Decoder D. Finchelstein, V. Sze, M.E. Sinangil, Y. Koken, A.P. Chandrakasan A-SSCC 2008 Outline Motivation for low-power video decoders Low-power techniques pipelining
More informationImproving Performance in Neural Networks Using a Boosting Algorithm
- Improving Performance in Neural Networks Using a Boosting Algorithm Harris Drucker AT&T Bell Laboratories Holmdel, NJ 07733 Robert Schapire AT&T Bell Laboratories Murray Hill, NJ 07974 Patrice Simard
More informationCOMP 249 Advanced Distributed Systems Multimedia Networking. Video Compression Standards
COMP 9 Advanced Distributed Systems Multimedia Networking Video Compression Standards Kevin Jeffay Department of Computer Science University of North Carolina at Chapel Hill jeffay@cs.unc.edu September,
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Final Examination CLOSED BOOK
Department of Electrical and Computer Engineering University of Wisconsin Madison Fall 2014-2015 Final Examination CLOSED BOOK Kewal K. Saluja Date: December 14, 2014 Place: Room 3418 Engineering Hall
More informationMusic Alignment and Applications. Introduction
Music Alignment and Applications Roger B. Dannenberg Schools of Computer Science, Art, and Music Introduction Music information comes in many forms Digital Audio Multi-track Audio Music Notation MIDI Structured
More informationDigital Logic Design I
Digital Logic Design I Synchronous Sequential Logic Mustafa Kemal Uyguroğlu Sequential Circuits Asynchronous Inputs Combinational Circuit Memory Elements Outputs Synchronous Inputs Combinational Circuit
More informationFPGA Implementation of DA Algritm for Fir Filter
International Journal of Computational Engineering Research Vol, 03 Issue, 8 FPGA Implementation of DA Algritm for Fir Filter 1, Solmanraju Putta, 2, J Kishore, 3, P. Suresh 1, M.Tech student,assoc. Prof.,Professor
More informationAn Overview of Video Coding Algorithms
An Overview of Video Coding Algorithms Prof. Ja-Ling Wu Department of Computer Science and Information Engineering National Taiwan University Video coding can be viewed as image compression with a temporal
More informationColor Quantization of Compressed Video Sequences. Wan-Fung Cheung, and Yuk-Hee Chan, Member, IEEE 1 CSVT
CSVT -02-05-09 1 Color Quantization of Compressed Video Sequences Wan-Fung Cheung, and Yuk-Hee Chan, Member, IEEE 1 Abstract This paper presents a novel color quantization algorithm for compressed video
More information1/ 19 2/17 3/23 4/23 5/18 Total/100. Please do not write in the spaces above.
1/ 19 2/17 3/23 4/23 5/18 Total/100 Please do not write in the spaces above. Directions: You have 50 minutes in which to complete this exam. Please make sure that you read through this entire exam before
More informationIMS B007 A transputer based graphics board
IMS B007 A transputer based graphics board INMOS Technical Note 12 Ray McConnell April 1987 72-TCH-012-01 You may not: 1. Modify the Materials or use them for any commercial purpose, or any public display,
More informationDesign and Implementation of Partial Reconfigurable Fir Filter Using Distributed Arithmetic Architecture
Design and Implementation of Partial Reconfigurable Fir Filter Using Distributed Arithmetic Architecture Vinaykumar Bagali 1, Deepika S Karishankari 2 1 Asst Prof, Electrical and Electronics Dept, BLDEA
More informationCURIE Day 3: Frequency Domain Images
CURIE Day 3: Frequency Domain Images Curie Academy, July 15, 2015 NAME: NAME: TA SIGN-OFFS Exercise 7 Exercise 13 Exercise 17 Making 8x8 pictures Compressing a grayscale image Satellite image debanding
More informationPAM4 signals for 400 Gbps: acquisition for measurement and signal processing
TITLE PAM4 signals for 400 Gbps: acquisition for measurement and signal processing Image V1.00 1 Introduction, content High speed serial data links are in the process in increasing line speeds from 25
More informationDesign of Fault Coverage Test Pattern Generator Using LFSR
Design of Fault Coverage Test Pattern Generator Using LFSR B.Saritha M.Tech Student, Department of ECE, Dhruva Institue of Engineering & Technology. Abstract: A new fault coverage test pattern generator
More informationBuilt-In Self-Test (BIST) Abdil Rashid Mohamed, Embedded Systems Laboratory (ESLAB) Linköping University, Sweden
Built-In Self-Test (BIST) Abdil Rashid Mohamed, abdmo@ida ida.liu.se Embedded Systems Laboratory (ESLAB) Linköping University, Sweden Introduction BIST --> Built-In Self Test BIST - part of the circuit
More informationHybrid Discrete-Continuous Computer Architectures for Post-Moore s-law Era
Hybrid Discrete-Continuous Computer Architectures for Post-Moore s-law Era Keynote at the Bi annual HiPEAC Compu6ng Systems Week Mee6ng Barcelona, Spain October 19 th 2010 Prof. Simha Sethumadhavan Columbia
More informationOn the design of turbo codes with convolutional interleavers
University of Wollongong Research Online University of Wollongong Thesis Collection 1954-2016 University of Wollongong Thesis Collections 2005 On the design of turbo codes with convolutional interleavers
More informationSynchronization Overhead in SOC Compressed Test
TVLSI-289-23.R Synchronization Overhead in Compressed Test Paul Theo Gonciari, Member, IEEE, Bashir Al-Hashimi, Senior Member, IEEE, and Nicola Nicolici, Member, IEEE, Abstract Test data compression is
More informationComputer Architecture and Organization
A-1 Appendix A - Digital Logic Computer Architecture and Organization Miles Murdocca and Vincent Heuring Appendix A Digital Logic A-2 Appendix A - Digital Logic Chapter Contents A.1 Introduction A.2 Combinational
More informationLogic Design II (17.342) Spring Lecture Outline
Logic Design II (17.342) Spring 2012 Lecture Outline Class # 05 February 23, 2012 Dohn Bowden 1 Today s Lecture Analysis of Clocked Sequential Circuits Chapter 13 2 Course Admin 3 Administrative Admin
More informationNormalization Methods for Two-Color Microarray Data
Normalization Methods for Two-Color Microarray Data 1/13/2009 Copyright 2009 Dan Nettleton What is Normalization? Normalization describes the process of removing (or minimizing) non-biological variation
More informationDigital Principles and Design
Digital Principles and Design Donald D. Givone University at Buffalo The State University of New York Grauu Boston Burr Ridge, IL Dubuque, IA Madison, Wl New York San Francisco St. Louis Bangkok Bogota
More informationArea and Speed Efficient Implementation of Symmetric FIR Digital Filter through Reduced Parallel LUT Decomposed DA Approach
Circuits and Systems, 216, 7, 1379-1391 Pulished Online June 216 in SciRes. http://www.scirp.org/journal/cs http://dx.doi.org/1.4236/cs.216.78121 Area and Speed Efficient Implementation of Symmetric FIR
More informationApplication of Symbol Avoidance in Reed-Solomon Codes to Improve their Synchronization
Application of Symbol Avoidance in Reed-Solomon Codes to Improve their Synchronization Thokozani Shongwe Department of Electrical and Electronic Engineering Science, University of Johannesburg, P.O. Box
More informationComputer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 CRT Display Devices
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 CRT Display Devices Hello everybody, welcome back to the lecture on Computer
More informationModule 8 VIDEO CODING STANDARDS. Version 2 ECE IIT, Kharagpur
Module 8 VIDEO CODING STANDARDS Lesson 27 H.264 standard Lesson Objectives At the end of this lesson, the students should be able to: 1. State the broad objectives of the H.264 standard. 2. List the improved
More informationCPSC 221 Basic Algorithms and Data Structures
CPSC 221 A Sophomoric Introduction to Shared-Memory Parallelism and Concurrency, part 2 Page 1 CPSC 221 Basic Algorithms and Data Structures A Sophomoric Introduction to Shared-Memory Parallelism and Concurrency,
More informationL11/12: Reconfigurable Logic Architectures
L11/12: Reconfigurable Logic Architectures Acknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of California, Berkeley,
More informationVideo Signals and Circuits Part 2
Video Signals and Circuits Part 2 Bill Sheets K2MQJ Rudy Graf KA2CWL In the first part of this article the basic signal structure of a TV signal was discussed, and how a color video signal is structured.
More informationFinite State Machine Design
Finite State Machine Design One machine can do the work of fifty ordinary men; no machine can do the work of one extraordinary man. -E. Hubbard Nothing dignifies labor so much as the saving of it. -J.
More informationDigital Logic Design ENEE x. Lecture 24
Digital Logic Design ENEE 244-010x Lecture 24 Announcements Homework 9 due today Thursday Office Hours (12/10) from 2:30-4pm Course Evaluations at the end of class today. https://www.courseevalum.umd.edu/
More informationTERRESTRIAL broadcasting of digital television (DTV)
IEEE TRANSACTIONS ON BROADCASTING, VOL 51, NO 1, MARCH 2005 133 Fast Initialization of Equalizers for VSB-Based DTV Transceivers in Multipath Channel Jong-Moon Kim and Yong-Hwan Lee Abstract This paper
More informationHidden Markov Model based dance recognition
Hidden Markov Model based dance recognition Dragutin Hrenek, Nenad Mikša, Robert Perica, Pavle Prentašić and Boris Trubić University of Zagreb, Faculty of Electrical Engineering and Computing Unska 3,
More informationCS2401-COMPUTER GRAPHICS QUESTION BANK
SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY THIRUPACHUR. CS2401-COMPUTER GRAPHICS QUESTION BANK UNIT-1-2D PRIMITIVES PART-A 1. Define Persistence Persistence is defined as the time it takes
More informationFooling the Masses with Performance Results: Old Classics & Some New Ideas
Fooling the Masses with Performance Results: Old Classics & Some New Ideas Gerhard Wellein (1,2), Georg Hager (2) (1) Department for Computer Science (2) Erlangen Regional Computing Center Friedrich-Alexander-Universität
More informationProject Design. Eric Chang Mike Ilardi Jess Kaneshiro Jonathan Steiner
Project Design Eric Chang Mike Ilardi Jess Kaneshiro Jonathan Steiner Introduction In developing the Passive Sonar, our group intendes to incorporate lessons from both Embedded Systems and E:4986, the
More informationThe XYZ Colour Space. 26 January 2011 WHITE PAPER. IMAGE PROCESSING TECHNIQUES
www.omnitek.tv IMAE POESSIN TEHNIQUES The olour Space The colour space has the unique property of being able to express every colour that the human eye can see which in turn means that it can express every
More informationALONG with the progressive device scaling, semiconductor
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II: EXPRESS BRIEFS, VOL. 57, NO. 4, APRIL 2010 285 LUT Optimization for Memory-Based Computation Pramod Kumar Meher, Senior Member, IEEE Abstract Recently, we
More informationOn the Characterization of Distributed Virtual Environment Systems
On the Characterization of Distributed Virtual Environment Systems P. Morillo, J. M. Orduña, M. Fernández and J. Duato Departamento de Informática. Universidad de Valencia. SPAIN DISCA. Universidad Politécnica
More informationFlip Flop. S-R Flip Flop. Sequential Circuits. Block diagram. Prepared by:- Anwar Bari
Sequential Circuits The combinational circuit does not use any memory. Hence the previous state of input does not have any effect on the present state of the circuit. But sequential circuit has memory
More informationMultimedia Communications. Video compression
Multimedia Communications Video compression Video compression Of all the different sources of data, video produces the largest amount of data There are some differences in our perception with regard to
More informationThe trigger for the New Electromagnetic Calorimeter NewCal
The trigger for the New Electromagnetic Calorimeter NewCal Feasibility studies (2d version) Charles F. Perdrisat June 21,2012 6/20/2012 1 Assumptions: HERA-B midsection shashlik detectors available, 2128
More informationIG Discovery for FDX DOCSIS
IG Discovery for FDX DOCSIS A Technical paper prepared for SCTE/ISBE by Tong Liu Principal Engineer, Office of the CTO Cisco Systems Inc. 300 Beaver Brook Road, Boxborough, Massachusetts 01719, United
More informationImplementation of Memory Based Multiplication Using Micro wind Software
Implementation of Memory Based Multiplication Using Micro wind Software U.Palani 1, M.Sujith 2,P.Pugazhendiran 3 1 IFET College of Engineering, Department of Information Technology, Villupuram 2,3 IFET
More informationComputer Vision for HCI. Image Pyramids. Image Pyramids. Multi-resolution image representations Useful for image coding/compression
Computer Vision for HCI Image Pyramids Image Pyramids Multi-resolution image representations Useful for image coding/compression 2 1 Image Pyramids Operations: General Theory Two fundamental operations
More informationThe reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem.
State Reduction The reduction in the number of flip-flops in a sequential circuit is referred to as the state-reduction problem. State-reduction algorithms are concerned with procedures for reducing the
More informationA repetition-based framework for lyric alignment in popular songs
A repetition-based framework for lyric alignment in popular songs ABSTRACT LUONG Minh Thang and KAN Min Yen Department of Computer Science, School of Computing, National University of Singapore We examine
More informationMATHEMATICAL APPROACH FOR RECOVERING ENCRYPTION KEY OF STREAM CIPHER SYSTEM
MATHEMATICAL APPROACH FOR RECOVERING ENCRYPTION KEY OF STREAM CIPHER SYSTEM Abdul Kareem Murhij Radhi College of Information Engineering, University of Nahrian,Baghdad- Iraq. Abstract Stream cipher system
More informationUNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers.
UNIT 1: DIGITAL LOGICAL CIRCUITS What is Digital Computer? OR Explain the block diagram of digital computers. Digital computer is a digital system that performs various computational tasks. The word DIGITAL
More informationUNIVERSAL SPATIAL UP-SCALER WITH NONLINEAR EDGE ENHANCEMENT
UNIVERSAL SPATIAL UP-SCALER WITH NONLINEAR EDGE ENHANCEMENT Stefan Schiemenz, Christian Hentschel Brandenburg University of Technology, Cottbus, Germany ABSTRACT Spatial image resizing is an important
More informationAugmentation Matrix: A Music System Derived from the Proportions of the Harmonic Series
-1- Augmentation Matrix: A Music System Derived from the Proportions of the Harmonic Series JERICA OBLAK, Ph. D. Composer/Music Theorist 1382 1 st Ave. New York, NY 10021 USA Abstract: - The proportional
More informationA Comprehensive Approach to the Partial Scan Problem using Implicit State Enumeration
A Comprehensive Approach to the Partial Scan Problem using Implicit State Enumeration Priyank Kalla and Maciej Ciesielski Department of Electrical and Computer Engineering University of Massachusetts Amherst,
More informationJazz Melody Generation and Recognition
Jazz Melody Generation and Recognition Joseph Victor December 14, 2012 Introduction In this project, we attempt to use machine learning methods to study jazz solos. The reason we study jazz in particular
More informationFigure 1.LFSR Architecture ( ) Table 1. Shows the operation for x 3 +x+1 polynomial.
High-speed Parallel Architecture and Pipelining for LFSR Vinod Mukati PG (M.TECH. VLSI engineering) student, SGVU Jaipur (Rajasthan). Vinodmukati9@gmail.com Abstract Linear feedback shift register plays
More informationSequential Logic Circuits
Sequential Logic Circuits By Dr. M. Hebaishy Digital Logic Design Ch- Rem.!) Types of Logic Circuits Combinational Logic Memoryless Outputs determined by current values of inputs Sequential Logic Has memory
More informationNH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS
NH 67, Karur Trichy Highways, Puliyur C.F, 639 114 Karur District DEPARTMENT OF ELETRONICS AND COMMUNICATION ENGINEERING COURSE NOTES SUBJECT: DIGITAL ELECTRONICS CLASS: II YEAR ECE SUBJECT CODE: EC2203
More informationCHAPTER 2 SUBCHANNEL POWER CONTROL THROUGH WEIGHTING COEFFICIENT METHOD
CHAPTER 2 SUBCHANNEL POWER CONTROL THROUGH WEIGHTING COEFFICIENT METHOD 2.1 INTRODUCTION MC-CDMA systems transmit data over several orthogonal subcarriers. The capacity of MC-CDMA cellular system is mainly
More informationPython Quick-Look Utilities for Ground WFC3 Images
Instrument Science Report WFC3 2008-002 Python Quick-Look Utilities for Ground WFC3 Images A.R. Martel January 25, 2008 ABSTRACT A Python module to process and manipulate ground WFC3 UVIS and IR images
More informationInvestigation of Digital Signal Processing of High-speed DACs Signals for Settling Time Testing
Universal Journal of Electrical and Electronic Engineering 4(2): 67-72, 2016 DOI: 10.13189/ujeee.2016.040204 http://www.hrpub.org Investigation of Digital Signal Processing of High-speed DACs Signals for
More informationCryptanalysis of LILI-128
Cryptanalysis of LILI-128 Steve Babbage Vodafone Ltd, Newbury, UK 22 nd January 2001 Abstract: LILI-128 is a stream cipher that was submitted to NESSIE. Strangely, the designers do not really seem to have
More informationChapter 12. Synchronous Circuits. Contents
Chapter 12 Synchronous Circuits Contents 12.1 Syntactic definition........................ 149 12.2 Timing analysis: the canonic form............... 151 12.2.1 Canonic form of a synchronous circuit..............
More informationSwept-tuned spectrum analyzer. Gianfranco Miele, Ph.D
Swept-tuned spectrum analyzer Gianfranco Miele, Ph.D www.eng.docente.unicas.it/gianfranco_miele g.miele@unicas.it Video section Up until the mid-1970s, spectrum analyzers were purely analog. The displayed
More informationOperating Bio-Implantable Devices in Ultra-Low Power Error Correction Circuits: using optimized ACS Viterbi decoder
Operating Bio-Implantable Devices in Ultra-Low Power Error Correction Circuits: using optimized ACS Viterbi decoder Roshini R, Udhaya Kumar C, Muthumani D Abstract Although many different low-power Error
More information