DOCSLIB.ORG

Lossless Video Coding EE398B 2007.4.19 2/54 Isis Itit Worthyworthy Toto Sacrificesacrifice Compressioncompression Ratio?Ratio?

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lossless Video Coding EE398B 2007.4.19 2/54 Isis Itit Worthyworthy Toto Sacrificesacrifice Compressioncompression Ratio?Ratio? Stanford EE398B April 19, 2007 LosslessLossless VVideoideo CodingCoding Dr.Dr. SeishiSeishi TakamuraTakamura NTTNTT CorporationCorporation JapanJapan “Lossy”“Lossy” vs. vs. “Lossless”“Lossless” Lossy image/video coding Lossless image/video coding – Input != Output – Input == Output – High compression – Low compression (~1/10 - 1/1000) (~1/2 -1/3) – Possibly be – “mathematically lossless” “perceptually lossless” – This is what’s meant “lossless” in this talk Takamura: Lossless Video Coding EE398B 2007.4.19 2/54 IsIs ItIt WorthyWorthy toto SacrificeSacrifice CompressionCompression Ratio?Ratio? Yes, for many practical reasons – Medical diagnosis, fine art archive, military purposes – Image/video analysis, automatic product examination The observer is not a human — “perceptually lossless” does not make sense – Contribution transmission, studio applications Subject to be re-encoded/edited repeatedly — coding error accumulates, if lossy and Yes for some emotional reasons – A CG artist said, “Just do not lose even one bit from my artwork!” – Provides an upper-bound of image quality (can feel at ease) – Fed up with drawing R-D curves, evaluating Lagrange cost function, subjective impairment measurement, HVS… Takamura: Lossless Video Coding EE398B 2007.4.19 3/54 OutlineOutline Lossless image coding – Typical schemes and technology – FYI: Lossless image codecs comparison Lossless video coding – Lossless variants of lossy H.264/AVC – Using reversible transforms – Using DCT residual packing – FYI: Lossless video codecs comparison Summary Takamura: Lossless Video Coding EE398B 2007.4.19 4/54 OutlineOutline Lossless image coding – Typical schemes and technology – FYI: Lossless image codecs comparison Lossless video coding – Lossless variants of lossy H.264/AVC – Using reversible transforms – Using DCT residual packing – FYI: Lossless video codecs comparison Summary Takamura: Lossless Video Coding EE398B 2007.4.19 5/54 TypicalTypical LosslessLossless ImageImage CodecsCodecs Algorithm Method Note Prediction Entropy coding GIF — LZW up to 256 colors TIFF — LZW Linear prediction DEFLATE PNG (LZ77+Huffman) JPEG* Linear prediction Huffman *lossless mode JPEG 2000 reversible (5,3) DWT Arithmetic coding (EBCOT) context-based Golomb based on JPEG-LS Median prediction (run-length in flat region) “LOCO” method Context-based linear Huffman / Arithmetic CALIC prediction + nonlinear coding Better Compression correction Takamura: Lossless Video Coding EE398B 2007.4.19 6/54 PredictionPrediction SchemesSchemes Linear prediction – Fixed, encoder-optimized and online-update predictors x – Using causal pixels (extrapolative DPCM) – Using non-causal pixels (interpolative DPCM) – Block transform – Reversible DWT x – Reversible DCT – R/G/B decorrelation Median prediction Markov model c – Build a stochastic model of the image x – Encode the pixel occurrence probability: Prob(x|c) – cf. minimum MSE prediction = Σx(Prob(x|c)*x) Pixelwise residual (“Lossy plus lossless”) approach – Consider another lossy coder (e.g., JPEG) as a predictor – Entropy code the pixel-wise residual Decoded Original Residual –= (lossy) image data (And motion compensation for video) Takamura: Lossless Video Coding EE398B 2007.4.19 7/54 OutlineOutline Lossless image coding – Typical schemes and technology – FYI: Lossless image codecs comparison Lossless video coding – Lossless variants of lossy H.264/AVC – Using reversible transforms – Using DCT residual packing – FYI: Lossless video codecs comparison Summary Takamura: Lossless Video Coding EE398B 2007.4.19 8/54 ARTest Codec Comparison (full-color) 3 2.9 2.8 2.7 2.6 Compression Ratio 2.5 2.4 Top 14 codecs out of 26 [The art of lossless Average of 627 full-color (24-bit) imag 2.3 Also provides encoding/decoding time comparison BMF RKIM data compression, 2002] Takamura: Lossless Video CodingUHIC NK ERI ArHanGeL es, weighted by image size (#pixels) UHArc ACE 25% LSP SBC DC EE398B 2007.4.19RK PNGCrush LOCO Base of JPEG-LS 9/54 MRPMRP —— A A Gray-ScaleGray-Scale LosslessLossless ImageImage CodecCodec [Matsuda et al., 2005] Context-based 2D-linear prediction – M=20-56 contexts (predictors) – P=30-72 pixels from current frame – All M·P coefficients are optimized for minimum rate, not for minimum MSE, and downloaded Encoding time: 10-25 minutes per frame Decoding time: 0.2 seconds per frame Takamura: Lossless Video Coding EE398B 2007.4.19 10/54 SUT Codec Comparison (gray-scale) 2.2 2.1 2.0 1.6% Compression Ratio 1.9 Average of 13 gray-scale (8-bit) images Weighted by image size (#pixels) http://itohws03.ee.noda.sut.ac.jp/~matsuda/mrp/ CALICa: CALIC with arithmetic1.8 coding CALICh: CALIC with Huffman coding MRP Takamura: Lossless Video CodingBMF TMW 9.5% Glicbawls CALICa JPEG-LS EE398B 2007.4.19CALICh Note: Conditions are different from previousJP comparisonEG 2000 11/54 OutlineOutline Lossless image coding – Typical schemes and technology – FYI: Lossless image codecs comparison Lossless video coding – Lossless variants of lossy H.264/AVC – Using reversible transforms [Takamura, ICASSP2005] – Using DCT residual packing – FYI: Lossless video codecs comparison Summary Takamura: Lossless Video Coding EE398B 2007.4.19 12/54 LosslessLossless CodingCoding ofof H.264H.264 FRExtFRExt H.264 FRExt skips the transform and quantization entropy entropy entropy reduction reduction reduction Inter/Intra 4x4/8x8 Quanti- Zigzag Entropy Video prediction transform zation scan coding FREｘｔ thru Entropy remains the same Takamura: Lossless Video Coding EE398B 2007.4.19 13/54 EnhancementEnhancement ofof FRExtFRExt Instead of no-operation (FRExt), we apply reversible transform to reduce entropy We compared four transforms Aiming at entropy Reversible reduction transform Inter/Intra 4x4/8x8 Quanti- Zigzag Entropy Video prediction transform zation scan coding FREｘｔ thru Takamura: Lossless Video Coding EE398B 2007.4.19 14/54 ReversibleReversible TransformsTransforms TestedTested 4x4 Transform of H.264 (reversible if not quantized) Piecewise Scaled Transform Reversible DCT Linear Prediction – Non-adaptive version – Adaptive version Takamura: Lossless Video Coding EE398B 2007.4.19 15/54 4x44x4 ReversibleReversible TransformTransform H.264H.264 4x44x4 TransformTransform Transform coefficients A B C D 1 1 1 1 1 2 1 1 ⎡⎡ A B C D⎤⎤ ⎡⎡1 1 1 1 ⎤⎤⎡⎡ Intra/ ⎤⎤⎡⎡1 2 1 1 ⎤⎤ ⎢⎢ ⎥⎥ ⎢⎢ ⎥⎥⎢⎢ ⎥⎥⎢⎢ ⎥⎥ EE FF GG HH 22 11 −−11 −−22 Inter 11 11 −−11 −−22 ⎢⎢ ⎥⎥ == ⎢⎢ ⎥⎥⎢⎢ ⎥⎥⎢⎢ ⎥⎥ ⎢⎢ II JJ KK LL⎥⎥ ⎢⎢11 −−11 −−11 11 ⎥⎥⎢⎢prediction ⎥⎥⎢⎢11 −−11 −−11 22 ⎥⎥ ⎢⎢ ⎥⎥ ⎢⎢ ⎥⎥⎢⎢ residual ⎥⎥⎢⎢ ⎥⎥ ⎣⎣MM NN OO PP⎦⎦ ⎣⎣11 −−22 22 −−11⎦⎦⎣⎣ ⎦⎦⎣⎣11 −−22 11 −−11⎦⎦ Obviously reversible (if not quantized) Signal correlation is reduced… However, the signal space is expanded – 2.66 bit/pixel increment – Corrupts coding performance Takamura: Lossless Video Coding EE398B 2007.4.19 16/54 4x44x4 ReversibleReversible TransformTransform PiecewisePiecewise ScaledScaled TransformTransform Decompose H.264’s 4x4 transform into equivalent four 2x2 transforms, and compensate the expansion at each stage 1 1 1 1 1 1 1 1 1 –1 1 –1 1 –1 2 1 –1 2 1 1 2 1 1 1 2 1 1 –1 1 –2 1 –1 2 1 –2 5 Output is still H.264 transform Piecewise scaled transform (decomposed) reversible! 2 Divide by 2 and round 5 Divide by 5 and round Takamura: Lossless Video Coding EE398B 2007.4.19 17/54 4x44x4 ReversibleReversible TransformTransform ReversibleReversible DCTDCT [Komatsu, Sezaki, 1996] X 0 = R((x0 + x1 + x2 + x3 ) / 4) X1 = x0 − x3 + R((x1 − x2 ) / C) X 2 = R((x0 − x1 − x2 + x3 ) / 2) X 3 = R((x0 − x3 ) / C) − x1 + x2 where R(x) = ⎣⎦x + 0.5 This is parallel to – H.264’s 4x4 transform, when C=2 – Parallel to mathematical DCT, when C =1+ 2 (recommended by the paper) We tried C = 1 + 2 , 3 and 3.5 Takamura: Lossless Video Coding EE398B 2007.4.19 18/54 4x44x4 ReversibleReversible TransformTransform LinearLinear PredictionPrediction ((non-adaptive)non-adaptive) Horizontal: Apply following transform to four rows αΗx0 αΗx1 αΗx2 pred. pred. pred. Input x0 x1 x2 x3 Output x0 R(x1 -αΗ x0) R(x2 -αΗ x1) R(x3 -αΗ x2) Vertical: transform the columns in the same manner, using αV αH = αV =0.7 works good for I frames αH = αV =0.4 works good for P and B frames Takamura: Lossless Video Coding EE398B 2007.4.19 19/54 4x44x4 ReversibleReversible TransformTransform LinearLinear PredictionPrediction ((adaptive)adaptive) Optimal coefficient α is image dependent In energy concentration sense, autocorrelation factor gives an optimal α. (But not known to the decoder unless explicitly transmitted) We estimate α from neighboring decoded blocks ρH , ρV : horizontal and vertical Highest autocorrelation factors in a block weight ρH ρH ρH ρH ρV ρV default αΗ, αV ρV ρV weighted weighted average average ρH coded ρH coded αΗ, αV coded Highest αΗ, αV ρV block ρV block block weight If horizontally correlated If vertically correlated If not correlated Takamura: Lossless Video Coding EE398B 2007.4.19 20/54 The smaller, More constant, TransformTransform ComparisonComparison the better the better Transform ⎡1 0 0 0⎤ Determinant Norm of each row ⎢0 1 0 0⎥ ⎢ ⎥ 1,1,1,1 FREｘｔ ⎢0 0 1 0⎥ 1 ( ) ⎢ ⎥ ⎣0 0 0 1⎦ ⎡1 1 1 1 ⎤ ⎢ ⎥ H.264 ⎢2 1 −1 −2⎥ ⎢1 −1 −1 1 ⎥ 40 (2, 10,2, 10) Transform ⎢ ⎥ ⎣1 −2 2 −1⎦ ⎡ 1 1 1 1 ⎤ ⎢ ⎥ Piecewise ⎢ 1 1/ 2 −1/ 2 −1 ⎥ ⎢1/ 2 −1/ 2 −1/ 2 1/ 2 ⎥ 1 (2, 10 / 2,1, 10 /10) Scaled ⎢ ⎥ ⎣1/10 −1/ 5 1/ 5 −1/10⎦ ⎡1/ 4 1/ 4 1/ 4 1/ 4 ⎤ ⎢ 1 1/ C −1/ C −1 ⎥ Reversible ⎢ ⎥ 2 2 2 ⎢1/ 2 −1/ 2 −1/ 2 1/ 2 ⎥ 1+1/C (1/ 2, 2 + 2C / C,1, 2 + 2C / C) DCT ⎢ ⎥ ⎣1/ C −1 1 −1/ C⎦ ⎡ 1 0 0 0⎤ Non- ⎢ ⎥ Linear ⎢−α 1 0 0⎥ orthogonal 2 2 2 ⎢ 0 −α 1 0⎥ 1 1, 1+α , 1+α , 1+α Prediction ⎢ ⎥ ( ) ⎣ 0 0 −α 1⎦ Takamura: Lossless Video Coding EE398B 2007.4.19 21/54 SimulationSimulation ConditionsConditions 4 QCIF sequences and 5 CIF sequences I frame performance – Encoded 100 frames (all intra) – Compared with Motion JPEG 2000 (kakadu codec) P frame performance – Encoded 100 frames in IPPP… structure – Coding performance is obtained from 99 P frames B frame performance – Encoded 298 frames in IBBPBBP… structure – Coding performance is obtained from 198 B frames Takamura: Lossless Video Coding EE398B 2007.4.19 22/54 ResultsResults (average(average ofof 99 sequences)sequences) H.264 trans.
Load more

Recommended publications
  • Digital Speech Processing— Lecture 17
    Digital Speech Processing— Lecture 17 Speech Coding Methods Based on Speech Models 1 Waveform Coding versus Block Processing • Waveform coding – sample-by-sample matching of waveforms – coding quality measured using SNR • Source modeling (block processing) – block processing of signal => vector of outputs every block – overlapped blocks Block 1 Block 2 Block 3 2 Model-Based Speech Coding • we’ve carried waveform coding based on optimizing and maximizing SNR about as far as possible – achieved bit rate reductions on the order of 4:1 (i.e., from 128 Kbps PCM to 32 Kbps ADPCM) at the same time achieving toll quality SNR for telephone-bandwidth speech • to lower bit rate further without reducing speech quality, we need to exploit features of the speech production model, including: – source modeling – spectrum modeling – use of codebook methods for coding efficiency • we also need a new way of comparing performance of different waveform and model-based coding methods – an objective measure, like SNR, isn’t an appropriate measure for model- based coders since they operate on blocks of speech and don’t follow the waveform on a sample-by-sample basis – new subjective measures need to be used that measure user-perceived quality, intelligibility, and robustness to multiple factors 3 Topics Covered in this Lecture • Enhancements for ADPCM Coders – pitch prediction – noise shaping • Analysis-by-Synthesis Speech Coders – multipulse linear prediction coder (MPLPC) – code-excited linear prediction (CELP) • Open-Loop Speech Coders – two-state excitation
    [Show full text]
  • Audio Coding for Digital Broadcasting
    Recommendation ITU-R BS.1196-7 (01/2019) Audio coding for digital broadcasting BS Series Broadcasting service (sound) ii Rec. ITU-R BS.1196-7 Foreword The role of the Radiocommunication Sector is to ensure the rational, equitable, efficient and economical use of the radio- frequency spectrum by all radiocommunication services, including satellite services, and carry out studies without limit of frequency range on the basis of which Recommendations are adopted. The regulatory and policy functions of the Radiocommunication Sector are performed by World and Regional Radiocommunication Conferences and Radiocommunication Assemblies supported by Study Groups. Policy on Intellectual Property Right (IPR) ITU-R policy on IPR is described in the Common Patent Policy for ITU-T/ITU-R/ISO/IEC referenced in Resolution ITU-R 1. Forms to be used for the submission of patent statements and licensing declarations by patent holders are available from http://www.itu.int/ITU-R/go/patents/en where the Guidelines for Implementation of the Common Patent Policy for ITU-T/ITU-R/ISO/IEC and the ITU-R patent information database can also be found. Series of ITU-R Recommendations (Also available online at http://www.itu.int/publ/R-REC/en) Series Title BO Satellite delivery BR Recording for production, archival and play-out; film for television BS Broadcasting service (sound) BT Broadcasting service (television) F Fixed service M Mobile, radiodetermination, amateur and related satellite services P Radiowave propagation RA Radio astronomy RS Remote sensing systems S Fixed-satellite service SA Space applications and meteorology SF Frequency sharing and coordination between fixed-satellite and fixed service systems SM Spectrum management SNG Satellite news gathering TF Time signals and frequency standards emissions V Vocabulary and related subjects Note: This ITU-R Recommendation was approved in English under the procedure detailed in Resolution ITU-R 1.
    [Show full text]
  • TMS320C6000 U-Law and A-Law Companding with Software Or The
    Application Report SPRA634 - April 2000 TMS320C6000t µ-Law and A-Law Companding with Software or the McBSP Mark A. Castellano Digital Signal Processing Solutions Todd Hiers Rebecca Ma ABSTRACT This document describes how to perform data companding with the TMS320C6000 digital signal processors (DSP). Companding refers to the compression and expansion of transfer data before and after transmission, respectively. The multichannel buffered serial port (McBSP) in the TMS320C6000 supports two companding formats: µ-Law and A-Law. Both companding formats are specified in the CCITT G.711 recommendation [1]. This application report discusses how to use the McBSP to perform data companding in both the µ-Law and A-Law formats. This document also discusses how to perform companding of data not coming into the device but instead located in a buffer in processor memory. Sample McBSP setup codes are provided for reference. In addition, this application report discusses µ-Law and A-Law companding in software. The appendix provides software companding codes and a brief discussion on the companding theory. Contents 1 Design Problem . 2 2 Overview . 2 3 Companding With the McBSP. 3 3.1 µ-Law Companding . 3 3.1.1 McBSP Register Configuration for µ-Law Companding. 4 3.2 A-Law Companding. 4 3.2.1 McBSP Register Configuration for A-Law Companding. 4 3.3 Companding Internal Data. 5 3.3.1 Non-DLB Mode. 5 3.3.2 DLB Mode . 6 3.4 Sample C Functions. 6 4 Companding With Software. 6 5 Conclusion . 7 6 References . 7 TMS320C6000 is a trademark of Texas Instruments Incorporated.
    [Show full text]
  • Bit Rate Adaptation Using Linear Quadratic Optimization for Mobile Video Streaming
    applied sciences Article Bit Rate Adaptation Using Linear Quadratic Optimization for Mobile Video Streaming Young-myoung Kang 1 and Yeon-sup Lim 2,* 1 Network Business, Samsung Electronics, Suwon 16677, Korea; [email protected] 2 Department of Convergence Security Engineering, Sungshin Women’s University, Seoul 02844, Korea * Correspondence: [email protected]; Tel.: +82-2-920-7144 Abstract: Video streaming application such as Youtube is one of the most popular mobile applications. To adjust the quality of video for available network bandwidth, a streaming server provides multiple representations of video of which bit rate has different bandwidth requirements. A streaming client utilizes an adaptive bit rate (ABR) scheme to select a proper representation that the network can support. However, in mobile environments, incorrect decisions of an ABR scheme often cause playback stalls that significantly degrade the quality of user experience, which can easily happen due to network dynamics. In this work, we propose a control theory (Linear Quadratic Optimization)- based ABR scheme to enhance the quality of experience in mobile video streaming. Our simulation study shows that our proposed ABR scheme successfully mitigates and shortens playback stalls while preserving the similar quality of streaming video compared to the state-of-the-art ABR schemes. Keywords: dynamic adaptive streaming over HTTP; adaptive bit rate scheme; control theory 1. Introduction Video streaming constitutes a large fraction of current Internet traffic. In particular, video streaming accounts for more than 65% of world-wide mobile downstream traffic [1]. Commercial streaming services such as YouTube and Netflix are implemented based on Citation: Kang, Y.-m.; Lim, Y.-s.
    [Show full text]
  • A Predictive H.263 Bit-Rate Control Scheme Based on Scene
    A PRJ3DICTIVE H.263 BIT-RATE CONTROL SCHEME BASED ON SCENE INFORMATION Pohsiang Hsu and K. J. Ray Liu Department of Electrical and Computer Engineering University of Maryland at College Park College Park, Maryland, USA ABSTRACT is typically constant bit rate (e.g. PSTN). Under this cir- cumstance, the encoder’s output bit-rate must be regulated For many real-time visual communication applications such to meet the transmission bandwidth in order to guaran- as video telephony, the transmission channel in used is typ- tee a constant frame rate and delay. Given the channel ically constant bit rate (e.g. PSTN). Under this circum- rate and a target frame rate, we derive the target bits per stance, the encoder’s output bit-rate must be regulated to frame by distribute the channel rate equally to each hme. meet the transmission bandwidth in order to guarantee a Ffate control is typically based on varying the quantization constant frame rate and delay. In this work, we propose a paraneter to meet the target bit budget for each frame. new predictive rate control scheme based on the activity of Many rate control scheme for the block-based DCT/motion the scene to be coded for H.263 encoder compensation video encoders have been proposed in the past. These rate control algorithms are typically focused on MPEG video coding standards. Rate-Distortion based rate 1. INTRODUCTION control for MPEG using Lagrangian optimization [4] have been proposed in the literature. These methods require ex- In the past few years, emerging demands for digital video tensive,rate-distortion measurements and are unsuitable for communication applications such as video conferencing, video real time applications.
    [Show full text]
  • White Paper: the AAC Audio Coding Family for Broadcast and Cable TV
    WHITE PAPER Fraunhofer Institute for THE AAC AUDIO CODING FAMILY FOR Integrated Circuits IIS BROADCAST AND CABLE TV Management of the institute Prof. Dr.-Ing. Albert Heuberger (executive) Over the last few years, the AAC audio codec family has played an increasingly important Dr.-Ing. Bernhard Grill role as an enabling technology for state-of-the-art multimedia systems. The codecs Am Wolfsmantel 33 combine high audio quality with very low bit-rates, allowing for an impressive audio 91058 Erlangen experience even over channels with limited bandwidth, such as those in broadcasting or www.iis.fraunhofer.de mobile multimedia streaming. The AAC audio coding family also includes special low delay versions, which allow high quality two way communication. Contact Matthias Rose Phone +49 9131 776-6175 [email protected] Contact USA Fraunhofer USA, Inc. Digital Media Technologies* Phone +1 408 573 9900 [email protected] Contact China Toni Fiedler [email protected] Contact Japan Fahim Nawabi Phone: +81 90-4077-7609 [email protected] Contact Korea Youngju Ju Phone: +82 2 948 1291 [email protected] * Fraunhofer USA Digital Media Technologies, a division of Fraunhofer USA, Inc., promotes and supports the products of Fraunhofer IIS in the U. S. Audio and Media Technologies The AAC Audio Coding Family for Broadcast and Cable TV www.iis.fraunhofer.de/audio 1 / 12 A BRIEF HISTORY AND OVERVIEW OF THE MPEG ADVANCED AUDIO CODING FAMILY The first version of Advanced Audio Coding (AAC) was standardized in 1994 as part of the MPEG-2 standard.
    [Show full text]
  • Limit to the Bit-Rate Capacity of Electrical Interconnects from the Aspect Ratio of the System Architecture by D
    Limit to the Bit-Rate Capacity of Electrical Interconnects from the Aspect Ratio of the System Architecture by D. A. B. Miller Ginzton Laboratory Stanford University Stanford, CA 94305-4085 and H. M. Özaktas Bilkent University Department of Electrical Engineering TR-06533 Bilkent Ankara, Turkey Preprint G. L. Report No. 5458 October 1996 To be published in: Special Issue on Parallel Computing with Optical Interconnects Journal of Parallel and Distributed Computing /LPLWWRWKH%LW5DWH&DSDFLW\RI(OHFWULFDO,QWHUFRQQHFWVIURP WKH$VSHFW5DWLRRIWKH6\VWHP$UFKLWHFWXUH D. A. B. Miller Ginzton Laboratory, Stanford University Stanford, CA 94305-4085 and H. M. Özaktas Bilkent University Department of Electrical Engineering TR-06533 Bilkent Ankara, Turkey Abstract We show that there is a limit to the total number of bits per second, B, of information that can flow in a simple digital electrical interconnection that is set only by the ratio of the length " of the interconnection to the total cross-sectional dimension A of the interconnect wiring — the “aspect ratio” of the interconnection. This limit is largely independent of the details of the design "2 15 of the electrical lines. The limit is approximately B ~ Bo A/ bits/s, with Bo ~ 10 (bit/s) for high- performance strip lines and cables, ~1016 for small on-chip lines, and ~1017-1018 for equalized lines. Because the limit is scale-invariant, neither growing or shrinking the size of the system substantially changes the limit. Exceeding this limit requires techniques such as repeatering, coding, and multilevel modulation. Such a limit will become a problem as machines approach Tb/s information bandwidths.
    [Show full text]
  • Power-Efficient ELF Wireless Communications Using Electro-Mechanical Transmitters
    Received November 20, 2019, accepted December 18, 2019, date of publication December 23, 2019, date of current version January 6, 2020. Digital Object Identifier 10.1109/ACCESS.2019.2961708 Power-Efficient ELF Wireless Communications Using Electro-Mechanical Transmitters JARRED S. GLICKSTEIN 1, (Student Member, IEEE), JIFU LIANG 1, (Member, IEEE), SEUNGDEOG CHOI 2, (Senior Member, IEEE), ARJUNA MADANAYAKE 3, (Senior Member, IEEE), AND SOUMYAJIT MANDAL 1, (Senior Member, IEEE) 1Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA 2Department of Electrical and Computer Engineering, Mississippi State University, Starkville, MS 39762, USA 3Department of Electrical and Computer Engineering, Florida International University, Miami, FL 33174, USA Corresponding author: Jarred S. Glickstein ([email protected]) ABSTRACT Ultra-miniaturized and highly power-efficient ELF (0.3-3 kHz) transmitters are desirable for underground and undersea wireless communications. This paper proposes the use of rotating permanently polarized dipoles (magnets or electrets) for such applications. A power-efficient data modulation scheme based on continuous-frequency FSK (CF-FSK) is also proposed for such electro-mechanical transmitters. Theoretical analysis and simulations show that 7-ary CF-FSK is optimal in the sense that it minimizes average mechanical torque on the mechatronic antenna for a given bit rate. Preliminary experimental results from a prototype ELF magnetic-field based transmitter based on a high-strength rare-earth (NdFeB) magnet and small brushless DC (BLDC) motor are presented. The results highlight local environment challenges such as power line interference that affect the choice of data encoding and modulation schemes. Reliable non-line- of-sight (NLOS) communication through concrete barriers at 100 Hz and ∼0.25 bit/sec is demonstrated at distances up to ∼5 m.
    [Show full text]
  • Bit-Rate Reduction for Digital Tv Signals
    - 1 - Rep. ITU-R BT.2005 REPORT ITU-R BT.2005 BIT-RATE REDUCTION FOR DIGITAL TV SIGNALS (1995) 1 Introduction The rapid development of source coding techniques and their realization with the help of integrated circuits leads to the conclusion that in the near future many new services will be created which are based on picture coding techniques. Applications will be found not only in the field of broadcasting but also in the area of interactive audiovisual communications. With the techniques available today, a high data rate reduction factor is achievable together with a high quality of the decoded picture. Therefore, efficient use of existing networks is possible and the costs of picture transmission can be significantly reduced. This Report takes the form of a bibliography with a brief summary given of the contents of each item. It contains books, papers and documents relevant to bit-rate reduction coding and error-correction giving basic information and many references for further investigation for the reader interested in more detailed information. During the compilation of this Report great care was taken to ensure that the books mentioned are commercially available and that the papers are likely to be found in a technically-orientated library. 2 Introduction to bit-rate reduction techniques 2.1 Predictive, transform and subband coding techniques Jayant, N. and Noll, P.: Digital Coding of Waveforms. Prentice Hall 1984. Introduction to the principles of digital coding for video and speech: Sampling, Quantization, PCM, DPCM, Delta modulation, Delayed Decision Coding, Run-Length Coding, Subband Coding, Transform Coding. Survey of basic techniques with many references.
    [Show full text]
  • Introduction to Computer Music Week 13 Audio Data Compression Version 1, 13 Nov 2018
    Introduction to Computer Music Week 13 Audio Data Compression Version 1, 13 Nov 2018 Roger B. Dannenberg Topics Discussed: Compression Techniques, Coding Redundancy, Intersample Redundancy, Psycho-Perceptual Redundancy, MP3, LPC, Physical Models/Speech Synthesis, Music Notation 1 Introduction to General Compression Techniques High-quality audio takes a lot of space—about 10M bytes/minute for CD-quality stereo. Now that disk capacity is measured in terabytes, storing uncompressed audio is feasible even for personal libraries, but compression is still useful for smaller devices, downloading audio over the Internet, or sometimes just for convenience. What can we do to reduce the data explosion? Data compression is simply storing the same information in a shorter string of symbols (bits). The goal is to store the most information in the smallest amount of space, without compromising the quality of the signal (or at least, compromising it as little as possible). Compression techniques and research are not limited to digital sound—–data compression plays an essential part in the storage and transmission of all types of digital information, from word- processing documents to digital photographs to full-screen, full-motion videos. As the amount of information in a medium increases, so does the importance of data compression. What is compression exactly, and how does it work? There is no one thing that is “data compression.” Instead, there are many different approaches, each addressing a different aspect of the problem. We’ll take a look at a few ways to compress digital audio information. What’s important about these different ways of compressing data is that they tend to illustrate some basic ideas in the representation of information, particularly sound, in the digital world.
    [Show full text]
  • Digital Communications GATE Online Coaching Classes
    GATE Online Coaching Classes Digital Communications Online Class-2 • By • Dr.B.Leela Kumari • Assistant Professor, • Department of Electronics and Communications Engineering • University college of Engineering Kakinada • Jawaharlal Nehru Technological University Kakinada 6/15/2020 Dr. B. Leela Kumari UCEK JNTUK Kakinada 1 6/15/2020 Dr. B. Leela Kumari UCEK JNTUK Kakinada 1 Session -2 Baseband Transmission • Introduction to Pulse analog Transmission • Quantization and coding • Classification of Uniform Quantization • Line Coding • Non Uniform Quantization • Objective type Questions & Illustrative Problems 6/15/2020 Dr. B. Leela Kumari UCEK JNTUK Kakinada 3 Pulse Analog Transmission Pulse modulation: One of the parameters of the carrier is varied in accordance with the instantaneous value of the modulating signal Classification: Pulse Amplitude Modulation(PAM) Pulse Time Modulation(PTM) Pulse Width Modulation(PWM) Pulse Position Modulation(PPM) Pulse Amplitude Modulation(PAM) Pulse Width Modulation(PWM) Pulse Position Modulation(PPM) Comparisions Quantization Pulse analog modulation systems are not completely digital Sampled signals are used to get a complete digital signal Sampled signals are first quantized and then coded to get complete digital signal Input Signal digital signal Sampler Quantizer Encoder Sampler samples the analog signal Quantizer: Does the Quantizing (approximation) Quantized signal is an approximation to the original signal The Quality of approximation improved by reducing the step Size Encoder translates the Quantized signal more appropriate format of signal Operation of Quantization Process of Quantization Consider message signal m(t) ,whose range is from VL to VH Divide this range in to M equal intervals, each size S, Step size S= (VL –VH )/M In the center of each of these steps ,locate Quantization levels,m0,m1,m2….
    [Show full text]
  • Introduction to Data Compression, by Guy E. Blelloch
    Introduction to Data Compression∗ Guy E. Blelloch Computer Science Department Carnegie Mellon University blellochcs.cmu.edu January 31, 2013 Contents 1 Introduction 3 2 Information Theory 5 2.1 Entropy ........................................ 5 2.2 The Entropy of the English Language . ...... 6 2.3 Conditional Entropy and Markov Chains . ...... 7 3 Probability Coding 10 3.1 PrefixCodes...................................... 10 3.1.1 Relationship to Entropy . 11 3.2 HuffmanCodes .................................... 13 3.2.1 CombiningMessages............................. 15 3.2.2 Minimum Variance Huffman Codes . 15 3.3 ArithmeticCoding ................................. 16 3.3.1 Integer Implementation . 19 4 Applications of Probability Coding 22 4.1 Run-lengthCoding .................................. 25 4.2 Move-To-FrontCoding .............................. 26 4.3 ResidualCoding:JPEG-LS. 27 4.4 ContextCoding:JBIG ................................ 28 4.5 ContextCoding:PPM................................. 29 ∗This is an early draft of a chapter of a book I’m starting to write on “algorithms in the real world”. There are surely many mistakes, and please feel free to point them out. In general the Lossless compression part is more polished than the lossy compression part. Some of the text and figures in the Lossy Compression sections are from scribe notes taken by Ben Liblit at UC Berkeley. Thanks for many comments from students that helped improve the presentation. c 2000, 2001 Guy Blelloch 1 5 The Lempel-Ziv Algorithms 32 5.1 Lempel-Ziv 77 (Sliding Windows) . ...... 32 5.2 Lempel-Ziv-Welch ................................ 34 6 Other Lossless Compression 37 6.1 BurrowsWheeler ................................... 37 7 Lossy Compression Techniques 40 7.1 ScalarQuantization .............................. 41 7.2 VectorQuantization.............................. 41 7.3 TransformCoding.................................. 43 8 A Case Study: JPEG and MPEG 44 8.1 JPEG ........................................
    [Show full text]