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
  • 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/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/02—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 spectral analysis, e.g. transform vocoders or subband vocoders
• • 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/02—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 spectral analysis, e.g. transform vocoders or subband vocoders
  • G10L19/0212—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 spectral analysis, e.g. transform vocoders or subband vocoders using orthogonal transformation
• • 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/02—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 spectral analysis, e.g. transform vocoders or subband vocoders
  • G10L19/022—Blocking, i.e. grouping of samples in time; Choice of analysis windows; Overlap factoring
• • 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
• • 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
  • G10L19/12—Determination or coding of the excitation function; Determination or coding of the long-term prediction parameters the excitation function being a code excitation, e.g. in code excited linear prediction [CELP] vocoders
• • 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
• • G—PHYSICS
  • G11—INFORMATION STORAGE
  • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
  • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
  • G11B27/10—Indexing; Addressing; Timing or synchronising; Measuring tape travel
  • G11B27/102—Programmed access in sequence to addressed parts of tracks of operating record carriers
  • G11B27/105—Programmed access in sequence to addressed parts of tracks of operating record carriers of operating discs
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04S—STEREOPHONIC SYSTEMS 
  • H04S1/00—Two-channel systems
  • H04S1/007—Two-channel systems in which the audio signals are in digital form
• • 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/005—Correction of errors induced by the transmission channel, if related to the coding algorithm
• • 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/02—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 spectral analysis, e.g. transform vocoders or subband vocoders
  • G10L19/032—Quantisation or dequantisation of spectral components
• • 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/06—Determination or coding of the spectral characteristics, e.g. of the short-term prediction coefficients
• • 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
• • G—PHYSICS
  • G11—INFORMATION STORAGE
  • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
  • G11B20/00—Signal processing not specific to the method of recording or reproducing; Circuits therefor
  • G11B20/10—Digital recording or reproducing
  • G11B20/10527—Audio or video recording; Data buffering arrangements
  • G11B2020/10537—Audio or video recording
  • G11B2020/10546—Audio or video recording specifically adapted for audio data

Definitions

