LTE course

LTE an initialism of Long Term Evolution, marketed as 4G LTE, is a standard for wireless communication of high-speed data for mobile phones and data terminals. It is based on the GSM/EDGE and UMTS/HSPA network technologies, increasing the capacity and speed using a different radio interface together with core network improvements.

Source : Wikipedia





Now I present the famous LTE course for the famous mobile instructor Eng. Waleed Elsafoury. 
I hope you like it.

Chapter-1 : LTE Introduction.

LTE Introduction from Waleed Elsafoury

Chapter-2 : LTE Enabling Technologies.

LTE Technologies from Waleed Elsafoury

Chapter-3 : LTE Network Structure.

LTE Network from Waleed Elsafoury

Chapter-4 : LTE Radio Interface.

LTE Air Interface from Waleed Elsafoury

Chapter-5 : LTE Procedures.

LTE Procedures from Waleed Elsafoury

Chapter-6 : LTE Physical Layer.

LTE Physical layer from Waleed Elsafoury

Please feel free to leave a comment if there is a dead link or a problem with the links.

Read more ...

Digital Design Lectures

Course Structure:

• Boolean Algebra and switching functions; Minimization and realization using logic gates, ROMs (Read Only Memories), PLAs (Programmable Logic Arrays), multiplexers.
• Circuits for code conversion; Flip-flops, registers, counters.
• Finite state model: State tables and diagrams; State minimization; Excitation functions of memory elements.
• Synthesis of synchronous sequential circuits; Representation and synthesis using ASM charts; Incompletely specified machines.
• Specification and synthesis of asynchronous sequential machines.
• Number representation: fixed and floating point; Addition, subtraction, multiplication and division of numbers.
• Current trends in digital design: ASIC, FPGA, etc.

Lecture Slides:

1. Introduction to Digital Design PDF Slides
2. Number System PDF Slides
3. Operations in Number System and Boolean Algebra PDF Slides
4. Boolean Algebra and Theorems PDF Slides
5. Gates, Truth Table, Min Term, MaxTerm, Canonical Form PDF Slides [[[Mano Book and Vahid Book]]]
6.  KMap-Logic Minimization PDF Slides
7. KMap-Logic Minimization PDFSlides
8. KMap-Logic Minimization PDFSlides
9. MUX and Decoder, Logic Implementation using MUX/Decoder PDF Slides
10. Adders/BCD Adder Delays, Quine-McCluskey (QM) Logic Minimization Motivation and Examples PDF Slides
11. QM Examples and Programming Method, Complexity PDF Slides[[[Mano Book]]]
12. Sequential Logic Design: SR Latch PDF Slides
13. SR Latch (Race Condition: Ensure, Stabilize, Store), D latch, Clocked Flip Flop PDF Slides
14. Flip-Flop: Level/Edge Sensitive, Master Slave, J-K and FF Universality, Characteristic Equations PDF Slides [[[ Givone Book]]]
15. Register (Storing State Example), Introduction to FSM PDF Slides
16. FSM and Examples PDF Slides
17. FSM Controller Implementation PDF Slides [[[ Vahid Book]]]
18. FSM Controller Examples: Press button Sync, Sequence Generator, 2 bit Binary Counter, FSM Controller using Other FFs PDF Slides
19. Counters (Binary(Sync/Async), Mod N Counter, FF Excitation Table, Counter using D/T/JK/RS FFs) PDF Slides [[[ Givone Book]]]
20. Counter Based on Shift Regsiter PDF Slides
21. Designing of Multi Function Register PDF Slides [[[ Vahid Book ]]]
22. Adder (Basic Model: Ripple carry Model), Carry Analysis (Ganeration, Propagation, Kill) PDF Slides [[[ Ercegovac and Lang Book ]]]
23. Adder Machester, Carry Skip and Carry Select PDF Slides
24. Adder Delay Analysis: RCA, mRCA, CSkipA, CSelA and Logarithmic Adder (Carry look ahead Adder) PDF Slides [[[ Ercegovac and Lang Book ]]]
25. Multiplication and quiz PDF Slides
26. Multiplication PDF Slides
27. Division PDF Slides
28. Floating points: Represenation (float,double), Density, Operation and Accuracy (X+1=X) PDF Slides
29. HDL Introduction PDF Slides
30. VHDL: Syntax, Model, Test Bench and Tool (GHDL and GTKWAVE) PDF Slides
31. VHDL: Test Bench, Package, Library, Generic/generate, (Adder, Mux, Register) PDF Slides
32. VHDL: Model and Synthesis PDF Slides

Books:

Text:

1. Frank Vahid, Digital Design (Preview Edition), Wiely India Edition, 2005
2. M. Morris Mano and M. D. Ciletti, Digital Design, 4/e, Pearson Education, 2007.
3. Donald D. Givone, Digital Principles and Design, McGraw-Hill, 2003

