Direct Processing of Mpeg Audio Using Companding and Bfp Techniques

Total Page:16

File Type:pdf, Size:1020Kb

Direct Processing of Mpeg Audio Using Companding and Bfp Techniques DIRECT PROCESSING OF MPEG AUDIO USING COMPANDING AND BFP TECHNIQUES Christos Vezyrtzis, Aaron (Ari) Klein, Dan Ellis and Yannis Tsividis Department of Electrical Engineering, Columbia University, New York Subband 1 samples and Subband 1 ABSTRACT scale-factors reconstruction filter u ј32 We present techniques for processing MPEG-audio encoded signals during the decoding process, using efficient fixed-point arithmetic Subband 2 reconstruction filter operations. A large signal-to-quantization-noise-ratio is achieved over a large range of input levels. By taking advantage of MPEG- u ј32 Direct audio built-in properties, quantization distortion at the outputs of our Subband 2 Input Processing samples and output MPEG Using systems is kept largely inaudible, even though only low-resolution scale-factors stream Companding . fixed-point operations are used in the processing. Or BFP . Index Terms— MPEG, DSP, companding . Subband 32 samples and Subband 32 scale-factors reconstruction filter 1. INTRODUCTION u ј32 The MPEG-1 audio coding standard is one of the most popular and widely used standards for efficient and perceptually lossless audio compression coding, since it achieves both high perceived audio fi- Fig. 1. Direct processing of MPEG-audio. Subband samples and delity and high compression rates. An excellent MPEG tutorial can corresponding scale factors are efficiently processed before denor- be found in [1]. MPEG-audio uses a digital filterbank to create 32 malization by using syllabic companding or block-floating-point narrowband filtered versions of a digital input signal, referred to as processors. “subbands,” each of which is downsampled by a factor of 32. The presence of a large signal in a particular subband makes noise in used, great savings in dynamic power can be realized by improving that subband perceptually inaudible; this phenomenon is known as the efficiency of the processing. “psychoacoustic masking”. In MPEG-1 layers I and II, scale factors, In this work, we process prior to denormalization by using the coded as a 6-bit index corresponding to one of 64 high-precision syllabic companding (compressing-expanding) DSP technique, in- predefined values, are used to compress the dynamic range of the troduced in [6], or the block-floating-point (BFP) technique of [7]; subband samples (normalization). The actual value of each subband these techniques process compressed input, along with correspond- sample is given by the normalized subband sample multiplied with ing input scale factors, and yield compressed output, along with the corresponding scale factor; this multiplication is referred to as corresponding output scale factors, provided that these scale factors “denormalization”. correspond to the the time-domain envelope of the subband samples. Processing of MPEG-audio encoded signals is conventionally The highest MPEG-audio layer for which this is the case is MPEG 1- performed by first fully decoding the input stream and then perform- Layer II (MP2), and this is the standard we used in this work. How- ing the desired processing. This method, which we refer to as “clas- ever, the techniques presented in this work can be similarly applied sical DSP,” completely ignores the features of MPEG-audio encod- to any standard in which audio is encoded in the form of normal- ing. The processor must process a signal with high dynamic range, ized time-domain subband samples and corresponding time-domain and with frequency content throughout the audio band. In [2, 3, 4, 5], scale factors; we chose MP2 since it is used for many applications, among others, the problem of how to directly process the subband including digital-video-broadcasting (DVB) and DVD players. samples is addressed, but the processing proposed therein is done The techniques presented in this work could also be used with after denormalization, so the processed subband signals, though nar- standards utilizing frequency-domain subband samples, such as the rowband, have high dynamic range. As a result, to avoid introducing popular MPEG 1- Layer III (MP3) standard, but with such standards, significant audible quantization distortion, these subband processors it would be necessary to first partially decode the input stream to ob- must be implemented in either very high resolution fixed-point or tain time-domain normalized subband samples and scale factors; for in floating point. For many applications, specifically those targeting the most part, such partial decoding is part of the standard decoding low-power, battery-operated devices, it will often be very desirable process, so it is not an overhead. to reduce the complexity of the computation required to implement The system-level block diagram for the technique we present in the processing; using only low-resolution fixed-point operations for this paper is shown in Fig. 1, where the MPEG-audio encoded signal the processing would be very desirable. This is the case regardless of is processed during decoding, before denormalization, taking advan- the implementation of the MPEG-1 decoder used, as this decoding tage of the compressed input and scale factors provided to us by the is necessary, and essentially a fixed, “sunk” cost, independent of the MPEG-audio standard. As in [3, 4], the processor shown in the fig- implementation of the processing. Even if a floating-point decoder is ure is composed of 32 “subband processors,” where each subband processor is a multiple-input, single-output system fed with subband This work was supported in part by NSF Grant CCF 07-01766. samples from all 32 subbands; the ith subband processor outputs the 978-1-4577-0539-7/11/$26.00 ©2011 IEEE 361 ICASSP 2011 exi (n) signals, referred to as “e-controls”, and normalized input, uˆ(n) yˆ(n) output and states uˆ(n), yˆ(n), and xˆi(n), such that: Subband e (n) Processor e (n) ( ) u y ˆ( )= u n u n eu(n) ˆ( )= y(n) y n ey (n) (2a) uˆ(n) yˆ(n) ˆ ( )= xi(n) 1≤ ≤ Companding xi n ( ) , i K exi n e (n) DSP u ey (n) By substituting (2a) in (1), we find that all subband processors are e (n) e (n) y identical and described by the state equations: x1 −0 8 ( ) 0 2 ( ) ˆ ( +1)= . exK n · ˆ ( )+ . eu n · ˆ( ) Envelope x1 n ( +1) xK n ( +1) u n generator ex1 n ex1 n xˆi(n +1)=ˆxi−1(n), 2 ≤ i ≤ K (2b) 1 8 ( ) 0 8 ( ) ˆ( )= . exK n · ˆ ( )+ . eu n · ˆ( ) Fig. 2. A companding subband processor. For this case study, the y n xK n u n ey(n) ey(n) processor block of Fig. 1 is composed of 32 identical copies of this th subband processor, with the i processor taking as input only the with K =64and exK (n)=ex1 (n − K +1). The e-controls th i stream of subband samples and corresponding scale factors. are constrained to be integer powers of 2, so that the ratios in (2) are efficiently implemented as subtractions of (integer) base-2 loga- subband samples corresponding to the ith subband. In contrast to rithms, and multiplying by the ratios is efficiently implemented with [2, 3, 4, 5], the processor shown in Fig. 1 can use few bits and sim- arithmetic bit-shift. Information about the input envelope for each ple low-bit fixed-point operations. Due to the compressed dynamic subband is provided in MPEG-audio in the form of a signal scale- ( ) range of the input, state, and output signals, the resulting output sig- factor. From this, the eu n control signal is generated via a lookup 14 8 nal to quantization noise ratio (SNR) is always sufficiently high that table (LUT). The LUT has a -bit input: the -bit normalized input 6 the output quantization noise is inaudible due to the psychoacous- sample, concatenated with its corresponding -bit scale-factor index. 4 2 tic masking properties exploited by the MPEG-audio reconstruction The LUT outputs a -bit integer corresponding to the base- loga- 2 filter bank. rithm of the lowest integer power of greater than the scale-factor, andanew8-bit compressed subband sample corresponding to this power-of-2 scale factor. The new 8-bit sample is used as uˆ(n) in (2), 2. DIRECT PROCESSING OF MPEG-ENCODED SIGNALS while the power-of-2 scale factor is used as eu(n) in (2). As shown in [6], the remaining e-controls should be chosen to correspond, at Due to lack of space, we present our techniques using a specific ex- least roughly, to the envelopes of the corresponding signals in the ample: an all-pass digital reverberator. A non-allpass filter could prototype, in order to maximize the dynamic range of the subband theoretically filter out some artifacts caused by our technique; by processor, and minimize the quantization distortion. Thus, as seen in using an allpass filter, we ensure that the absence of artifacts is a Fig. 2, we use an “Envelope generator” block to obtain the remain- property of our technique, rather than an “accident” related to the ing e-controls required by the companding DSP. In [6], a replica DSP type of filtering used. was used to calculate the remaining required e-controls. We could do this here as well, using 32 low-resolution fixed-point implementa- 2.1. Syllabic Companding Approach tions of the subband-prototype. However, implementing the replica DSPs adds significant overhead, so we have devised a more efficient We used the syllabic companding DSP technique, introduced in [6] technique for estimating the remaining e-controls. Our algorithm, and refined in [8], to implement a reverberator prototype, described shown in block diagram format in Fig. 3, takes advantage of the nar- in state-space by the following equations: rowband nature of the subbands, and is described in detail in the following.
Recommended publications
  • A Multidimensional Companding Scheme for Source Coding Witha Perceptually Relevant Distortion Measure
    A MULTIDIMENSIONAL COMPANDING SCHEME FOR SOURCE CODING WITHA PERCEPTUALLY RELEVANT DISTORTION MEASURE J. Crespo, P. Aguiar R. Heusdens Department of Electrical and Computer Engineering Department of Mediamatics Instituto Superior Técnico Technische Universiteit Delft Lisboa, Portugal Delft, The Netherlands ABSTRACT coding mechanisms based on quantization, where less percep- tually important information is quantized more roughly and In this paper, we develop a multidimensional companding vice-versa, and lossless coding of the symbols emitted by the scheme for the preceptual distortion measure by S. van de Par quantizer to reduce statistical redundancy. In the quantization [1]. The scheme is asymptotically optimal in the sense that process of the (en)coder, it is desirable to quantize the infor- it has a vanishing rate-loss with increasing vector dimension. mation extracted from the signal in a rate-distortion optimal The compressor operates in the frequency domain: in its sim- sense, i.e., in a way that minimizes the perceptual distortion plest form, it pointwise multiplies the Discrete Fourier Trans- experienced by the user subject to the constraint of a certain form (DFT) of the windowed input signal by the square-root available bitrate. of the inverse of the masking threshold, and then goes back into the time domain with the inverse DFT. The expander is Due to its mathematical tractability, the Mean Square based on numerical methods: we do one iteration in a fixed- Error (MSE) is the elected choice for the distortion measure point equation, and then we fine-tune the result using Broy- in many coding applications. In audio coding, however, the den’s method.
    [Show full text]
  • (A/V Codecs) REDCODE RAW (.R3D) ARRIRAW
    What is a Codec? Codec is a portmanteau of either "Compressor-Decompressor" or "Coder-Decoder," which describes a device or program capable of performing transformations on a data stream or signal. Codecs encode a stream or signal for transmission, storage or encryption and decode it for viewing or editing. Codecs are often used in videoconferencing and streaming media solutions. A video codec converts analog video signals from a video camera into digital signals for transmission. It then converts the digital signals back to analog for display. An audio codec converts analog audio signals from a microphone into digital signals for transmission. It then converts the digital signals back to analog for playing. The raw encoded form of audio and video data is often called essence, to distinguish it from the metadata information that together make up the information content of the stream and any "wrapper" data that is then added to aid access to or improve the robustness of the stream. Most codecs are lossy, in order to get a reasonably small file size. There are lossless codecs as well, but for most purposes the almost imperceptible increase in quality is not worth the considerable increase in data size. The main exception is if the data will undergo more processing in the future, in which case the repeated lossy encoding would damage the eventual quality too much. Many multimedia data streams need to contain both audio and video data, and often some form of metadata that permits synchronization of the audio and video. Each of these three streams may be handled by different programs, processes, or hardware; but for the multimedia data stream to be useful in stored or transmitted form, they must be encapsulated together in a container format.
    [Show full text]
  • MC14SM5567 PCM Codec-Filter
    Product Preview Freescale Semiconductor, Inc. MC14SM5567/D Rev. 0, 4/2002 MC14SM5567 PCM Codec-Filter The MC14SM5567 is a per channel PCM Codec-Filter, designed to operate in both synchronous and asynchronous applications. This device 20 performs the voice digitization and reconstruction as well as the band 1 limiting and smoothing required for (A-Law) PCM systems. DW SUFFIX This device has an input operational amplifier whose output is the input SOG PACKAGE CASE 751D to the encoder section. The encoder section immediately low-pass filters the analog signal with an RC filter to eliminate very-high-frequency noise from being modulated down to the pass band by the switched capacitor filter. From the active R-C filter, the analog signal is converted to a differential signal. From this point, all analog signal processing is done differentially. This allows processing of an analog signal that is twice the amplitude allowed by a single-ended design, which reduces the significance of noise to both the inverted and non-inverted signal paths. Another advantage of this differential design is that noise injected via the power supplies is a common mode signal that is cancelled when the inverted and non-inverted signals are recombined. This dramatically improves the power supply rejection ratio. After the differential converter, a differential switched capacitor filter band passes the analog signal from 200 Hz to 3400 Hz before the signal is digitized by the differential compressing A/D converter. The decoder accepts PCM data and expands it using a differential D/A converter. The output of the D/A is low-pass filtered at 3400 Hz and sinX/X compensated by a differential switched capacitor filter.
    [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]
  • Codec Is a Portmanteau of Either
    What is a Codec? Codec is a portmanteau of either "Compressor-Decompressor" or "Coder-Decoder," which describes a device or program capable of performing transformations on a data stream or signal. Codecs encode a stream or signal for transmission, storage or encryption and decode it for viewing or editing. Codecs are often used in videoconferencing and streaming media solutions. A video codec converts analog video signals from a video camera into digital signals for transmission. It then converts the digital signals back to analog for display. An audio codec converts analog audio signals from a microphone into digital signals for transmission. It then converts the digital signals back to analog for playing. The raw encoded form of audio and video data is often called essence, to distinguish it from the metadata information that together make up the information content of the stream and any "wrapper" data that is then added to aid access to or improve the robustness of the stream. Most codecs are lossy, in order to get a reasonably small file size. There are lossless codecs as well, but for most purposes the almost imperceptible increase in quality is not worth the considerable increase in data size. The main exception is if the data will undergo more processing in the future, in which case the repeated lossy encoding would damage the eventual quality too much. Many multimedia data streams need to contain both audio and video data, and often some form of metadata that permits synchronization of the audio and video. Each of these three streams may be handled by different programs, processes, or hardware; but for the multimedia data stream to be useful in stored or transmitted form, they must be encapsulated together in a container format.
    [Show full text]
  • TMS320C6000 Mu-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]
  • Efficient and Accuracy-Ensured Waveform Compression For
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 40, NO. 7, JULY 2021 1437 Efficient and Accuracy-Ensured Waveform Compression for Transient Circuit Simulation Lingjie Li and Wenjian Yu , Senior Member, IEEE Abstract—Efficient and accurate waveform compression is to large data storage for the waveforms. For accurate transient essentially important for the application of analog circuit tran- simulation, the number of time points ranges from several hun- sition simulation nowadays. In this article, an analog waveform dred thousands to even a billion, and voltage/current values compression scheme is proposed which includes two compressed formats for representing small and large signal values, respec- are stored as floating-point numbers. Therefore, the simulator tively. The compressed formats and the corresponding compres- may output a large hard-disk file occupying multiple GBs of sion/decompression approaches ensure that both the absolute and disk space. This further leads to considerable time for writ- relative errors of each signal value restored from the compres- ing the waveforms into a file and for loading the file into a sion are within specified criteria. The formats are integrated in viewer, and largely worsens the performance of circuit simu- a block-by-block compressing procedure which facilitates a sec- ondary lossless compression and a three-stage pipeline scheme lator and the customer experience of waveform viewer. Hence, for fast conversion from the simulator’s output to the com- it is greatly demanded to have an efficient waveform compres- pressed hard-disk file. Theoretical analysis is presented to prove sion approach which reduces the data storage of waveforms the accuracy-ensured property of our approach.
    [Show full text]
  • Video/Audio Compression
    5.9. Video Compression (1) Basics: video := time sequence of single images frequent point of view: video compression = image compression with a temporal component assumption: successive images of a video sequence are similar, e.g. directly adjacent images contain almost the same information that has to be carried only once wanted: strategies to exploit temporal redundancy and irrelevance! motion prediction/estimation, motion compensation, block matching intraframe and interframe coding video compression algorithms and standards are distinguished according to the peculiar conditions, e.g. videoconferencing, applications such as broadcast video Prof. Dr. Paul Müller, University of Kaiserslautern 1 Video Compression (2) Simple approach: M-JPEG compression of a time sequence of images based on the JPEG standard unfortunately, not standardized! makes use of the baseline system of JPEG, intraframe coding, color subsampling 4:1:1, 6 bit quantizer temporal redundancy is not used! applicable for compression ratios from 5:1 to 20:1, higher rates call for interframe coding possibility to synchronize audio data is not provided direct access to full images at every time position application in proprietary consumer video cutting software and hardware solutions Prof. Dr. Paul Müller, University of Kaiserslautern 2 Video Compression (3) Motion prediction and compensation: kinds of motion: • change of color values / change of position of picture elements • translation, rotation, scaling, deformation of objects • change of lights and shadows • translation, rotation, zoom of camera kinds of motion prediction techniques: • prediction of pixels or ranges of pixels neighbouring but no semantic relations • model based prediction grid model with model parameters describing the motion, e.g. head- shoulder-arrangements • object or region based prediction extraction of (video) objects, processing of geometric and texture information, e.g.
    [Show full text]
  • Quantization Error E[N] Exist: 1
    COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #3 Wednesday, September 10, 2003 1.4 Quantization Digital systems can only represent sample amplitudes with a finite set of prescribed values, and thus it is necessary for A/D converters to quantize the values of the samples x[n]. A typical form of quantization uses uniform quantization steps, where the input voltage is either rounded or truncated. (Porat) A 3-bit rounding uniform quantizer with quantization steps of ∆ is shown below. (Oppenheim and Schafer) Two forms of quantization error e[n] exist: 1. Quantization noise: due to rounding or truncation over the range of quantizer outputs; and 2. Saturation (“peak clipping”): due to the input exceeding the maximum or minimum quantizer output. Both types of error are illustrated for the case of a sinusoidal signal in the figure on the next slide. Quantization noise can be minimized by choosing a sufficiently small quantization step. We will derive a method for quantifying how small is “sufficient”. Saturation can be avoided by carefully matching the full- scale range of an A/D converter to anticipated input signal amplitude ranges. Saturation or “peak clipping” (Oppenheim and Schafer) For rounding uniform quantizers, the amplitude of the quantization noise is in the range −∆/2 <e[n] · ∆/2. For small ∆ it is reasonable to assume that e[n] is a random variable uniformly distributed over (−∆/2, ∆/2]. For fairly complicated signals, it is reasonable to assume that successive quantization noise values are uncorrelated and that e[n] is uncorrelated with x[n]. Thus, e[n] is assumed to be a uniformly distributed white- noise sequence with a mean of zero and variance: For a (B+1)-bit quantizer with full-scale Xm, the noise variance (or power) is: The signal-to-noise ratio (SNR) of a (B+1)-bit quantizer is: 2 where σx is the signal variance (or power).
    [Show full text]
  • Companding Flash Analog-To-Digital Converters
    University of Central Florida STARS Retrospective Theses and Dissertations 1986 Companding Flash Analog-To-Digital Converters Michael P. Brig University of Central Florida Part of the Engineering Commons Find similar works at: https://stars.library.ucf.edu/rtd University of Central Florida Libraries http://library.ucf.edu This Masters Thesis (Open Access) is brought to you for free and open access by STARS. It has been accepted for inclusion in Retrospective Theses and Dissertations by an authorized administrator of STARS. For more information, please contact [email protected]. STARS Citation Brig, Michael P., "Companding Flash Analog-To-Digital Converters" (1986). Retrospective Theses and Dissertations. 4953. https://stars.library.ucf.edu/rtd/4953 COMPANDING FLASH- ANALOG-TO-DIGITAL CONVERTERS BY MICHAEL PATRICK BRIG B.S.E., University of Central Florida, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Engineering in the Graduate Studies Program of the College of Engineering University of Central Florida Orlando, Florida Spring Term 1986 ABSTRACT This report will ~emonstrate how a companding flash analog-to­ digi tal converter can be used to satisfy both the dynamic rang~ and resolution requirements of an infrared imaging system. Iri the past, infrared imaging systems had to rely on analog electronics to process a thermal image. This was costly and, in many ways, in­ efficient but the only way to perform the function.. Digital process~ ing was impractical because ADC conversion speeds were slow with respect to video frequencies. Furthermore, it is impossible to gain the necessary dynamic range using linear conversion techniques without targe digital wordlengths.
    [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]
  • Inline Vector Compression for Computational Physics
    Inline Vector Compression for Computational Physics W. Trojak ∗ Department of Ocean Engineering, Texas A&M University, College Station F. D. Witherden Department of Ocean Engineering, Texas A&M University, College Station Abstract A novel inline data compression method is presented for single-precision vec- tors in three dimensions. The primary application of the method is for accel- erating computational physics calculations where the throughput is bound by memory bandwidth. The scheme employs spherical polar coordinates, angle quantisation, and a bespoke floating-point representation of the magnitude to achieve a fixed compression ratio of 1.5. The anisotropy of this method is considered, along with companding and fractional splitting techniques to improve the efficiency of the representation. We evaluate the scheme nu- merically within the context of high-order computational fluid dynamics. For both the isentropic convecting vortex and the Taylor{Green vortex test cases, the results are found to be comparable to those without compression. arXiv:2003.02633v2 [cs.CE] 24 Jun 2020 Performance is evaluated for a vector addition kernel on an NVIDIA Titan V GPU; it is demonstrated that a speedup of 1.5 can be achieved. Keywords: Vector Compression, GPU computing, Flux Reconstruction ∗Corresponding author Email addresses: [email protected] (W. Trojak ), [email protected] (F. D. Witherden ) Preprint submitted to Elsevier June 25, 2020 2010 MSC: 68U20, 68W40, 68P30, 65M60, 76F65 1. Introduction Over the past 30 years, improvements in computing capabilities, mea- sured in floating-point operations per second, have consistently outpaced improvements in memory bandwidth [1]. A consequence of this is that many numerical methods for partial differential equations are memory bandwidth bound algorithms.
    [Show full text]