• the present invention relates to a method for processing audio
• MPEG MP3 or AAC
• DVD audio and Super CD Audio include proprietary
• Lossless audio coding permits the compression of digital audio data without any loss in quality- due to a perfect reconstruction of the original signal.
• the present invention relates to processing an audio signal.
• first and second channels are
• At least two of the blocks have
• the subdivided blocks of the first and the first are identical in one embodiment.
• channels are correspondingly subdivided.
• the first and second channels are
• the subdivision hierarchy has more than one level, and each level is associated with a different block
• channel is subdivided into the plurality of blocks such that
• each block has a length of one of N/2, N/4, N/8, N/16 and N/32.
• information is generated such that a length
• the information depends on a number of levels in the subdivision hierarchy.
• the information may be
• the information includes a number of information bits, and the information bits indicate the
• each information bit may be associated with a level in the subdivision hierarchy and may be associated with a block at
• each information bit indicates
• the method further includes predicting
• the prediction is performed by
• this progressive prediction process may be any progressive prediction process.
• this progressive prediction process may be any progressive prediction process.
• lengths of blocks into which each of a plurality of channels in an audio data frame is divided are independently switched if the plurality of channels are not correlated with
• the channels are each
• the present invention further relates to methods and
• apparatuses for encoding an audio signal and to methods and apparatuses for decoding an audio signal.
• FIG. 1 is an example illustration of an encoder according to
• FIG. 2 is an example illustration of a decoder according to an
• FIG. 3 is an example illustration of a bitstream structure of
• FIG. 4 is an example illustration of a conceptual view of a
• FIG. 5 is an example illustration of a block switching
• FIG. 6 is an example illustration of block switching methods
• FIG. 1 is an example illustration of an encoder 1 according to
• a partitioning part 100 partitions the input audio data into
• each channel may be further
• a buffer 110 stores block and/or frame samples partitioned by
• a coefficient estimating part 120 estimates an optimum set of coefficient values for each block. The number of coefficients,
• the order of the predictor can be adaptively chosen as
• the coefficient estimating part 120 calculates a set of parcor values for the block of digital audio data.
• the parcor value indicates parcor representation of the predictor coefficient.
• a quantizing part 130 quantizes the set of
• a first entropy coding part 140 calculates parcor residual
• the entropy parameters are chosen from an optimal table .
• optimal table is selected from a plurality of tables based on
• the plurality of tables are predefined for a plurality of sampling
• a coefficient converting part 150 converts the quantized
• a predictor 160 estimates current prediction values from the
• the buffer 110 and a prediction value estimated in the predictor 160 .
• a second entropy coding part 180 codes the prediction residual
• the second entropy coding part 180 may code the
• BGMC Block Gilbert-Moore Codes
• arithmetic coding scheme offers even better compression at the expense of a slightly increased complexity compared to Rice codes .
• a multiplexing part 190 multiplexes coded prediction
• the encoder 1 also provides a cyclic redundancy check (CRC)
• checksum which is supplied mainly for the decoder to verify
• the decoded data On the encoder side, the CRC can be used to calculate the decoded data.
• the CRC On the encoder side, the CRC can be used to calculate the decoded data.
• the CRC On the encoder side, the CRC can be used to calculate the decoded data.
• Additional encoding options include flexible block switching
• the encoder 1 may use these options to offer several compression levels with
• the joint channel coding is used to exploit dependencies between channels of stereo or multi ⁇
• channel signals This can be achieved by coding the difference between two channels in the segments where this
• FIG. 2 is an example illustration of a decoder 2 according to the present invention. More specially, FIG. 2 shows the
• a demultiplexing part 200 receives an audio signal and
• part 210 decodes the parcor residual values using entropy
• a second entropy decoding part 220 decodes the demultiplexed coded prediction residual using
• a coefficient converting part 230 converts the entropy decoded parcor value into LPC coefficients.
• predictor 240 estimates a prediction residual of the block of
• An adder 250 is provided to convert digital audio data using the LPC coefficients.
• An assembling part 260 assembles the decoded
• the decoder 2 decodes the coded prediction residual
• FIG. 3 is an example illustration of a bitstream structure
• a compressed audio signal including a plurality of channels
• the bitstream consists of at least one audio frame including a
• the "channels" are a plurality of channels (e.g., M channels).
• the "channels" are a plurality of channels (e.g., M channels).
• Each channel is sub ⁇
• Each sub-divided block has a different size
• the coding data within a subdivided block includes coding data according to the encoding of FIG.l.
• partition is identical for both channels, and blocks are stored in an interleaved fashion.
• bitstream configuration syntax (Table 6) indicates whether joint stereo (channel difference) is on or off, and a "js_switch" field in the frame_data syntax (See Table 7 below)
• An aspect of the present invention relates to subdividing each
• the block partitioning (or
• block switching method referred to as a "block switching method” .
• FIG. 4 is an example illustration of a conceptual view of a
• FIG. 4 illustrates a method of
• each channel may be subdivided (or partitioned) to up to 32 blocks,
• channel of N samples is either encoded using one full length
• each channel of a frame may be
• FIG. 4 illustrates a channel which can be hierarchically subdivided to up to 32 blocks.
• N/32 may be possible within a channel according to the
• partition into N/4 + N/2 + N/4 may not be possible (e.g.,
• each block has a length equal to one of
• N is the length of the channel
• m is an integer greater
• bitstream includes information indicating block switching levels and information indicating block switching results .
• the information related to block switching is included in the syntax, which is used in the decoding process,
• level 0 block switching which is referred to as a level 0 block switching.
• the first block switching information For example, the first
• block switching information may be represented by a 2-bit
• block_switching 00" signifies level 0
• the second block switching information may be any type of second block switching information.
• the second block switching information may be any type of second block switching information.
• the second block switching information may be any type of second block switching information.
• V ⁇ bs_info represented by a V ⁇ bs_info field which is expressed by any one
• one channel configures one block.
• Table 1 Block switching levels.
• mapping each bit within the second block switching
• the bs_info field may include up to 4 bytes in accordance with
• the mapping of bits with respect to levels 1 to 5 may be [(0)1223333 44444444 55555555 55555555] .
• the first bit may be reserved for indicating
• FIGs. 5 (a) -5 (f) illustrate different block
• N B N/8, and the bs__info consists of one byte.
• bs__info are set if a block is further subdivided. For example,
• FIGs. 5(e) and 5 (f) represent cases of block switching that are not permitted because the N/2 block in FIG, 5 (e) and the first N/4 block in
• FIG. 5(f) could not have been obtained by subdividing a block
• FIGs. 6 (a) - 6 (c) are example illustrations of block switching
• FIG. 6 (a) illustrates an example where
• FIG. 6 (b) illustrates an example in which two channels
• channels 1 and 2 configure one channel pair, and block
• channel pair refers to two arbitrary audio channels .
• decision on which channels are grouped into channel pairs can be made automatically by the encoder or manually by the user.
• channel may be identical for all channels, the block switching
• the channels may be divided into blocks differently. If the two channels of a channel pair are correlated with each other and difference coding is used, both
• channels of a channel pair may be block switched synchronously.
• the channels are block switched synchronously.
• the channels are block switched synchronously. In synchronous block switching, the channels are block
• FIG. 1 is a diagrammatic representation of a single block switched (i.e., divided into blocks) in the same manner.
• block switching may be applied to a multi-channel group having
• a number of channels equal to or more than 3 channels.
• each channel of the multi-channel group may be switched
• the "bs_info" field is used as the information for indicating the block switching result.
• ⁇ bs__info field is also used as the information for indicating
• bit within the u bs_info" field may be used.
• FIGs. 6 (a) , 6 (b) , and 6 (c) will now be described in detail .
• channels 1 and 2 configure a channel
• both channels 1 and 2 are split into
• each channel pair which results in reducing the bit rate. Furthermore, if the channel pair is synchronous, each block
• within the channel pair may be required to be interleaved with one another.
• the interleaving may be beneficial (or
• a block of one channel (e.g.,
• channels 1 and 2 configure a channel
• Channel 2 is split into blocks of a
• channel data may be arranged separately.
• Joint channel coding also called joint stereo, can be used to
• the channels can be rearranged by
• the encoder in order to assign suitable channel pairs.
• lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also Besides simple difference coding, lossless audio codec also
• the present invention relates to audio lossless coding and is
• Random access stands for fast
• Random access frame is referred to as a "random access frame" .
• configuration syntax shown in Table 6
• information related with random access are transmitted as configuration information.
• a "random_access” field is used as information for indicating whether random access is allowed
• the 8 -bit "random_access" field designates the number of frames configuring a random access
• a 32-bit ⁇ ra_unit_size" field is included in the bitstream and
• configuration syntax (Table 6) may further include information
• configuration syntax (Table 6) may also be referred to as
• the "ra_flag" field may also be used to indicate the "ra_flag" field.
• an audio signal includes
• each random access unit containing one or more audio
• the configuration information includes first general
• the random access unit size is stored.
• method of decoding an audio signal includes receiving the audio signal having configuration information and a plurality
• each random access unit containing one or more audio data frames, one of which is a random access
• the first general information indicating a distance between two adjacent random access
• random access unit is stored, and the random access unit size information indicating a distance between two adjacent random access frames in bytes.
• an audio signal includes multi-channels
• each channel may be mapped at a one-to-one correspondence with
• the "chan_config_info” field includes information for mapping the channels to the loudspeaker
• channels field is equal to or more than "2" , this indicates
• present invention also includes information indicating whether
• Table 2 Channel configuration.
• an audio signal includes multiple or multi-channels according to the present invention. Therefore,
• a 32-bit "samples" field is used as information indicating the
• the user-defined value is arbitrarily determined upon the encoding process. Therefore, during the decoding process, when the bitstream is
• frlen__last frame__length
• samples field is an exact multiple of the number of samples
• the multiple value becomes the total number of frames.
• the encoder may freely decide and
• samples For each channel and the number of samples (frame_length” field)
• the decoder may
• the transmitted information the number of frames for each channel that is to be used for decoding.
• the predictor 160 shown in FIG. 1 The predictor 160 shown in FIG. 1
• the second entropy coding part 180 performs entropy
• predictor coefficient values for each block that are applied to the predictor 160 are selected as optimum
• predictor coefficient values are entropy coded by the first
• Linear prediction is used in many applications for speech and
• the current sample of a time-discrete signal x(n) can be
• K is the order of the predictor. If the predicted samples are close to the original samples, the predicted samples are close to the original samples, the predicted samples are close to the original samples, the predicted samples are close to the original samples, the predicted samples are close to the original samples.
• the backward adaptation procedure has
• Forward-adaptive prediction methods with orders around 10 are widely used in speech coding, and can be employed for lossless
• Another aspect of forward-adaptive prediction is to determine
• bit rate R e for the residual.
• bit rate R e for the residual.
• the task is to find the optimum order which minimizes the total bit rate. This can be
• the search for the optimum order can be carried out efficiently by the coefficient estimating part 120, which
• the total bit rate can be
• the prediction order K is also determined by the coefficient estimating part 120.
• bitstream the bitstream and then transmitted.
• the configuration syntax (Table 6) includes information
• 10-bit ⁇ max_order" field corresponds to information indicating
• the optimum order (opt_order) is decided based upon the value of max_order field and the size (N B ) of the corresponding
• each block may be decided considering the size of the
• the opt_order value being
• short block length e.g. 4096 & 1024 or 8192 & 2048
• this factor can be increased (e.g., up to 32), enabling a
• K ms ⁇ 1023.
• K mm may be bound
• Table 8 can also be up to 10 bits. The actual number of bits in a particular block may depend on the maximum order
• a local prediction order may be smaller than a global prediction order.
• the local prediction order is determined from
• prediction order is determined from the "max_order" K max in the
• the ⁇ opt_order" field is determined on 8 bits (instead
• the opt_order may be determined based on
• opt_order min (global prediction order, local prediction order) ;
• the global and local prediction orders may be determined by :
• data samples of the subdivided block from a channel are predicted.
• a first sample of a current block is predicted using the last K samples of a previous block. The K
• the current block is a first block of the channel, no samples from the previous block are used. In this case,
• the first sample in the block does not perform
• the second sample of the block uses the first
• the third sample of the block uses the first and second
• the random access frame corresponds to a reference frame of
• the random access unit does not
• predictor coefficients h k is not very efficient for
• coefficient estimating part 120 As described above, for example, the coefficient estimating part 120 is processed
• the first two parcor coefficients ( ⁇ 1 and ⁇ 2 correspondingly)
• coding part 140 is used for coding the above-described
• part 140 e.g., the Rice code method.
• a table index (i.e., a 2-bit "coef_table” ) is
• the offset is always -64 in order to
• the first entropy decoding part 220 reconstructs the
• r(.) is an empirically determined mapping table (not shown
• the mapping table may vary with implementation) . Accordingly, the three types of coefficient tables used for the first entropy coding are provided according to the sampling frequency.
• the sampling frequency may be divided to 48kHz, 96kHz, and 192kHz.
• table can also be chosen by other criteria.
• Table 3 Rice code parameters used for encoding of
• Table 4 Rice code parameters used for encoding of quantized coefficients (96 kHz) .
• Table 5 Rice code parameters used for encoding of
• the present invention contains two different modes of the
• the residual values e( ⁇ ) are entropy coded using Rice code. For each block, either all values can be
• the optimal Rice code for a given set of data it is up to the encoder to select suitable codes depending upon the statistics of the residual.
• the encoder can use a more complex and efficient coding scheme using BGMC mode.
• BGMC mode In the BGMC mode,
• the two types include
• tails are simply re-centered (i.e., for e( ⁇ ) > e max ,
• the BGMC first splits the residuals into LSB and MSB components, then the BGMC encodes
• the BGMC transmits LSBs using direct fixed-lengths
• transmitted LSBs may be selected such' that they only slightly
• Table 8 includes information related to coding of the Rice code and BGMC code.
• the configuration syntax (Table 6) first includes a 1-bit
• the "sb_jpart" field corresponds to information related
• ⁇ sb_part varies in accordance with the value of the "bgmc_mode” field.
• the "ec_sub” field indicates the number of sub- blocks existing in the actual corresponding block.
• the meaning of the "ec_sub” field varies in accordance with
• BGMC code or the BGMC code is used to partition the block to sub-
• 2 bits are assigned to the w ec_sub" field.
• Second entropy coding part 180 are coded by second entropy coding part 180 using a difference coding method.
• An example of using the Rice code will now be
• configuration syntax may form a header periodically placed in
• bitstream may form a header of each frame; etc.
• Table 6 Configuration syntax.
• Table 7 Frame data syntax.
• Table 8 Block_data syntax.
• the lossless audio codec is compared with two of the most popular programs for lossless audio
• the test comprises nearly 1 GB of stereo waveform data with sampling rates of 48, 96, and 192 kHz, and resolutions of 16 and 24
• the compression ratio is defined as:
• high-definition material i.e., 96 kHz / 24-bit and above.
• the audio signal encoder of the present invention is an ongoing development.
• Pentiuiti-M depending on audio format (kHz/bits) and ALS encoder complexity.
• the codec is designed to offer a large range of complexity
• the decoder complexity is further reduced by a factor of three (i.e., less than 2% CPU load for
• audio data can be decoded even on hardware with very low computing power.
• the decoder may be affected by a higher average prediction order.

Landscapes

• Engineering & Computer Science (AREA)
• Physics & Mathematics (AREA)
• Multimedia (AREA)
• Signal Processing (AREA)
• Acoustics & Sound (AREA)
• Health & Medical Sciences (AREA)
• Human Computer Interaction (AREA)
• Audiology, Speech & Language Pathology (AREA)
• Computational Linguistics (AREA)
• Spectroscopy & Molecular Physics (AREA)
• Mathematical Physics (AREA)
• Compression, Expansion, Code Conversion, And Decoders (AREA)
• Stereophonic System (AREA)
• Compression Or Coding Systems Of Tv Signals (AREA)
• Signal Processing For Digital Recording And Reproducing (AREA)

Priority Applications (3)

Applications Claiming Priority (16)

Publications (2)

Family

ID=37637332

Family Applications (14)

Family Applications After (13)

Country Status (5)

Cited By (1)

Families Citing this family (80)

Family Cites Families (141)

• 2006
  • 2006-07-07 US US11/481,916 patent/US8108219B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,931 patent/US7411528B2/en active Active
  • 2006-07-07 US US11/481,940 patent/US8180631B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,942 patent/US7830921B2/en active Active
  • 2006-07-07 US US11/481,939 patent/US8121836B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,917 patent/US7991272B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,932 patent/US8032240B2/en active Active
  • 2006-07-07 US US11/481,929 patent/US7991012B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,930 patent/US8032368B2/en active Active
  • 2006-07-07 US US11/481,926 patent/US7949014B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,941 patent/US8050915B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,933 patent/US7966190B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,915 patent/US7996216B2/en not_active Expired - Fee Related
  • 2006-07-07 US US11/481,927 patent/US7835917B2/en active Active
  • 2006-07-10 JP JP2008521317A patent/JP2009500691A/ja active Pending
  • 2006-07-10 JP JP2008521313A patent/JP2009500688A/ja active Pending
  • 2006-07-10 EP EP06757766A patent/EP1913581A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521308A patent/JP2009500684A/ja active Pending
  • 2006-07-10 JP JP2008521318A patent/JP2009500692A/ja active Pending
  • 2006-07-10 EP EP06769223A patent/EP1913587A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521311A patent/JP2009500687A/ja active Pending
  • 2006-07-10 EP EP06769226A patent/EP1913588A4/en not_active Withdrawn
  • 2006-07-10 EP EP06769222A patent/EP1908058A4/en not_active Withdrawn
  • 2006-07-10 WO PCT/KR2006/002678 patent/WO2007008000A2/en not_active Ceased
  • 2006-07-10 JP JP2008521306A patent/JP2009500682A/ja active Pending
  • 2006-07-10 EP EP06769220A patent/EP1913585A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521316A patent/JP2009510810A/ja active Pending
  • 2006-07-10 CN CNA2006800251376A patent/CN101218631A/zh active Pending
  • 2006-07-10 EP EP06769219A patent/EP1913584A4/en not_active Withdrawn
  • 2006-07-10 CN CNA2006800294174A patent/CN101243489A/zh active Pending
  • 2006-07-10 CN CNA2006800304797A patent/CN101243493A/zh active Pending
  • 2006-07-10 CN CNA2006800304693A patent/CN101243492A/zh active Pending
  • 2006-07-10 WO PCT/KR2006/002680 patent/WO2007008002A2/en not_active Ceased
  • 2006-07-10 EP EP06769227A patent/EP1911020A4/en not_active Withdrawn
  • 2006-07-10 WO PCT/KR2006/002687 patent/WO2007008009A1/en not_active Ceased
  • 2006-07-10 EP EP06769224A patent/EP1913794A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521310A patent/JP2009500686A/ja active Pending
  • 2006-07-10 CN CN2006800294070A patent/CN101243496B/zh not_active Expired - Fee Related
  • 2006-07-10 CN CNA200680024866XA patent/CN101218852A/zh active Pending
  • 2006-07-10 WO PCT/KR2006/002690 patent/WO2007008012A2/en not_active Ceased
  • 2006-07-10 EP EP06757764A patent/EP1913579A4/en not_active Withdrawn
  • 2006-07-10 EP EP06757765A patent/EP1913580A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521314A patent/JP2009500689A/ja active Pending
  • 2006-07-10 CN CNA200680028892XA patent/CN101238509A/zh active Pending
  • 2006-07-10 WO PCT/KR2006/002681 patent/WO2007008003A2/en not_active Ceased
  • 2006-07-10 WO PCT/KR2006/002685 patent/WO2007008007A1/en not_active Ceased
  • 2006-07-10 JP JP2008521305A patent/JP2009500681A/ja active Pending
  • 2006-07-10 EP EP06769225A patent/EP1911021A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521309A patent/JP2009500685A/ja active Pending
  • 2006-07-10 JP JP2008521319A patent/JP2009500693A/ja active Pending
  • 2006-07-10 WO PCT/KR2006/002683 patent/WO2007008005A1/en not_active Ceased
  • 2006-07-10 EP EP06769218A patent/EP1913589A4/en not_active Withdrawn
  • 2006-07-10 JP JP2008521307A patent/JP2009500683A/ja active Pending
  • 2006-07-10 CN CNA2006800305412A patent/CN101243497A/zh active Pending
  • 2006-07-10 WO PCT/KR2006/002688 patent/WO2007008010A1/en not_active Ceased
  • 2006-07-10 CN CNA2006800305499A patent/CN101243495A/zh active Pending
  • 2006-07-10 CN CNA2006800305111A patent/CN101243494A/zh active Pending
  • 2006-07-10 CN CNA2006800251395A patent/CN101218629A/zh active Pending
  • 2006-07-10 WO PCT/KR2006/002686 patent/WO2007008008A2/en not_active Ceased
  • 2006-07-10 CN CNA2006800289829A patent/CN101238510A/zh active Pending
  • 2006-07-10 WO PCT/KR2006/002679 patent/WO2007008001A2/en not_active Ceased
  • 2006-07-10 WO PCT/KR2006/002682 patent/WO2007008004A2/en not_active Ceased
  • 2006-07-10 CN CN2006800251380A patent/CN101218628B/zh not_active Expired - Fee Related
  • 2006-07-10 WO PCT/KR2006/002689 patent/WO2007008011A2/en not_active Ceased
  • 2006-07-10 EP EP06757767A patent/EP1913582A4/en not_active Withdrawn
  • 2006-07-10 EP EP06757768A patent/EP1913583A4/en not_active Withdrawn
  • 2006-07-10 CN CN2006800252699A patent/CN101218630B/zh not_active Expired - Fee Related
  • 2006-07-10 WO PCT/KR2006/002677 patent/WO2007007999A2/en not_active Ceased
  • 2006-07-10 WO PCT/KR2006/002691 patent/WO2007008013A2/en not_active Ceased
  • 2006-07-10 JP JP2008521315A patent/JP2009500690A/ja active Pending
• 2008
  • 2008-09-18 US US12/232,526 patent/US8010372B2/en not_active Expired - Fee Related
  • 2008-09-18 US US12/232,527 patent/US7962332B2/en not_active Expired - Fee Related
  • 2008-09-19 US US12/232,593 patent/US8326132B2/en not_active Expired - Fee Related
  • 2008-09-19 US US12/232,595 patent/US8417100B2/en not_active Expired - Fee Related
  • 2008-09-19 US US12/232,590 patent/US8055507B2/en not_active Expired - Fee Related
  • 2008-09-19 US US12/232,591 patent/US8255227B2/en not_active Expired - Fee Related
  • 2008-09-22 US US12/232,658 patent/US8510119B2/en not_active Expired - Fee Related
  • 2008-09-22 US US12/232,662 patent/US8510120B2/en not_active Expired - Fee Related
  • 2008-09-22 US US12/232,659 patent/US8554568B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,739 patent/US8155152B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,741 patent/US8149877B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,748 patent/US8155153B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,743 patent/US7987008B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,734 patent/US8155144B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,744 patent/US8032386B2/en active Active
  • 2008-09-23 US US12/232,740 patent/US8149876B2/en not_active Expired - Fee Related
  • 2008-09-23 US US12/232,747 patent/US8149878B2/en not_active Expired - Fee Related
  • 2008-09-24 US US12/232,783 patent/US8275476B2/en not_active Expired - Fee Related
  • 2008-09-24 US US12/232,784 patent/US7987009B2/en not_active Expired - Fee Related
  • 2008-09-24 US US12/232,782 patent/US8046092B2/en active Active
  • 2008-09-24 US US12/232,781 patent/US7930177B2/en not_active Expired - Fee Related
  • 2008-12-18 US US12/314,891 patent/US8065158B2/en not_active Expired - Fee Related

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events