References:

1. Ercegovac and Lang, Digital Arithmatic, Morgan Kauffman, 2004
2. R. H. Katz and G. Boriello, Contemporary Logic Design, 2/e, Prentice Hall of India, 2009.

For more details (exams, tests, assignments and quiz) you can visit the following links:

Link

Please feel free to leave a comment if there is a dead link or a problem with the links.

Read more ...

Introduction to Probability and Statistics Lectures

Course Description

This course provides an elementary introduction to probability and statistics with applications. Topics include: basic probability models; combinatorics; random variables; discrete and continuous probability distributions; statistical estimation and testing; confidence intervals; and an introduction to linear regression.

Lecture Notes

LEC #	TOPICS	LECTURE NOTES
1	Probability, Set Operations	(PDF)
2	Properties of Probability Finite Sample Spaces, Some Combinatorics	(PDF)
3	Multinomial Coefficients, Union of Events	(PDF)
4	Matching Problem, Conditional Probability	(PDF)
5	Independence of Events	(PDF)
6	Solutions to Problem Set 1	(PDF)
7	Bayes' Formula	(PDF)
8	Random Variables and Distributions	(PDF)
9	Cumulative Distribution Function	(PDF)
10	Marginal Distributions	(PDF)
11	Conditional Distributions, Multivariate Distributions	(PDF)
12	Functions of Random Variables, Convolution	(PDF)
13	Functions of Random Variables: Sum, Product, Ratio, Maximum, Change of Variables	(PDF)
14	Linear Transformations of Random Vectors, Review of Problem Set 4	(PDF)
15	Review for Exam 1	(PDF)
16	Expectation, Chebyshev's Inequality	(PDF)
17	Properties of Expectation, Variance, Standard Deviation	(PDF)
18	Law of Large Numbers, Median	(PDF)
19	Covariance and Correlation, Cauchy-Schwartz Inequality	(PDF)
20	Poisson Distribution, Approximation of Binomial Distribution, Normal Distribution	(PDF)
21	Normal Distribution, Central Limit Theorem	(PDF)
22	Central Limit Theorem, Gamma Distribution, Beta Distribution	(PDF)
23	Estimation Theory, Bayes' Estimators	(PDF)
24	Bayes' Estimators	(PDF)
25	Maximum Likelihood Estimators	(PDF)
26	Chi-square Distribution, t-distribution, Confidence Intervals for Parameters of Normal Distribution	(PDF)
27	Confidence Intervals for Parameters of Normal Distribution	(PDF)
28	Review for Exam 2	(PDF)
29	Hypotheses Testing, Bayes' Decision Rules	(PDF)
30	Most Powerful Test for Two Simple Hypotheses	(PDF)
31	t-test	(PDF)
32	Two-sample t-test, Goodness-of-fit Tests, Pearson's Theorem	(PDF)
33	Simple Goodness-of-fit Test, Composite Hypotheses	(PDF)
34	Contingency Tables, Tests of Independence and Homogeneity	(PDF)
35	Kolmogorov-Smirnov Goodness-of-fit Test	(PDF)
36	Review of Test 2	(PDF)
37	Review for the Final Exam	(PDF)

Exams and Solutions

PRACTICE TESTS                 SOLUTIONS

Practice Test 1 (PDF)             (PDF)

Practice Test 2 (PDF)             (PDF)

Please feel free to leave a comment if there is a dead link or a problem with the links.

Read more ...

Object-Oriented Programming Using C++ Book Slides

An introduction to the C++ language. Topics will include data types, control structures, functions, pointers, arrays, I/O streams, classes, objects, encapsulation, overloading, inheritance and use of these concepts in problem solving.

These are the slides of the book Object-Oriented Programming Using C++ , 4th Edition by Robert LaFore.

Chapter 1: The Big Picture : Chapter 1 Slides
Chapter 2: C++ Programming Basics : Chapter 2 Slides (Includes pp. 634 - 638)
Chapter 3: Loops and Decisions : Chapter 3 Slides
Chapter 4: Structures, Unions, and Enumerations : Chapter 4 Slides
Chapter 5: Functions : Chapter 5 Slides (Includes pp. 443 - 448)
Chapter 6: Classes and Objects : Chapter 6 Slides (Includes pp. 458 - 465 and 638 - 651)
Chapter 7: Arrays and Strings : Chapter 7 Slides (Includes pp. 440 - 443 and 452 - 457)
Chapter 8: Operator Overloading : Chapter 8 Slides (Also includes pp. 520 - 528 and Associations (pp. 357 - 358) are covered with chapter 9)
Chapter 9: Class Relationships : Chapter 9 Slides (Includes pp. 357 - 358)
Chapter 10: Pointers and Dynamic Memory : Chapter 10 Slides
Chapter 11: Polymorphism and Virtual Functions : Chapter 11 Slides
Chapter 12: Streams and Files (File I/O) : Chapter 12 Slides
Chapter 14: Templates and Exceptions : Chapter 14 Slides

