SYSTEM AND METHOD FOR INCREASING TRANSMISSION BANDWIDTH EFFICIENCY ("EBT2")

• US 20180068665A1
• Filed: 09/15/2017
• Published: 03/08/2018
• Est. Priority Date: 09/26/2011
• Status: Active Grant

• Current Assignee: Sirius XM Radio Inc. (Liberty Media Corporation)
• Original Assignee: Sirius XM Radio Inc. (Liberty Media Corporation)
• Inventors: Marko, Paul, Sinha, Deepen, Aggrawal, Hariom
• Granted Patent: US 10,096,326 B2
• Time in Patent Office: Days
• CPC Class Codes: G10L 19/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 in musical instruments G10H
• CPC Class Codes: G10L 19/008 Multichannel audio signal coding or decoding using interchannel correlation to reduce redundancy, e.g. joint-stereo, intensity-coding or matrixing
• CPC Class Codes: G10L 19/0212 using orthogonal transformation
• CPC Class Codes: G10L 2019/0001 Codebooks
• CPC Class Codes: H04H 2201/18 in band on channel [IBOC]
• CPC Class Codes: H04H 60/58 of audio determination or detection of speech characteristics in general G10L25/00; speech recognition in general G10L15/00

Abstract

Systems and methods for increasing transmission bandwidth efficiency by the analysis and synthesis of the ultimate components of transmitted content are presented. To implement such a system, a dictionary or database of elemental codewords can be generated from a set of audio clips. Using such a database, a given arbitrary song or other audio file can be expressed as a series of such codewords, where each given codeword in the series is a compressed audio packet that can be used as is, or, for example, can be tagged to be modified to better match the corresponding portion of the original audio file. Each codeword in the database has an index number or unique identifier. For a relatively small number of bits used in a unique ID, e.g. 27-30, several hundreds of millions of codewords can be uniquely identified. By providing the database of codewords to receivers of a broadcast or content delivery system in advance, instead of broadcasting or streaming the actual compressed audio signal, all that need be transmitted is the series of identifiers along with any modification instructions to the identified codewords. After reception, intelligence on the receiver having access to a locally stored copy of the dictionary can reconstruct the original audio clip by accessing the codewords via the received IDs, modify them as instructed by the modification instructions, further modify the codewords either individually or in groups using the audio profile of the original audio file (also sent by the encoder) and play back a generated sequence of phase corrected codewords and modified codewords as instructed. In exemplary embodiments of the present invention, such modification can extend into neighboring codewords, and can utilize either or both (i) cross correlation based time alignment and (ii) phase continuity between harmonics, to achieve higher fidelity to the original audio clip.

Claims

1-12. -12. (canceled)

13. A method of generating a database of compressed audio packets for use in encoding and decoding arbitrary audio clips, comprising:

obtaining original audio content for a set of audio files;

encoding a first audio file from said set using a perceptual encoder to obtain a series of compressed packets for said first audio file, and store said series of compressed packets in the database, each with a unique identifier;

for each additional audio file in the set of audio files;

encoding the audio file using the perceptual encoder to obtain a series of compressed packets for the audio file;

comparing each of the series of compressed packets for the additional audio file with the compressed packets stored in the database;

removing any of the compressed packets for the additional audio file that are similar by a defined metric to a compressed packet already stored in the database;

storing the non-removed compressed packets for said additional audio file in the database, each with a unique identifier.

14. The method of claim 13, wherein said unique identifier is a unique identification number of between 20-30 bits.

15. The method of claim 13, further comprising, following the storage of said series of compressed packets in the database for said first audio file, comparing said series of compressed packets stored in the database amongst each other, and removing ones of said series of compressed packets in the database for said first audio file that are similar by a defined metric to another compressed packet of said first audio file.

16. The method of claim 13, further comprising, following the storage of said series of compressed packets in the database for said first audio file, comparing said series of compressed packets stored in the database amongst each other, and removing two or more of said series of compressed packets in the database for said first audio file that are similar by a defined metric to another compressed packet of said first audio file and replacing them with a synthetic compressed packet that is similar by said defined metric to all of said two or more compressed packets.

17-19. -19. (canceled)

20. A method of generating a database of compressed audio packets for use in encoding and decoding arbitrary audio clips, comprising:

sampling a full length audio clip, and dividing it into segments of 2048 samples;

calculate an Odd Discrete Frequency Transform for each RMS normalized time domain segment;

perform psychoacoustic analysis over each segment to calculate masking thresholds corresponding to N quality indices;

analyze each segment with other segments present in the database to identify the uniqueness of the segment;

remove any segment that is not unique by a defined metric;

store the unique segments in the database.

21. The method of claim 20, wherein each segment is considered as an examine frame, and each segment already present in the database as a reference frame, wherein each examine frame is allocated a similarity index as per defined matching criteria.

22. The method of claim 21, wherein for said similarity index “

1”

is a best match and 5.0 is a worst match, with a step size of 0.2 between 1 and 5.

23. A method of decoding a representative audio signal comprising a sequence of unique identifiers to compressed packets in a database, comprising:

receiving an audio signal comprising a sequence of unique identifiers to compressed packets with associated modification instructions in a database;

as to each identifier in the sequence;

obtain the compressed packet from the database identified by the identifier,

obtain the modification instructions associated with the identifier in the sequence, and

modify the compressed packet according to said modification instructions;

generate a sequence of all of the indicated compressed packets as modified; and

play the sequence through a speaker to a user.

24. The method of claim 23, wherein said modification instructions include results of harmonic analysis and time domain cross-correlation.

25. The method of claim 23, wherein said obtain the modification instructions includes determining if a harmonic flag has been set.

26. The method of claim 25, wherein:

if a harmonic flag has been set, analytically guessing the phase in the frequency domain and performing an inverse ODFT; and

if no harmonic flag has been set, performing time domain data shifting.

27. The method of claim 26, further comprising performing RMS correction followed by combining neighboring frames using an adaptive window.

28. The method of claim 23, wherein said modification instructions include performing a linear or non-linear transformation on the identified packet.

29. The method of claim 23, wherein said modification instructions include performing a linear or non-linear transformation on the identified packet and neighboring packets.