Digital transmission of acoustic signals over a noisy communication channel

• US 5,517,511 A
• Filed: 11/30/1992
• Issued: 05/14/1996
• Est. Priority Date: 11/30/1992
• Status: Expired due to Term

• Current Assignee: Digital Voice Systems, Inc.
• Original Assignee: Digital Voice Systems, Inc.
• Inventors: Hardwick, John C., Lim, Jae S.
• Primary Examiner(s): Beausoliel, Jr., Robert W.
• Assistant Examiner(s): Decady, Albert
• Application Number:
  US07/982,937
• Time in Patent Office: 1,261 Days
• Field of Search: 371/37.1, 371/37.4, 371/56, 370/82, 375/45, 375/46, 375/47, 375/52, 375/64, 375/67, 375/68, 375/83, 375/90, 375/243, 375/261, 375/268, 375/269, 375/271, 375/272, 375/273, 375/274, 375/279, 375/303, 381/36, 381/265, 364/265, 364/265.1, 364/265.2, 364/944.5
• US Class Current: 714/755
• CPC Class Codes: G10L 19/002 Dynamic bit allocation for perceptual audio coders G10L19/032
• CPC Class Codes: G10L 19/005 Correction of errors induced by the transmission channel, if related to the coding algorithm
• CPC Class Codes: G10L 19/06 Determination or coding of the spectral characteristics, e.g. of the short-term prediction coefficients
• CPC Class Codes: G10L 19/10 the excitation function being a multipulse excitation
• CPC Class Codes: H03M 13/00 Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes error detection or error correction for analogue/digital, digital/analogue or code conversion H03M1/00 – H03M11/00; specially adapted for digital computers G06F11/08; for information storage based on relative movement between record carrier and transducer G11B, e.g. G11B20/18; for static stores G11C
• CPC Class Codes: H03M 13/1505 Golay Codes
• CPC Class Codes: H03M 13/19 Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes
• CPC Class Codes: H03M 13/29 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
• CPC Class Codes: H03M 13/2903 Methods and arrangements specifically for encoding, e.g. parallel encoding of a plurality of constituent codes
• CPC Class Codes: H03M 13/2906 using block codes H03M13/2957 takes precedence
• CPC Class Codes: H03M 13/35 Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 1/0045 Arrangements at the receiver end
• CPC Class Codes: H04L 1/0058 Block-coded modulation
• CPC Class Codes: H04L 1/007 Unequal error protection for format H04L1/0078; for codes per se H03M13/35
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27

Abstract

The performance of digital communication over a noisy communication channel is improved. An encoder combines bit modulation with error control encoding to allow the decoder to use the redundancy in the error control codes to detect uncorrectable bit errors. This method improves the efficiency of the communication system since fewer bits are required for error control, leaving more bits available for data. In the context of a speech coding system, speech quality is improved without sacrificing robustness to bit errors. A bit prioritization method further improves performance over noisy channels. Individual bits in a set of quantizer values are arranged according to their sensitivity to bit errors. Error control codes having higher levels of redundancy are used to protect the most sensitive (highest priority) bits, while lower levels of redundancy are used to protest less sensitive bits. This method improves efficiency of the error control system, since only the highest priority data is encoded with the highest levels of redundancy. The effect of uncorrectable bit errors is reduced by adaptively smoothing the spectral parameters in a speech decoder. The amount of smoothing is varied depending upon the number of errors detected during the error control decoding of the received data. More smoothing is used when a large number of errors are detected, thereby reducing the perceived effect of any uncorrectable bit errors which may be present.

Claims

1. A method for error control coding of digital data, the method comprising the steps of:

dividing said digital data into a plurality of bit vectors, including a first bit vector;

encoding said bit vectors with error control codes, to produce encoded bit vectors, including an encoded first bit vector;

generating a modulation key from at least said first bit vector; and

using said modulation key to modulate at least some of said encoded bit vectors.

2. The method of claim 1 wherein said digital data comprises bits of varying priority, and wherein said first bit vector comprises a high priority bit vector containing bits of higher priority than at least some other said bits.

3. The method of claim 1 wherein said digital data is divided into frames, each frame comprising a said plurality of bit vectors.

4. The method of claim 2 wherein said digital data is divided into frames, each frame comprising a said plurality of bit vectors.

5. The method of claim 1 or 4 wherein a first group of said bit vectors are each encoded by a first type of error control code and a second group of said bit vectors are each encoded by a second type of error control code.

6. The method of claims 3 or 4 wherein said frames of digital data are generated by encoding a speech signal with a speech coder.

7. The method of claim 6 wherein said frames of digital data are grouped into a plurality of frame formats and wherein the said modulation key is generated from one of said bit vectors, said one bit vector determining the frame format used in the current frame.

8. A method of decoding digital data of the type encoded by an encoding method comprising the steps of:

dividing said digital data into a plurality of bit vectors, including a first bit vector;

encoding said bit vectors with error control codes, to produce encoded vectors, including an encoded first bit vector;

generating a modulation key from at least said first bit vector; and

using said modulation key to modulate at least some of said encoded bit vectors, to produce modulated encoded bit vectors;

said method of decoding comprising the steps of;

dividing the digital data to be decoded into a plurality of code vectors, said code vectors corresponding to said modulated encoded bit vectors;

generating a demodulation key from at least one of said code vectors;

using said demodulation key to demodulate at least some of said code vectors, to produce demodulated code vectors; and

error control decoding at least some of said demodulated code vectors.

9. The method of claim 8 further comprising the steps of:

computing an error measure which is formed at least in part by comparing said demodulated code vectors before error control decoding with said demodulated code vectors after error control decoding;

comparing the value of said error measure against a threshold; and

declaring said frame invalid if said error measure exceeds said threshold.

10. The method of claim 9 wherein said demodulation is performed using a method comprising the steps of:

initializing a pseudo-random sequence using said demodulation key;

using said pseudo-random sequence to generate one or more binary demodulation vectors; and

performing modulo 2 addition of said binary demodulation vectors to a plurality of said code vectors.

11. The method of claim 10 wherein said demodulation key is generated from one of said code vectors after said one code vector has been error control decoded.

12. The method of claims 8, 9, 10 or 11 wherein a first group of said demodulated code vectors are each decoded using a first type of error control code and a second group of said demodulated code vectors are each decoded using a second type of error control code.

13. The method of claim 12 wherein said first type of error control code is a Golay code and said second type of error control code is a Hamming code.

14. The method of claims 8, 9, 10 or 11 wherein said digital data comprises code vectors of varying priority, and wherein said demodulation key is generated from a high priority code vector.

15. The method of claims 9, 10 or 11 wherein said error measure is computed at least in part by counting the number of errors detected or corrected by said error control decoding.

16. The method of claim 14 wherein said frames of digital data represent a speech signal which has been encoded with a speech coder.

17. The method of claim 16 wherein said frames of digital data are grouped into a plurality of frame formats and wherein said demodulation key is generated from one of said code vectors, said one code vector determining the frame format used in each frame.

18. The method of claim 16 wherein said demodulation key is generated from one of said code vectors, said one code vector representing at least in part the level of said speech signal.

19. The method of claim 16 wherein said invalid frames are discarded and replaced by the last decoded frame which was not declared to be invalid.

20. The method of claim 16 wherein said speech coder is one of the following speech coders:

Multi-Band Excitation (MBE) speech coder, Improved Multi-Band Excitation (IMBE™

) speech coder, or sinusoidal transform speech coder (STC).