For more details, examples and assignments on this course you can visit the following link:
Link

Please feel free to leave a comment if there is a dead link or a problem with the links.

Read more ...

Digital Signal Processing Video Lectures

Course Description

This course was developed in 1987 by the MIT Center for Advanced Engineering Studies. It was designed as a distance-education course for engineers and scientists in the workplace.

Advances in integrated circuit technology have had a major impact on the technical areas to which digital signal processing techniques and hardware are being applied. A thorough understanding of digital signal processing fundamentals and techniques is essential for anyone whose work is concerned with signal processing applications.

Digital Signal Processing begins with a discussion of the analysis and representation of discrete-time signal systems, including discrete-time convolution, difference equations, the z-transform, and the discrete-time Fourier transform. Emphasis is placed on the similarities and distinctions between discrete-time. The course proceeds to cover digital network and non-recursive (finite impulse response) digital filters. Digital Signal Processing concludes with digital filter design and a discussion of the fast Fourier transform algorithm for computation of the discrete Fourier transform.

Instructors:

Prof. Alan V. Oppenheim

Video Lectures:

Demonstration 1: Sampling, Aliasing, and Frequency Response, Part 1. (Go to this video)

Demonstration 2: Sampling, Aliasing, and Frequency Response, Part 2. (Go to this video)

Lecture 1: Introduction. (Go to this video)

Lecture 2: Discrete-Time Signals and Systems, Part 1. (Go to this video)

Lecture 3: Discrete-Time Signals and Systems, Part 2. (Go to this video)

Lecture 4: The Discrete-Time Fourier Transform. (Go to this video)

Lecture 5: The z-Transform. (Go to this video)

Lecture 6: The Inverse z-Transform. (Go to this video)

Lecture 7: z-Transform Properties. (Go to this video)

Lecture 8: The Discrete Fourier Series. (Go to this video)

Lecture 9: The Discrete Fourier Transform. (Go to this video)

Lecture 10: Circular Convolution. (Go to this video)

Lecture 11: Representation of Linear Digital Networks. (Go to this video)

Lecture 12: Network Structures for Infinite Impulse Response (IIR) Systems. (Go to this video)

Lecture 13: Network Structures for Finite Impulse Response (FIR) Systems and Parameter Quantization Effects in Digital Filter Structures. (Go to this video)

Lecture 14: Design of IIR Digital Filters, Part 1. (Go to this video)

Lecture 15: Design of IIR Digital Filters, Part 2. (Go to this video)

Lecture 16: Digital Butterworth Filters. (Go to this video)

Lecture 17: Design of FIR Digital Filters. (Go to this video)

Lecture 18: Computation of the Discrete Fourier Transform, Part 1. (Go to this video)

Lecture 19: Computation of the Discrete Fourier Transform, Part 2. (Go to this video)

Lecture 20: Computation of the Discrete Fourier Transform, Part 3. (Go to this video)

Lecture Notes:

LEC #	TOPICS	LECTURE NOTES	PROBLEM SOLUTIONS
1	Introduction	(PDF)
2	Discrete-time signals and systems, part 1	(PDF)	(PDF)
3	Discrete-time signals and systems, part 2	(PDF)	(PDF)
4	The discrete-time Fourier transform	(PDF)	(PDF)
5	The z-transform	(PDF)	(PDF)
6	The inverse z-transform	(PDF)	(PDF)
7	Z-transform properties	(PDF)	(PDF)
8	The discrete Fourier series	(PDF)	(PDF)
9	The discrete Fourier transform	(PDF)	(PDF)
10	Circular convolution	(PDF)	(PDF)
11	Representation of linear digital networks	(PDF)	(PDF)
12	Network structures for infinite impulse response (IIR) systems	(PDF)	(PDF)
13	Network structures for finite impulse response (FIR) systems and parameter quantization effects in digital filter structures	(PDF)	(PDF)
14	Design of IIR digital filters, part 1	(PDF)	(PDF)
15	Design of IIR digital filters, part 2	(PDF)	(PDF)
16	Digital Butterworth filters	(PDF)	(PDF)
17	Design of FIR digital filters	(PDF)	(PDF)
18	Computation of the discrete Fourier transform, part 1	(PDF)	(PDF)
19	Computation of the discrete Fourier transform, part 2	(PDF)	(PDF)
20	Computation of the discrete Fourier transform, part 3	(PDF)	(PDF)

For more information you can visit the following link:

Click Here

Please feel free to leave a comment if there is a dead link or a problem with the links.

Read more ...