DOC PREVIEW
neely-dynamic-compress

This preview shows page 1-2-17-18-19-35-36 out of 36 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 36 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Dynamic Data Compression for Wireless Transmission over a Fading ChannelPowerPoint PresentationSlide 3Slide 4Slide 5Slide 6Slide 7Slide 8Slide 9Slide 10Slide 11Slide 12Slide 13Slide 14Slide 15Slide 16Slide 17Slide 18Slide 19Slide 20Slide 21Slide 22Slide 23Slide 24Slide 25Slide 26Slide 27Slide 28Slide 29Slide 30Slide 31Slide 32Slide 33Slide 34Slide 35Slide 36Dynamic Data Compression for WirelessTransmission over a Fading Channel Michael J. NeelyUniversity of Southern CaliforniaCISS 2008*Sponsored in part by the DARPA IT-MANET Program, NSF OCE-0520324, NSF Career CCF-074752512NCompressionS(t) = Channel State12NCompressionS(t) = Channel State-Random Packet Arrivals A(t)-Stochastic Channel S(t)-Data must be Compressed, Stored, and TransmittedBoth Compression and Transmission expend power!Goal: Minimize Total Average Power Expenditure Ptot = Pcomp + Ptran(signal processing consumes power)Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function = Random bit size output after compression12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example: A(t) = 2, K(t)=k (A(t), K(t)) = (1.1)B bits (random output) Pcomp(t) = .2 mW (random output)12N(A(t), K(t))1.1Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 2: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 2: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 2: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 2: A(t) = 2, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 2: A(t) = 2, K(t)=k (A(t), K(t)) = (0.9)B bits (random output) Pcomp(t) = .3 mW (random output)12N(A(t), K(t))0.9Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 3: A(t) = 3, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t) {0, 1, …, K})(A(t), K(t)) = Compression Function Example 3: A(t) = 3, K(t)=k (A(t), K(t)) = ?? (random output) Pcomp(t) = ?? (random output)12N(A(t), K(t))Compression Operation: Timeslotted System: t = {0,1, 2, 3,…} A(t) = # packet arrivals at time t (fixed packets size B bits, A(t) {0, 1, …, N} ) K(t) = Compression Decision Option at time t (K(t)


neely-dynamic-compress

Download neely-dynamic-compress
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view neely-dynamic-compress and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view neely-dynamic-compress 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?