US20110106546A1 - Scalable lossless audio codec and authoring tool - Google Patents

Images

Classifications

• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/0017—Lossless audio signal coding; Perfect reconstruction of coded audio signal by transmission of coding error
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/008—Multichannel audio signal coding or decoding using interchannel correlation to reduce redundancy, e.g. joint-stereo, intensity-coding or matrixing
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
  • G10L19/08—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
  • G10L19/16—Vocoder architecture
  • G10L19/18—Vocoders using multiple modes
  • G10L19/24—Variable rate codecs, e.g. for generating different qualities using a scalable representation such as hierarchical encoding or layered encoding
• • H—ELECTRICITY
  • H03—ELECTRONIC CIRCUITRY
  • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
  • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
  • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
• • G—PHYSICS
  • G10—MUSICAL INSTRUMENTS; ACOUSTICS
  • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
  • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
  • G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
  • G10L19/16—Vocoder architecture
  • G10L19/167—Audio streaming, i.e. formatting and decoding of an encoded audio signal representation into a data stream for transmission or storage purposes

Definitions

• This invention relates to lossless audio codecs and more specifically to a scalable lossless audio codec and authoring tool.
• Dolby AC3 Dolby digital audio coding system is a world-wide standard for encoding stereo and 5.1 channel audio sound tracks for Laser Disc, NTSC coded DVD video, and ATV, using bit rates up to 640 kbit/s.
• MPEG I and MPEG II audio coding standards are widely used for stereo and multi-channel sound track encoding for PAL encoded DVD video, terrestrial digital radio broadcasting in Europe and Satellite broadcasting in the US, at bit rates up to 768 kbit/s.
• DTS Digital Theater Systems
• Coherent Acoustics audio coding system is frequently used for studio quality 5.1 channel audio sound tracks for Compact Disc, DVD video, Satellite Broadcast in Europe and Laser Disc and bit rates up to 1536 kbit/s.
• Lossless codecs rely on algorithms which compress data without discarding any information. As such, they do not employ psychoacoustic effects such as “masking”. A lossless codec produces a decoded signal which is identical to the (digitized) source signal. This performance comes at a cost: such codecs typically require more bandwidth than lossy codecs, and compress the data to a lesser degree.
• the lack of compression can cause a problem when content is being authored to a disk, CD, DVD, etc., particularly in cases of highly un-correlated source material or very large source bandwidth requirements.
• the optical properties of the media establish a peak bit rate for all content that can not be exceeded.
• a hard threshold 10 e.g., 9.6 Mbps for DVD audio, is typically established for audio so that the total bit rate does not exceed the media limit.
• the audio and other data is laid out on the disk to satisfy the various media constraints and to ensure that all the data that is required to decode a given frame will be present in the audio decoder buffer.
• the buffer has the effect of smoothing the frame-to-frame encoded payload (bit rate) 12 , which can fluctuate wildly from frame-to-frame, to create a buffered payload 14 , i.e. the buffered average of the frame-to-frame encoded payload. If the buffered payload 14 of the lossless bitstream for a given channel exceeds the threshold at any point the audio input files are altered to reduce their information content.
• the audio files may be altered by reducing the bit-depth of one or more channels such as from 24-bit to 22-bit, filtering a channel's frequency bandwidth to low-pass only, or reducing the audio bandwidth such as by filtering information above 40 kHz when sampling at 96 kHz.
• the altered audio input files are re-encoded so that the payload 16 never exceeds the threshold 10 .
• An example of this process is described in the SurCode MLP—Owner's Manual pp. 20-23.
• the present invention provides an audio codec that generates a lossless bitstream and an authoring tool that selectively discards bits to satisfy media, channel, decoder buffer or playback device bit rate constraints without having to filter the audio input files, reencode or to otherwise disrupt the lossless bitstream.
• the audio encoder separates the audio data into most significant bit (MSB) and least significant bit (LSB) portions and encodes each with a different lossless algorithm.
• MSB most significant bit
• LSB least significant bit
• An authoring tool writes the MSB portions to a bitstream, writes the LSB portions in the conforming windows to the bitstream, and scales the lossless LSB portions of any non-conforming frames to make them conform and writes the now lossy LSB portions to the bitstream.
• the audio decoder decodes the MSS and LSB portions and reassembles the PCM audio data.
• the audio encoder splits each audio sample into the MSB and LSB portions, encodes the MSB portion with a first lossless algorithm, encodes the LSB portion with a second lossless algorithm, and packs the encoded audio data into a scalable, lossless bitstream.
• the boundary point between the MSB and LSB portions is suitably established by the energy and/or maximum amplitude of samples in an analysis window.
• the LSB bit widths are packed into the bitstream.
• the LSB portion is preferably encoded so that some or all of the LSBs may be selectively discarded. Frequency extensions may be similarly encoded with MSB/LSB or entirely encoded as LSBs.
• An authoring tool is used to lay out the encoded data on a disk (media).
• the initial layout corresponds to the buffered payload.
• the tool compares the buffered payload to the allowed payload for each analysis window to determine whether the layout requires any modification. If not, all of the lossless MSB and LSB portions of the lossless bitstream are written to a bitstream and recorded on the disk. If yes, the authoring tool scales the lossless bitstream to satisfy the constraints.
• the tool writes the lossless MSB and LSB portion for all of the conforming windows and the headers and lossless MSB portions for the non-conforming to a modified bitstream.
• the authoring tool determines how many of the LSBs to discard from each audio sample in the analysis window for one ore more audio channels and repacks the LSB portions into the modified bitstream with their modified bit widths. This is repeated for only those analysis windows in which the buffered payload exceeds the allowed payload.
• a decoder receives the authored bitstream via the media or transmission channel.
• the audio data is directed to a buffer, which does not overflow on account of the authoring, and in turn provides sufficient data to a DSP chip to decode the audio data for the current analysis window.
• the DSP chip extracts the header information and extracts, decodes and assembles the MSB portions of the audio data. If all of the LSBs were discarded during authoring, the DSP chip translates the MSB samples to the original bit width word and outputs the PCM data. Otherwise, the DSP chip decodes the LSB portions, assembles the MSB & LSB samples, translates the assembled samples to the original bit width word and outputs the PCM data.
• FIG. 1 is a plot of bit rate and payload for a lossless audio channel versus time
• FIG. 2 is a block diagram of a lossless audio codec and authoring tool in accordance with the present invention
• FIG. 3 is a simplified flowchart of the audio coder
• FIG. 4 is a diagram of an MSB/LSB split for a sample in the lossless bitstream
• FIG. 5 is a simplified flowchart of the authoring tool
• FIG. 6 is a diagram of an MSB/LSB split for a sample in the authored bitstreams
• FIG. 7 is a diagram of a bitstream including the MSB and LSB portions and header information
• FIG. 8 is a plot of payload for the lossless and authored bitstreams
• FIG. 9 is a simple block diagram of an audio decoder
• FIG. 10 is a flowchart of the decoding process
• FIG. 11 is a diagram of an assembled bitstream
• FIGS. 12-15 illustrate the bitstream format, encoding, authoring, and decoding for a particular embodiment
• FIGS. 16 a and 16 b are block diagrams of the encoder and decoder for a scalable lossless codec that is backwards compatible with a lossy core encoder.
• the present invention provides a lossless audio codec and authoring tool for selectively discarding bits to satisfy media, channel, decoder buffer or playback device bit rate constraints without having to filter the audio input files, reencode or to otherwise disrupt the lossless bitstream.
• an audio encoder 20 losslessly encodes the audio data in a sequence of analysis windows and packs the encoded data and header information into a scalable, lossless bitstream 22 , which is suitably stored in an archive 24 .
• the analysis windows are typically frames of encoded data but as used herein the windows could span a plurality of frames.
• the analysis window may be refined into one or more segments of data inside a frame, one or more channel sets inside a segment, one or more channels in each channel set and finally one or more frequency extensions inside a channel.
• the scaling decisions for the bitstream can be very coarse (multiple frames) or more refined (per frequency extension per channel set per frame).
• An authoring tool 30 is used to lay out the encoded data on a disk (media) in accordance with the decoder's buffer capacity.
• the initial layout corresponds to the buffered payload.
• the tool compares the buffered payload to the allowed payload for each analysis window to determine whether the layout requires any modification.
• the allowed payload is typically a function of the peak bit rate supported by a media (DVD disk) or transmission channel.
• the allowed payload may be fixed or allowed to vary if part of a global optimization.
• the authoring tool selectively scales the losslessly encoded audio data in the non-conforming windows to reduce the encoded payload, hence the buffered payload.
• the scaling process introduces some loss into the encoded data but is confined to only the non-conforming windows and is suitably just enough to bring each window into conformance.
• the authoring tool packs the lossless and lossy data and any modified header information into a bitstream 32 .
• the bitstream 32 is typically stored on a media 34 or transmitted over a transmission channel 36 for subsequent playback via an audio decoder 38 , which generates a single or multi-channel PCM (pulse code modulated) audio stream 40 .
• PCM pulse code modulated
• the audio encoder 20 splits each audio sample into a MSB portion 42 and a LSB portion 44 (step 46 ).
• the boundary point that separates the audio data is computed by first assigning a minimum MSB bit width (Min MSB) 50 that establishes a minimum coding level for each audio sample. For example, if the bit width 52 of the audio data is 20-bit the Min MSB might be 16-bit. It follows that the maximum LSB bit width (Max LSB) 54 is the Bit Width 52 minus the Min MSB 50 .
• the encoder computes a cost function, e.g. the L 2 or L ⁇ norms, for the audio data in the analysis window.
• the encoder calculates an LSB bit width 56 of at least one bit and no more than Max LSB. If the cost function does not exceed the threshold, the LSB bit width 56 is set to zero bits.
• the MSB/LSB split is done for each analysis window. As describe above, this is typically one or more frames. The split can be further refined for each data segment, channel set, channel or frequency extension, for example. More refinement improves coding performance at the cost of additional computations and more overhead in the bitstream.
• the encoder losslessly encodes the MSB portions (step 58 ) and LSB portions (step 60 ) with different lossless algorithms.
• the audio data in the MSB portions is typically highly correlated both temporally within any one channel and between channels. Therefore, the lossless algorithm suitably employs entropy coding, fixed prediction, adaptive prediction and joint channel decorrelation techniques to efficiently code the MSB portions.
• a suitable lossless encoder is described in U.S. Pat. No. 7,392,195 titled “Lossless Multi-Channel Audio Codec” which is hereby incorporated by reference.
• lossless encoders include MLP (DVD Audio), Monkey's audio (computer applications), Apple lossless, Windows Media Pro lossless, AudioPak, DVD, LTAC, MUSICcompress, OggSquish, Philips, Shorten, Sonarc and WA.
• MLP DVD Audio
• Monkey's audio computer applications
• Apple lossless Windows Media Pro lossless
• AudioPak DVD
• LTAC LTAC
• MUSICcompress OggSquish
• Philips Shorten, Sonarc and WA.
• the audio data in the LSB portion is highly uncorrelated, closer to noise. Therefore sophisticated compression techniques are largely ineffective and consume processing resources. Furthermore, to efficiently author the bitstream, a very simple lossless code using simplistic prediction of very low order followed by a simple entropy coder is highly desirable. In fact, the currently preferred algorithm is to encode the LSB portion by simply replicating the LSB bits as is. This will allow individual LSBs to be discarded without having to decode the LSB portion.
• the encoder separately packs the encoded MSB and LSB portions into a scalable, lossless bitstream 62 so that they can be readily unpacked and decoded (step 64 ).
• the encoder packs the LSB bit width 56 into the header (step 66 ).
• the header also includes space for an LSB bit width reduction 68 , which is not used during encode. This process is repeated for each analysis window (frames, frame, segment, channel set or frequency extension) for which the split is recalculated.
• the authoring tool 30 allows a user to make a first pass at laying out the audio and video bitstreams on the media in accordance with the decoder's buffer capacity (step 70 ) to satisfy the media's peak bit rate constraint.
• the authoring tool starts the analysis window loop (step 71 ), calculates an buffered payload (step 72 ) and compares the buffered payload to the allowed payload for the analysis window 73 to determine whether the lossless bitstream requires any scaling to satisfy the constraints (step 74 ).
• the allowed payload is determined by buffer capacity of the audio decoder and the peak bit rate of the media or channel.
• the encoded payload is determined by the bit width of the audio data and the number of samples in all of the data segments 75 plus the header 76 . If the allowed payload is not exceeded, the losslessly encoded MSB and LSB portions are packed into respective MSB and LSB areas 77 and 78 of the data segments 75 in a modified bitstream 79 (step 80 ). If the allowed payload is never exceeded, the lossless bitstream is transferred directly to the media or channel.
• the authoring tool packs the headers and losslessly encoded MSB portions 42 into the modified bitstream 79 (step 81 ). Based on a prioritization rule, the authoring tool calculates an LSB bit width reduction 68 that will reduce the encoded payload, hence buffered payload to at most the allowed payload (step 82 ). Assuming the LSB portions were simply replicated during lossless encoding, the authoring tool scales the LSB portions (step 84 ) by preferably adding dither to each LSB portion so as to dither the next LSB bit past the LSB bit width reduction, and then shifting the LSB portion to the right by the LSB bit width reduction to discard bits.
• the tool packs the now lossy encoded LSB portions for the now conforming windows into the bitstream with the modified LSB bit widths 56 and the LSB bit width reduction 68 and a dither parameter (step 86 ).
• the LSB portion 44 has been scaled from a bit width of 3 to a modified LSB bit width 56 of 1-bit.
• the two discarded LSBs 88 match the LSB bit width reduction 68 of 2 bits.
• the modified LSB bit width 56 and LSB bit width reduction 68 are transmitted in the header to the decoder. Alternately, either of these could be omitted and the original LSB bit width transmitted. Any one of the parameters is uniquely determined by the other two.
• the benefits of the scalable, lossless encoder and authoring tool are best illustrated by overlaying the buffered payload 90 for the authored bitstream on FIG. 1 as is done in FIG. 8 .
• the buffered payload 14 was effectively shifted downward to a buffered payload 16 that is less than the allowed payload 10 .
• the buffered payload 90 replicates the original losslessly buffered payload 14 except in those few windows (frames) where the buffered payload exceeds the allowed payload.
• the encoded payload hence buffered payload is reduced just enough to satisfy the constraint and preferably no more.
• the payload capacity is utilized more efficiently and more content is delivered to the end user without having to alter the original audio files or reencode.
• the audio decoder 38 receives an authored bitstream via a disk 100 .
• the bitstream is separated into a sequence of analysis windows, each including header information and encoded audio data.
• Most of the windows include losslessly encoded MSB and LSB portions, the original LSB bit widths and LSB bit width reductions of zero.
• some of the windows include the losslessly encoded MSB portions and lossy LSB portions, the modified bit widths of the lossy LSB portions, and the LSB bit width reductions.
• a controller 104 reads the encoded audio data from the bitstream on the disk 100 .
• a parser 106 separates the audio data from the video and streams the audio data to the audio buffer 102 , which does not overflow on account of the authoring.
• the buffer in turn provides sufficient data to a DSP chip 108 to decode the audio data for the current analysis window.
• the DSP chip extracts the header information (step 110 ) including the modified LSB bit widths 56 , LSB bit width reduction 68 , a number of empty LSBs 112 from an original word width and extracts, decodes and assembles the MSB portions of the audio data (step 114 ).
• the DSP chip translates the MSB samples to the original bit width word and outputs the PCM data (step 116 ). Otherwise, the DSP chip decodes the lossless and lossy LSB portions (step 118 ), assembles the MSB & LSB samples (step 120 ), and, using the header information, translates the assembled samples to the original bit width word (step 122 ).
• each frame 200 comprises a header 202 for storing common information 204 and sub-headers 206 for each channel set that store the LSB bit widths and LSB bit width reductions, and one or more data segments 208 .
• Each data segment comprises one or more channel sets 210 with each channel set comprising one or more audio channels 212 .
• Each channel comprises one or more frequency extensions 214 with at least the lowest frequency extension including encoded MSB and LSB portions 216 , 218 .
• the bitstream has a distinct MSB and LSB split for each channel in each channel set in each frame. The higher frequency extensions may be similarly split or entirely encoded as LSB portions.
• the scalable lossless bitstream from which this bitstream is authored is encoded as illustrated in FIGS. 13 a and 13 b .
• the encoder sets the bit width of the original word (24-bit), the Min MSB (16-bit), a threshold (Th) for the squared L2 norm and a scale factor (SF) for that norm (step 220 ).
• the bit width of the data is the original bit width (24) minus the number of empty LSBs (4) (step 228 ).
• the encoder starts the channel loop index (step 232 ) and calculates the L ⁇ norm as the maximum absolute amplitude of the audio data in the channel and the squared L2 norm as the sum of the squared amplitudes of the audio data in the analysis window (step 234 ).
• the encoder sets a parameter Max Amp as the minimum integer greater than or equal to log 2 (L ⁇ ) (step 236 ) and initializes the LSB bit width to zero (step 237 ). If the Max Amp is greater than the Min MSB (step 238 ), the LSB bit width is set equal to the difference of the Max Amp and Min MSB (step 240 ).
• the LSB bit width is set equal to the Max Amp divided by the Scale Factor, typically >1 (step 244 ). If both tests are false, the LSB bit width remains zero. In other words, to maintain the minimum encode quality, e.g. Min MSB, no LSBs are available.
• the encoder clips the LSB bit width at the Max LSB value (step 246 ) and packs the value into the sub-header channel set (step 248 ).
• the encoder splits the audio data into the MSB and LSB portions (step 250 ).
• the MSB portion is losslessly encoded using a suitable algorithm (step 252 ) and packed into the lowest frequency extension in the particular channel in the channel set of the current frame (step 254 ).
• the LSB portion is losslessly encoded using a suitable algorithm, e.g. simple bit replication (step 256 ) and packed (step 258 ).
• This process is repeated for each channel (step 260 ) for each channel set (step 262 ) for each frame (step 264 ) in the bitstream. Furthermore, the same procedure may be repeated for higher frequency extensions. However, because these extensions contain much less information, the Min MSB may be set to 0 so that it is all encoded as LSBs.
• an authoring tool creates the best bitstream it can that satisfies the peak bit rate constraints of the transport media and the capacity of the buffer in the audio decoder.
• a user attempts to layout the lossless bitstream 268 on the media to conform to the bit rate and buffer capacity constrains (step 270 ). If successful, the lossless bitstream 268 is written out as the authored bitstream 272 and stored on the media. Otherwise the authoring tool starts the frame loop (step 274 ) and compares the buffered payload (buffered average frame-to-frame payload) to the allowed payload (peak bit rate) (step 276 ). If the current frame conforms to the allowed payload, the losslessly encoded MSB and LSB portions are extracted from the lossless bitstream 268 and written to the authored bitstream 272 and the frame is incremented.
• the tool computes the maximum reduction that can be achieved by discarding all of the LSB portions in the channel set and subtracts it from the buffered payload (step 278 ). If the minimum payload is still too big the tool displays an error message that includes the amount of excess date and frame number (step 280 ). In this case either the Min MSB shall be reduced or the original audio files shall be altered and re-encoded.
• the authoring tool calculates an LSB bit width reduction for each channel in the current frame based on a specified channel prioritization rule (step 282 ) such that:
• the authoring tool adjusts the encoded LSB portions (assuming bit replication encoding) for each channel by adding dither to each LSB portion in the frame to dither the next bit and then right shifting by the LSB bit width reduction (step 284 ). Adding dither is not necessary but is highly desirable in order to decorrelate the quantization errors and also make them decorrelated from the original audio signal.
• the tool packs the now lossy scaled LSB portions (step 286 ), the modified LSB bit widths and LSB bit width reductions for each channel (step 288 ) and the modified stream navigation points (step 290 ) into the authored bitstream. If dither is added, a dither parameter is packed into the bitstream. This process is then repeated for each frame (step 292 ) before terminating (step 294 ).
• a suitable decoder synchronizes to the bitstream (step 300 ) and starts a frame loop (step 302 ).
• the decoder extracts the frame header information including the number of segments, number of samples in a segment, number of channel sets, etc (step 304 ) and extracts the channel set header information including the number channels in the set, number of empty LSBs, LSB bit width, LSB bit width reduction for each channel set (step 306 ) and stores it for each channel set (step 307 ).
• the decoder starts the segment loop (step 308 ) and channel set loop (step 310 ) for the current frame.
• the decoder unpacks and decodes the MSB portions (step 312 ) and stores the PCM samples (step 314 ).
• the decoder then starts the channel loop in the current channel set (step 316 ) and proceeds with the encoded LSB data.
• the decoder starts the sample loop in the current segment (step 320 ), translates the PCM samples for the MSB portion to the original word width (step 322 ) and repeats until the sample loop terminates (step 324 ).
• the decoder starts the sample loop in the current segment (step 326 ), unpacks and decodes the LSB portions (step 328 ) and assembles PCM samples by appending the LSB portion to the MSB portion (step 330 ).
• the decoder then translates the PCM sample to the original word width using the empty LSB, modified LSB bit width and LSB bit width reduction information from the header (step 332 ) and repeats the steps until the sample loop terminates (step 334 ).
• the decoder repeats these steps for each channel (step 336 ) in each channel set (step 338 ) in each frame (step 340 ).
• the scalability properties can be incorporated into a backward compatible lossless encoder, bitstream format and decoder.
• a “lossy” core code stream is packed in concert with the losslessly encoded MSB and LSB portions of the audio data for transmission (or recording).
• the lossy and lossless MSB streams are combined and the LSB stream is appended to construct a lossless reconstructed signal.
• the lossless MSB and LSB extension streams are ignored, and the core “lossy” stream is decoded to provide a high-quality, multichannel audio signal with the bandwidth and signal-to-noise ratio characteristic of the core stream.
• FIG. 16 a shows a system level view of a scalable backward compatible encoder 400 .
• a digitized audio signal suitably M-bit PCM audio samples, is provided at input 402 .
• the digitized audio signal has a sampling rate and bandwidth which exceeds that of a modified, lossy core encoder 404 .
• the sampling rate of the digitized audio signal is 96 kHz (corresponding to a bandwidth of 48 kHz for the sampled audio).
• the input audio may be, and preferably is, a multichannel signal wherein each channel is sampled at 96 kHz.
• the input signal is duplicated at node 406 and handled in parallel branches.
• a modified lossy, wideband encoder 404 encodes the signal.
• the modified core encoder 404 which is described in detail below, produces an encoded data stream (corestream 408 ) which is conveyed to a packer or multiplexer 410 .
• the corestream 408 is also communicated to a modified corestream decoder 412 , which produces as output a modified, reconstructed core signal 414 , which is right shifted by N bits (>>N 415 ) to discard its N 1sbs.
• the input digitized audio signal 402 in the parallel path undergoes a compensating delay 416 , substantially equal to the delay introduced into the reconstructed audio stream (by modified encode and modified decoders), to produce a delayed digitized audio stream.
• the audio stream is split into MSB and LSB portions 417 as described above.
• the N-bit LSB portion 418 is conveyed to the packer 410 .
• the M-N bit reconstructed core signal 414 which was shifted to align with the MSB portion, is subtracted from the MSB portion of the delayed digitized audio stream 419 at subtracting node 420 .
• a summing node could be substituted for a subtracting node, by changing the polarity of one of the inputs. Thus, summing and subtracting may be substantially equivalent for this purpose).
• Subtracting node 420 produces a difference signal 422 which represents the difference between the M-N MSBs of the original signal and the reconstructed core signal.
• the M-N bit difference signal 422 is encoded with a lossless encoder 424 , and the encoded M-N bit signal 426 packed or multiplexed with the core stream 408 in packer 410 to produce a multiplexed output bitstream 428 .
• the lossless coding produced coded lossless streams 418 and 426 which are at a variable bit rate, to accommodate the needs of the lossless coder.
• the packed stream is then optionally subjected to further layers of coding including channel coding, and then transmitted or recorded. Note that for purposes of this disclosure, recording may be considered as transmission through a channel.
• the core encoder 404 is described as “modified” because in an embodiment capable of handling extended bandwidth the core encoder would require modification.
• a 64-band analysis filter bank within the encoder discards half of its output data and encodes only the lower 32 frequency bands. This discarded information is of no concern to legacy decoders that would be unable to reconstruct the upper half of the signal spectrum in any case.
• the remaining information is encoded as per the unmodified encoder to form a backwards-compatible core output stream.
• the core encoder could be a substantially unmodified version of a prior core encoder.
• the core decoder 412 would need to be modified as described below.
• the core decoder could be a substantially unmodified version of a prior core decoder or equivalent.
• the choice of sampling rate could be made at the time of encoding, and the encode and decode modules reconfigured at that time by software as desired.
• the method of decoding is complementary to the method of encoding.
• a prior generation decoder can decode the lossy core audio signal by simply decoding the corestream 408 and discarding the lossless MSB and LSB portions. The quality of audio produced in such a prior generation decoder will be extremely good, equivalent to prior generation audio, just not lossless.
• the incoming bitstream (recovered from either a transmission channel or a recording medium) is first unpacked in unpacker 430 , which separates the corestream 408 from lossless extension data streams 418 (LSB) and 426 (MSB).
• the core stream is decoded by a modified core decoder 432 , which reconstructs the core stream by zeroing out the un-transmitted sub-band samples for the upper 32 bands in a 64-band synthesis during reconstruction. (Note, if a standard core encode was performed, the zeroing out is unnecessary).
• the MSB extension field is decoded by a lossless MSB decoder 434 . Because the LSB data was losslessly encoded using bit replication no decoding is necessary.
• the bitstream can be scaled by selectively discarding LSBs to make it conform to media bit rate constraints and buffer capacity.

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• Health & Medical Sciences (AREA)
• Signal Processing (AREA)
• Audiology, Speech & Language Pathology (AREA)
• Human Computer Interaction (AREA)
• Computational Linguistics (AREA)
• Acoustics & Sound (AREA)
• Multimedia (AREA)
• Quality & Reliability (AREA)
• Mathematical Physics (AREA)
• Theoretical Computer Science (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)
• Signal Processing For Digital Recording And Reproducing (AREA)
• Transmission Systems Not Characterized By The Medium Used For Transmission (AREA)

Abstract

Description

Claims (35)

Priority Applications (1)

Applications Claiming Priority (5)

Related Parent Applications (1)

Publications (1)

Family

ID=38072128

Family Applications (5)

Family Applications Before (4)

Country Status (7)

Cited By (7)

Families Citing this family (121)

Citations (10)

Family Cites Families (35)

• 2004
  • 2004-08-04 US US10/911,067 patent/US7392195B2/en active Active
  • 2004-08-04 US US10/911,062 patent/US7272567B2/en active Active
• 2005
  • 2005-03-21 ES ES10167970.2T patent/ES2537820T3/en not_active Expired - Lifetime
  • 2005-03-21 JP JP2007505046A patent/JP4934020B2/en not_active Expired - Lifetime
  • 2005-03-21 ES ES05728310T patent/ES2363932T3/en not_active Expired - Lifetime
  • 2005-03-21 KR KR1020127024711A patent/KR101307693B1/en not_active Expired - Lifetime
  • 2005-03-21 CN CN2005800134433A patent/CN1961351B/en not_active Expired - Lifetime
  • 2005-03-21 CN CN2005800134448A patent/CN101027717B/en not_active Expired - Lifetime
  • 2005-03-21 RU RU2006137566/09A patent/RU2387022C2/en active
  • 2005-03-21 ES ES05731220T patent/ES2363346T3/en not_active Expired - Lifetime
  • 2005-03-21 RU RU2006137573/09A patent/RU2387023C2/en active
• 2007
  • 2007-06-21 HK HK07106643.1A patent/HK1099597A1/en not_active IP Right Cessation
  • 2007-08-14 US US11/891,905 patent/US7668723B2/en not_active Expired - Lifetime
  • 2007-10-04 HK HK07110721.8A patent/HK1105475A1/en not_active IP Right Cessation
• 2009
  • 2009-11-05 US US12/613,316 patent/US20100082352A1/en not_active Abandoned
• 2010
  • 2010-03-09 US US12/720,416 patent/US20110106546A1/en not_active Abandoned
• 2011
  • 2011-12-27 JP JP2011284818A patent/JP5551677B2/en not_active Expired - Lifetime
• 2013
  • 2013-05-10 JP JP2013100133A patent/JP5593419B2/en not_active Expired - Lifetime
  • 2013-05-10 JP JP2013100134A patent/JP5599913B2/en not_active Expired - Lifetime

Patent Citations (11)

Also Published As

Similar Documents

Legal Events