US20050246609A1 - Coding device and communication system using the same - Google Patents

Coding device and communication system using the same Download PDF

Info

Publication number
US20050246609A1
US20050246609A1 US11/178,732 US17873205A US2005246609A1 US 20050246609 A1 US20050246609 A1 US 20050246609A1 US 17873205 A US17873205 A US 17873205A US 2005246609 A1 US2005246609 A1 US 2005246609A1
Authority
US
United States
Prior art keywords
bits
circuit
coding
rate matching
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US11/178,732
Inventor
Timothy Moulsley
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to US11/178,732 priority Critical patent/US20050246609A1/en
Publication of US20050246609A1 publication Critical patent/US20050246609A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/27Coding, 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 using interleaving techniques
    • H03M13/2792Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/27Coding, 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 using interleaving techniques
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/27Coding, 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 using interleaving techniques
    • H03M13/2703Coding, 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 using interleaving techniques the interleaver involving at least two directions
    • H03M13/2707Simple row-column interleaver, i.e. pure block interleaving
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/27Coding, 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 using interleaving techniques
    • H03M13/2703Coding, 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 using interleaving techniques the interleaver involving at least two directions
    • H03M13/271Row-column interleaver with permutations, e.g. block interleaving with inter-row, inter-column, intra-row or intra-column permutations
    • H03M13/2714Turbo interleaver for 3rd generation partnership project [3GPP] universal mobile telecommunications systems [UMTS], e.g. as defined in technical specification TS 25.212
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/63Joint error correction and other techniques
    • H03M13/635Error control coding in combination with rate matching
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/63Joint error correction and other techniques
    • H03M13/635Error control coding in combination with rate matching
    • H03M13/6356Error control coding in combination with rate matching by repetition or insertion of dummy data, i.e. rate reduction
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/63Joint error correction and other techniques
    • H03M13/635Error control coding in combination with rate matching
    • H03M13/6362Error control coding in combination with rate matching by puncturing
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/65Purpose and implementation aspects
    • H03M13/6508Flexibility, adaptability, parametrability and configurability of the implementation
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/65Purpose and implementation aspects
    • H03M13/6508Flexibility, adaptability, parametrability and configurability of the implementation
    • H03M13/6516Support of multiple code parameters, e.g. generalized Reed-Solomon decoder for a variety of generator polynomials or Galois fields
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/65Purpose and implementation aspects
    • H03M13/6522Intended application, e.g. transmission or communication standard
    • H03M13/65583GPP2
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0067Rate matching
    • H04L1/0068Rate matching by puncturing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0067Rate matching
    • H04L1/0068Rate matching by puncturing
    • H04L1/0069Puncturing patterns
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0071Use of interleaving
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/08Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13Linear codes
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/23Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using convolutional codes, e.g. unit memory codes
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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
    • H03M13/29Coding, 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 combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2957Turbo codes and decoding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding

Definitions

  • This invention relates generally to digital communication systems, and more particularly to a communication system using coding of the digital input to generate a coded input having a greater number of bits than the digital input.
  • Forward Error Correction (FEC) operates in this manner, and convolutional coding is one example of forward error correction system.
  • a digital input is coded by a convolutional coding circuit so that for every number k of bits inputted into the convolutional coding circuit, a greater number n of bits is provided as output.
  • a coding rate for the convolutional coding circuit is defined as the ratio of the number k of input bits to the number n of coded output bits. Thus, for example, the coding rate is 1/2 when for each bit inputted into the convolutional coding circuit, two output bits result. This increase in the number of bits results in a decrease in the signal bit rate.
  • U.S. Pat. No. 5,668,820 and U.S. Pat. No. 5,511,082 each disclose a digital communication system having a punctured convolutional coding system of the type described above.
  • the invention is particularly concerned with a coding device which has a coded output and in which a number of words of the coded output signal are interleaved.
  • Interleaving is a well known technique used for improving the error performance of a transmission system.
  • the use of a conventional variable rate convolutional coding circuit (or other FEC coding circuit) in a coding device having interleaving of the coded output requires the interleaving circuitry to be adaptive to the output bit rate of the convolutional coder.
  • the interleaving of data should be performed after coding, but before rate matching of the data stream (i.e. before puncturing or bit repetition).
  • rate matching circuit may not be appropriate for the bit structure generated by the interleaving circuit.
  • the bits selected for puncturing bits provide information concerning the same or adjacent bits in the digital input. This increases the probability of error in the transmission in respect of that part of the input signal.
  • a rate matching circuit for adjusting the number of bits in a data block, the data block comprising a plurality of interleaved words generated by the action of an interleaving circuit on a coded output generated by the action of a coding circuit on a digital input, the coded output having a greater number of bits than the digital input, the rate matching circuit having means for adjusting the number of bits in the data block using a rate matching pattern to provide data bits for transmission during respective frames of a transmission channel, characterised in that means are provided for selecting the rate matching pattern depending on the characteristics of the coding circuit and of the interleaving circuit.
  • repeating pattern is meant a pattern (of 1's and 0's) indicating which bits within a respective data block are to be repeated.
  • the interleaving circuit does not need to be adaptive, because it is selected for interface with a coding circuit having a fixed code rate or a limited number of rates for a variable rate data source.
  • the puncturing circuit or repeating circuit then operates on the interleaved words in order to adjust the output bit rate to be appropriate for transmission over the transmission channel.
  • the deletion or repetition pattern is then selected in such a way that (i) in the case of deletion of bits, the puncturing has least at least detrimental effect to the digital circuit) which has been coded and interleaved before input to the puncturing circuit or (ii) in the case of repetition of bits, the repetition has the most beneficial effect for the output for transmission and is not concentrated at one portion of the digital input.
  • the single puncturing or repeating stage which effects rate matching of the input signal, can be used to control the transmission quality of the input signal (by altering the forward error correction characteristics) as well as manipulating the output bit rate to be suitable for subsequent transmission, for example to match the maximum bit rate of the transmission channel. This avoids the need for separate rate matching stages for quality of service requirements and for channel capacity consideration.
  • the pattern for each interleaved word within the data block may be offset with respect to the adjacent interleaved word or words within the block.
  • the targeting of different bits within adjacent words of the interleaved block is one way of preventing adjacent bits from the coded output word from being targeted by the repetition/deletion pattern.
  • the pattern may be selected as a function of the interleaving depth of the interleaving circuit.
  • the coding preferably comprises convolutional coding, and the deletion or repetition pattern will take into account, for example, the constraint length of the convolutional coding circuit.
  • the rate matching circuit enables the output bit rate to be controlled, and this has particular application when a number of digital inputs are to be multiplexed on to a single carrier.
  • a communication system may comprise a plurality of coding devices, each for coding a respective digital input, and a multiplexer for combining output data words of the coding devices for subsequent transmission by the transmission system on the single transmission channel.
  • the outputs of different coding devices may be selected to have different data rates, with the combined data rate corresponding to the channel capacity of the transmission channel.
  • a coding device comprising a rate matching circuit made in accordance with the present invention, further comprising an interleaving circuit and a coding circuit.
  • a decoding device for decoding a signal coded by a coding device of the invention, and comprising a data reconstruction circuit for reconstructing the interleaved words, a de-interleaving circuit and a channel decoder.
  • a communication system comprising a transmitter having a coding device of the invention and a transmission system for transmitting the output data words of the coding device.
  • a receiver of the system includes the decoding device.
  • a method of operating a rate matching circuit to adjust the number of bits in a data block comprising a plurality of interleaved words generated by the action of an interleaving circuit on a coded output generated by the action of a coding circuit on a digital input, the coded output having a greater number of bits than the digital input, the rate matching circuit adjusting the number of bits in the data block using a rate matching pattern to provide data bits for transmission during respective frames of a transmission channel, characterised by selecting the rate matching pattern depending on the characteristics of the coding circuit and of the interleaving circuit.
  • FIG. 1 represents schematically the components required to implement a transmission system using a coding device
  • FIG. 2 is a schematic representation of a bit stream passing through the coding device.
  • FIG. 3 represents schematically the components required to implement a decoding device of the invention.
  • FIG. 1 shows an embodiment of a coding device for coding of a digital input in such a way as to increase the number of bits.
  • This is a standard approach to provide forward error correction capability, and convolutional coding is one common example.
  • a channel coding stage for example convolutional coding
  • inter-frame interleaving is followed by inter-frame interleaving, and with the interleaved output being subjected to rate matching, which may be puncturing or bit repetition.
  • the puncturing or bit repetition is performed using a deletion/repetition pattern which targets a number of bits from the matrix of the interleaving circuit 16 .
  • the pattern is selected as a function of the coding and interleaving operations, in such a way that all bits of the digital input can be derived from non-targeted bits of the output of the interleaving circuit 16 .
  • FIG. 1 shows a communication system 10 for the transmission on a single channel of data from two data inputs 12 , 22 .
  • Each data input is associated with a respective coding device 13 , 23 which performs convolutional coding of the input, and also performs rate matching so that the coded data can be modulated on to the available transmission channel which has a maximum channel capacity.
  • Each coding device 13 , 23 comprises a respective channel coding circuit 14 , 24 .
  • the channel coding circuit in the example of FIG. 1 performs convolutional coding of the data input.
  • Standard convolutional coding circuitry is available, which converts a number k of input bits into a greater number n of output bits, with the advantage that forward error correction may be implemented.
  • the coding rate is expressed as a ratio of the number of input bits to the number of output bits of the coding circuit, and standard convolutional coding circuits are available with coding rates of, for example, 1/2, 1/3, 1/4.
  • Convolutional coding circuits generally include shift registers, function generators, a memory and a multiplexer.
  • Each output bit of the convolutional coding circuit comprises a known function executed on a given previous number of bits of the input signal, depending upon the constraint length (the memory length) of the coding circuit. There may be direct mapping of input bits to the output as well as some functional transformations performed on the input bits, to provide the additional error correction capability. Alternatively, there may be no direct mapping of input bits.
  • the output of the coding circuit can be decoded by corresponding decoding circuitry in order to regenerate the original data input as well as additional data suitable for error correction operations.
  • the convolutionally coded output word is supplied to an interleaving circuit 16 , 26 for combining a number of the convolutional output words and producing a data block comprising a corresponding number of interleaved words.
  • the simplest form of interleaving circuit comprises a block interleaver which fills an interleaving matrix row by row with a number of input words (corresponding to the interleaving depth) and outputs the data column by column.
  • Other interleaving schemes are also known. This process generally makes the transmission of data less susceptible to errors caused by disruptions to the transmission channel.
  • the interleaved output is supplied to a rate matching circuit 18 , 28 which effectively changes the code rate of the convolutional coding circuit, so that the output bit rate is more accurately controllable.
  • This rate matching may comprise puncturing of the interleaved data block (namely removing bits) or may comprise bit repetition. It is known to puncture a convolutional coded output in order increase the code rate, and examples of this are given in U.S. Pat. No. 5,511,082.
  • An advantage of the structure of the coding device described above is that the rate matching operation follows the coding operation, with the result that the interleaving circuit 16 , 26 has a constant input bit rate governed by the bit rate of the data source and the reduction in the bit rate resulting from the convolutional coding circuit 14 , 24 . Consequently, the need for adaptive interleaving circuitry is avoided.
  • the rate matching pattern is selected, in accordance with the invention, depending on the operation of the interleaving circuit and the coding circuit. This will be described in further detail with reference to FIG. 2 .
  • the rate matching circuit 18 , 28 also permits the channel coding for particular data input to be adjusted to correspond to a particular quality of service requirement, for example concerning the error performance of the transmission channel.
  • the rate matching circuits 18 , 28 in combination are also used to ensure that the overall bit rate of the signals, once multiplexed, does not exceed the transmission channel capacity.
  • a single rate matching operation can be used to achieve specific requirements of a transmission channel relating to an individual data input, as well as ensuring that the combined data information can successfully be transmitted. There will be a trade off between the achievable error performance of the individual data channels and the combined data rate, but these considerations are achieved with a single rate matching circuit for each coding device.
  • the outputs of the two coding devices 13 , 23 are multiplexed together by a multiplexing circuit 30 to enable transmission over the single channel.
  • the output of the multiplexing circuit is effectively a frame of data for transmission over the channel, and the frame may correspond in size to one block of interleaved data.
  • the frame data may be interleaved by an intra-frame interleaving circuit 32 for subsequent transmission by a conventional modulation and transmission circuit 34 .
  • the operation of the coding device 13 , 23 shown in FIG. 1 is shown in greater detail with reference to FIG. 2 .
  • FIG. 2 part A shows, for the purposes of illustration, a sequence of input data bits which are supplied to the coding device. These may be arranged as words of a predetermined number of bits or as a continuous data stream as shown.
  • the channel coding circuit 14 , 24 applies convolutional coding to the input data stream and generates a bit stream having a greater number of bits.
  • the convolutional coding circuit converts a data stream of length k to a stream of length n, as shown, which effectively increases the number of bits for transmission by n/k.
  • Interleaving is applied to the coded data words and in the example shown in FIG. 2 the inter-frame interleaving circuit 16 operates on 8-bit words from the coded data stream and applies a block interleaving algorithm with a depth of 4.
  • the interleaving circuit bitwise fills an interleaving matrix of 4 columns and 8 rows, row by row.
  • the block of data represented in FIG. 2 part C is subjected to a deletion or repetition pattern in order to alter the bit rate so that all signals when multiplexed together produce a data stream which can be handled by the available transmission channel.
  • deletion or repetition pattern should be selected such that the deleted or repeated bits should not be required to enable all bits from the digital input to be reconstructed.
  • the assumption can be made that a convolutional coding circuit of low constraint length is employed.
  • the effect of this is that there is almost direct mapping between the coded data and the input data, so that adjacent coded data bits will provide information concerning adjacent bits of the digital input signal.
  • the deletion or repetition of adjacent input bits should be avoided, because (i) in the case of deletion of bits, the probability of error in transmission in respect of that part of the input data is increased, and (ii) in the case of repetition of bits, the extra capacity should be distributed evenly over the input data stream in order for the repetition to improve the overall error performance of the transmission. It will be possible to avoid deletion of adjacent bits in the digital input for low puncturing rates.
  • deletion or repetition may give poor results depending on the interleaving depth (number of columns) and deletion/repetition rate. For example, if every fourth bit is deleted or repeated when the block of data represented by FIG. 2 part C is read out (column by column), the result will be to delete or repeat four adjacent bits in the first row (A 11 , to A 14 ) and in the fifth row (A 31 to A 34 ).
  • the deletion/repetition pattern shown in FIG. 2 part D the bits for deletion or repetition have been selected with a maximum of one such bit on each row of the interleaving matrix.
  • the deletion pattern for each interleaved word 44 is offset with respect to the adjacent interleaved word or words within the block.
  • interleaved word 44 a has a deletion/repetition pattern of (10000100) applied to it
  • interleaved word 44 b has a deletion/repetition pattern of (01000010) applied to it, and so on.
  • the details of the deletion/repetition pattern chosen will depend on the size of the interleaving matrix and the amount of deletion or repetition.
  • the interleaving matrix may be rather larger than the simple example shown in FIG. 2 .
  • a suitable deletion/repetition pattern may be obtained by selecting one bit in every P bits, proceeding row by row through the matrix. If P is for example equal to N+1 a pattern similar to that in FIG. 2 part D, with adjacent columns offset by one row, will result.
  • the interleaving circuit 16 , 26 may be more complex than that presented by way of example above.
  • Many alternative interleaving circuits suitable for use in a coding device in accordance with the present invention will be known to the skilled person, for example re-ordering the columns of the interleaving matrix before it is read out.
  • the deletion/repetition pattern will need to be modified to take account of the characteristics of the interleaving circuit.
  • One method of doing this is to determine the maximum deletion/repetition rate (say one bit in every P), and to apply an input data stream to the interleaving circuit in which every Pth bit is set.
  • the output from the interleaving circuit is then a suitable deletion/repetition pattern. It can be seen that the deletion/repetition pattern of FIG. 2 part D could have been obtained by applying to the interleaving circuit 16 , 26 a data stream in which every fifth bit was set.
  • the pattern shown in FIG. 2 part D may represent a maximum amount of puncturing or bit repetition which is allowed. In this case, for lower puncturing or repetition rates it would be possible to select only a proportion of the deletion or repetition bits in order to achieve the desired final bit rate.
  • a puncturing limit may be set as a general limit, or may be determined for each data input channel, even dynamically. In this case, deterministic algorithms or mappings for the exact puncturing can be devised to achieve any particular puncturing rate. Non-uniform puncturing grids may also be considered.
  • a puncturing or repetition pattern may be determined for the maximum interleaving depth, and the pattern for a different coding device within the communications system and having a different interleaving depth may be defined as a reduced number of columns of the larger pattern.
  • Each frame for transmission may then be associated with one of the possible puncturing columns (e.g. 44 a , 44 b ), depending on the interleaving depth, and the particular puncturing or repetition for each frame can be determined by the receiving circuitry simply from knowledge of the interleaving depth of the respective coding circuit, without additional signalling.
  • Convolutional coding has been described as one particular example of coding technique, but other FEC schemes will be apparent to those skilled in the art, such as block coding schemes or turbo coding.
  • One particular application of the invention is for the up-link signal from a mobile telecommunications station to a base station, and in which the mobile station can support different types of data source.
  • a straightforward block interleaver has been described, although various other interleaving options will be apparent to those skilled in the art.
  • the repetition or deletion pattern implemented by the invention takes into account the effect of the interleaving operation so that the deletion/repetition pattern is selected having regard to the original data sequence.
  • a decoding device will also be required as part of a receiving system to form a complete communication system.
  • An example of the decoding device is shown schematically in FIG. 3 , and comprises a data reconstruction circuit 50 which receives a de-multiplexed input. The reconstructed data is supplied to a de-interleaving circuit 52 , and to a channel decoder 54 .
  • the data reconstruction circuit 50 fills in the punctured bits with dummy bits. This enables the de-interleaving to be performed to reconstruct the coded input sequence, but with some dummy bits.
  • the decoding circuit can derive the location of the dummy bits from the known interleaving matrix and the known puncturing pattern, and can thereby ignore the dummy bits during the reconstruction of the original data sequence.
  • the data reconstruction circuit 50 will remove the bit repetitions, but will also use those repetitions to provide an estimation of the value of the respective bit with lower probability of error.
  • a soft combining technique may be used to derive the most probable value for the bit concerned from the plurality of repetitions received.
  • the coding system described may be used only for an up-link transmission in a cellular cordless telephone network, or it may be used for both the up- and down-link transmission channels in such a network.
  • the system may be implemented in the UMTS cordless communications network.
  • the present invention is applicable to radio communication systems such as UMTS.

Abstract

A coding device includes a coding circuit for converting a digital input into a coded output having a greater number of bits than the input, an interleaving circuit for combining a plurality of words of the coded output and producing therefrom a data block having a plurality of the interleaved words, and a puncturing circuit or repeating circuit for puncturing or repeating bits from the data block. The puncturing or repeating circuit uses a deleting or repeating pattern to provide data words for transmission during respective frames of a transmission channel. The deleting or repeating pattern is selected depending upon the characteristics of the coding circuit and of the interleaving circuit. The coding device is for use in a cordless communication system.

Description

  • This invention relates generally to digital communication systems, and more particularly to a communication system using coding of the digital input to generate a coded input having a greater number of bits than the digital input. Forward Error Correction (FEC) operates in this manner, and convolutional coding is one example of forward error correction system.
  • In a convolutional coding system, a digital input is coded by a convolutional coding circuit so that for every number k of bits inputted into the convolutional coding circuit, a greater number n of bits is provided as output. A coding rate for the convolutional coding circuit is defined as the ratio of the number k of input bits to the number n of coded output bits. Thus, for example, the coding rate is 1/2 when for each bit inputted into the convolutional coding circuit, two output bits result. This increase in the number of bits results in a decrease in the signal bit rate.
  • Various conventional convolutional coding algorithms are available, each with a specific coding rate. It may be desirable to adjust the coding rate so that the data rate for the output of the circuit matches the requirements for the remainder of the communication circuitry including the communication channel. For example, in order to increase the code rate it is known to pass the convolutional coded output through a puncturing circuit which includes a deletion pattern for removing selected bits from the convolutional coded output. Alternatively, in order to reduce the code rate it is possible to pass the output through a repetition circuit for repeating selected bits of the output.
  • U.S. Pat. No. 5,668,820 and U.S. Pat. No. 5,511,082 each disclose a digital communication system having a punctured convolutional coding system of the type described above.
  • The invention is particularly concerned with a coding device which has a coded output and in which a number of words of the coded output signal are interleaved. Interleaving is a well known technique used for improving the error performance of a transmission system. There is an increasing requirement for flexibility in communication systems, for example the ability to handle data having different characteristics, such as bit rate, interleaving depth, variable rates of data etc. The use of a conventional variable rate convolutional coding circuit (or other FEC coding circuit) in a coding device having interleaving of the coded output requires the interleaving circuitry to be adaptive to the output bit rate of the convolutional coder. The applicant has therefore appreciated that the interleaving of data should be performed after coding, but before rate matching of the data stream (i.e. before puncturing or bit repetition). However, this introduces the problem that the puncturing or bit repetition performed by the rate matching circuit may not be appropriate for the bit structure generated by the interleaving circuit. For example, there is the possibility that the bits selected for puncturing bits provide information concerning the same or adjacent bits in the digital input. This increases the probability of error in the transmission in respect of that part of the input signal.
  • According to a first aspect of the invention there is provided a rate matching circuit for adjusting the number of bits in a data block, the data block comprising a plurality of interleaved words generated by the action of an interleaving circuit on a coded output generated by the action of a coding circuit on a digital input, the coded output having a greater number of bits than the digital input, the rate matching circuit having means for adjusting the number of bits in the data block using a rate matching pattern to provide data bits for transmission during respective frames of a transmission channel, characterised in that means are provided for selecting the rate matching pattern depending on the characteristics of the coding circuit and of the interleaving circuit.
  • By repeating pattern is meant a pattern (of 1's and 0's) indicating which bits within a respective data block are to be repeated.
  • In accordance with the present invention, the interleaving circuit does not need to be adaptive, because it is selected for interface with a coding circuit having a fixed code rate or a limited number of rates for a variable rate data source. The puncturing circuit or repeating circuit then operates on the interleaved words in order to adjust the output bit rate to be appropriate for transmission over the transmission channel. The deletion or repetition pattern is then selected in such a way that (i) in the case of deletion of bits, the puncturing has least at least detrimental effect to the digital circuit) which has been coded and interleaved before input to the puncturing circuit or (ii) in the case of repetition of bits, the repetition has the most beneficial effect for the output for transmission and is not concentrated at one portion of the digital input.
  • Also, according to the invention, the single puncturing or repeating stage, which effects rate matching of the input signal, can be used to control the transmission quality of the input signal (by altering the forward error correction characteristics) as well as manipulating the output bit rate to be suitable for subsequent transmission, for example to match the maximum bit rate of the transmission channel. This avoids the need for separate rate matching stages for quality of service requirements and for channel capacity consideration.
  • The pattern for each interleaved word within the data block may be offset with respect to the adjacent interleaved word or words within the block. For a block interleaving circuit, the targeting of different bits within adjacent words of the interleaved block is one way of preventing adjacent bits from the coded output word from being targeted by the repetition/deletion pattern.
  • The pattern may be selected as a function of the interleaving depth of the interleaving circuit.
  • The coding preferably comprises convolutional coding, and the deletion or repetition pattern will take into account, for example, the constraint length of the convolutional coding circuit.
  • The rate matching circuit enables the output bit rate to be controlled, and this has particular application when a number of digital inputs are to be multiplexed on to a single carrier. For this purpose, a communication system may comprise a plurality of coding devices, each for coding a respective digital input, and a multiplexer for combining output data words of the coding devices for subsequent transmission by the transmission system on the single transmission channel. The outputs of different coding devices may be selected to have different data rates, with the combined data rate corresponding to the channel capacity of the transmission channel.
  • According to a second aspect of the present invention there is provided a coding device comprising a rate matching circuit made in accordance with the present invention, further comprising an interleaving circuit and a coding circuit.
  • According to a third aspect of the present invention there is provided a decoding device for decoding a signal coded by a coding device of the invention, and comprising a data reconstruction circuit for reconstructing the interleaved words, a de-interleaving circuit and a channel decoder.
  • According to a fourth aspect of the present invention there is provided a communication system comprising a transmitter having a coding device of the invention and a transmission system for transmitting the output data words of the coding device. A receiver of the system includes the decoding device.
  • According to a fifth aspect of the present invention there is provided a method of operating a rate matching circuit to adjust the number of bits in a data block, the data block comprising a plurality of interleaved words generated by the action of an interleaving circuit on a coded output generated by the action of a coding circuit on a digital input, the coded output having a greater number of bits than the digital input, the rate matching circuit adjusting the number of bits in the data block using a rate matching pattern to provide data bits for transmission during respective frames of a transmission channel, characterised by selecting the rate matching pattern depending on the characteristics of the coding circuit and of the interleaving circuit.
  • This invention will now be described by way of example with reference to the accompanying drawings, in which;
  • FIG. 1 represents schematically the components required to implement a transmission system using a coding device;
  • FIG. 2 is a schematic representation of a bit stream passing through the coding device; and
  • FIG. 3 represents schematically the components required to implement a decoding device of the invention.
  • FIG. 1 shows an embodiment of a coding device for coding of a digital input in such a way as to increase the number of bits. This is a standard approach to provide forward error correction capability, and convolutional coding is one common example. As shown in FIG. 1, a channel coding stage (for example convolutional coding) is followed by inter-frame interleaving, and with the interleaved output being subjected to rate matching, which may be puncturing or bit repetition. The puncturing or bit repetition is performed using a deletion/repetition pattern which targets a number of bits from the matrix of the interleaving circuit 16. The pattern is selected as a function of the coding and interleaving operations, in such a way that all bits of the digital input can be derived from non-targeted bits of the output of the interleaving circuit 16.
  • FIG. 1 shows a communication system 10 for the transmission on a single channel of data from two data inputs 12, 22. Each data input is associated with a respective coding device 13, 23 which performs convolutional coding of the input, and also performs rate matching so that the coded data can be modulated on to the available transmission channel which has a maximum channel capacity.
  • Each coding device 13, 23 comprises a respective channel coding circuit 14, 24. The channel coding circuit in the example of FIG. 1 performs convolutional coding of the data input. Standard convolutional coding circuitry is available, which converts a number k of input bits into a greater number n of output bits, with the advantage that forward error correction may be implemented. The coding rate is expressed as a ratio of the number of input bits to the number of output bits of the coding circuit, and standard convolutional coding circuits are available with coding rates of, for example, 1/2, 1/3, 1/4. Convolutional coding circuits generally include shift registers, function generators, a memory and a multiplexer. Each output bit of the convolutional coding circuit comprises a known function executed on a given previous number of bits of the input signal, depending upon the constraint length (the memory length) of the coding circuit. There may be direct mapping of input bits to the output as well as some functional transformations performed on the input bits, to provide the additional error correction capability. Alternatively, there may be no direct mapping of input bits. The output of the coding circuit can be decoded by corresponding decoding circuitry in order to regenerate the original data input as well as additional data suitable for error correction operations.
  • The convolutionally coded output word is supplied to an interleaving circuit 16, 26 for combining a number of the convolutional output words and producing a data block comprising a corresponding number of interleaved words. The simplest form of interleaving circuit comprises a block interleaver which fills an interleaving matrix row by row with a number of input words (corresponding to the interleaving depth) and outputs the data column by column. Other interleaving schemes are also known. This process generally makes the transmission of data less susceptible to errors caused by disruptions to the transmission channel.
  • The interleaved output is supplied to a rate matching circuit 18, 28 which effectively changes the code rate of the convolutional coding circuit, so that the output bit rate is more accurately controllable. This rate matching may comprise puncturing of the interleaved data block (namely removing bits) or may comprise bit repetition. It is known to puncture a convolutional coded output in order increase the code rate, and examples of this are given in U.S. Pat. No. 5,511,082.
  • An advantage of the structure of the coding device described above is that the rate matching operation follows the coding operation, with the result that the interleaving circuit 16, 26 has a constant input bit rate governed by the bit rate of the data source and the reduction in the bit rate resulting from the convolutional coding circuit 14, 24. Consequently, the need for adaptive interleaving circuitry is avoided.
  • The rate matching pattern is selected, in accordance with the invention, depending on the operation of the interleaving circuit and the coding circuit. This will be described in further detail with reference to FIG. 2.
  • The rate matching circuit 18, 28 also permits the channel coding for particular data input to be adjusted to correspond to a particular quality of service requirement, for example concerning the error performance of the transmission channel. The rate matching circuits 18, 28 in combination are also used to ensure that the overall bit rate of the signals, once multiplexed, does not exceed the transmission channel capacity. Thus, a single rate matching operation can be used to achieve specific requirements of a transmission channel relating to an individual data input, as well as ensuring that the combined data information can successfully be transmitted. There will be a trade off between the achievable error performance of the individual data channels and the combined data rate, but these considerations are achieved with a single rate matching circuit for each coding device.
  • The outputs of the two coding devices 13, 23 are multiplexed together by a multiplexing circuit 30 to enable transmission over the single channel. The output of the multiplexing circuit is effectively a frame of data for transmission over the channel, and the frame may correspond in size to one block of interleaved data. The frame data may be interleaved by an intra-frame interleaving circuit 32 for subsequent transmission by a conventional modulation and transmission circuit 34.
  • The operation of the coding device 13, 23 shown in FIG. 1 is shown in greater detail with reference to FIG. 2.
  • FIG. 2 part A shows, for the purposes of illustration, a sequence of input data bits which are supplied to the coding device. These may be arranged as words of a predetermined number of bits or as a continuous data stream as shown.
  • The channel coding circuit 14, 24 applies convolutional coding to the input data stream and generates a bit stream having a greater number of bits. In the example shown in FIG. 2, the convolutional coding circuit converts a data stream of length k to a stream of length n, as shown, which effectively increases the number of bits for transmission by n/k. Interleaving is applied to the coded data words and in the example shown in FIG. 2 the inter-frame interleaving circuit 16 operates on 8-bit words from the coded data stream and applies a block interleaving algorithm with a depth of 4. Thus, the interleaving circuit bitwise fills an interleaving matrix of 4 columns and 8 rows, row by row.
  • The block of data represented in FIG. 2 part C is subjected to a deletion or repetition pattern in order to alter the bit rate so that all signals when multiplexed together produce a data stream which can be handled by the available transmission channel.
  • The applicant has recognised that the deletion or repetition pattern should be selected such that the deleted or repeated bits should not be required to enable all bits from the digital input to be reconstructed.
  • As one example, the assumption can be made that a convolutional coding circuit of low constraint length is employed. The effect of this is that there is almost direct mapping between the coded data and the input data, so that adjacent coded data bits will provide information concerning adjacent bits of the digital input signal. The deletion or repetition of adjacent input bits should be avoided, because (i) in the case of deletion of bits, the probability of error in transmission in respect of that part of the input data is increased, and (ii) in the case of repetition of bits, the extra capacity should be distributed evenly over the input data stream in order for the repetition to improve the overall error performance of the transmission. It will be possible to avoid deletion of adjacent bits in the digital input for low puncturing rates.
  • Simply applying deletion or repetition to the output of the interleaving circuit 16, 26 may give poor results depending on the interleaving depth (number of columns) and deletion/repetition rate. For example, if every fourth bit is deleted or repeated when the block of data represented by FIG. 2 part C is read out (column by column), the result will be to delete or repeat four adjacent bits in the first row (A11, to A14) and in the fifth row (A31 to A34).
  • Consequently, in the deletion/repetition pattern shown in FIG. 2 part D the bits for deletion or repetition have been selected with a maximum of one such bit on each row of the interleaving matrix. In the particular example shown in FIG. 2, the deletion pattern for each interleaved word 44 is offset with respect to the adjacent interleaved word or words within the block. For example, interleaved word 44 a has a deletion/repetition pattern of (10000100) applied to it, whereas interleaved word 44 b has a deletion/repetition pattern of (01000010) applied to it, and so on. By offsetting the pattern in adjacent columns the problem of deleting or repeating adjacent bits is avoided and the pattern is straightforward to implement.
  • In a more general case the details of the deletion/repetition pattern chosen will depend on the size of the interleaving matrix and the amount of deletion or repetition. In particular, the interleaving matrix may be rather larger than the simple example shown in FIG. 2. For a matrix having N columns a suitable deletion/repetition pattern may be obtained by selecting one bit in every P bits, proceeding row by row through the matrix. If P is for example equal to N+1 a pattern similar to that in FIG. 2 part D, with adjacent columns offset by one row, will result.
  • Also, the interleaving circuit 16, 26 may be more complex than that presented by way of example above. Many alternative interleaving circuits suitable for use in a coding device in accordance with the present invention will be known to the skilled person, for example re-ordering the columns of the interleaving matrix before it is read out. Hence the deletion/repetition pattern will need to be modified to take account of the characteristics of the interleaving circuit. One method of doing this is to determine the maximum deletion/repetition rate (say one bit in every P), and to apply an input data stream to the interleaving circuit in which every Pth bit is set. The output from the interleaving circuit is then a suitable deletion/repetition pattern. It can be seen that the deletion/repetition pattern of FIG. 2 part D could have been obtained by applying to the interleaving circuit 16, 26 a data stream in which every fifth bit was set.
  • The pattern shown in FIG. 2 part D may represent a maximum amount of puncturing or bit repetition which is allowed. In this case, for lower puncturing or repetition rates it would be possible to select only a proportion of the deletion or repetition bits in order to achieve the desired final bit rate.
  • A puncturing limit may be set as a general limit, or may be determined for each data input channel, even dynamically. In this case, deterministic algorithms or mappings for the exact puncturing can be devised to achieve any particular puncturing rate. Non-uniform puncturing grids may also be considered.
  • A puncturing or repetition pattern may be determined for the maximum interleaving depth, and the pattern for a different coding device within the communications system and having a different interleaving depth may be defined as a reduced number of columns of the larger pattern. Each frame for transmission may then be associated with one of the possible puncturing columns (e.g. 44 a, 44 b), depending on the interleaving depth, and the particular puncturing or repetition for each frame can be determined by the receiving circuitry simply from knowledge of the interleaving depth of the respective coding circuit, without additional signalling.
  • Although two input channels have been shown in the diagrams as being multiplexed together to be transmitted over a single channel, it is of course possible to multiplex together a much greater number of input channels.
  • Convolutional coding has been described as one particular example of coding technique, but other FEC schemes will be apparent to those skilled in the art, such as block coding schemes or turbo coding.
  • One particular application of the invention is for the up-link signal from a mobile telecommunications station to a base station, and in which the mobile station can support different types of data source. A straightforward block interleaver has been described, although various other interleaving options will be apparent to those skilled in the art. Whatever the interleaving method chosen, the repetition or deletion pattern implemented by the invention takes into account the effect of the interleaving operation so that the deletion/repetition pattern is selected having regard to the original data sequence.
  • A decoding device will also be required as part of a receiving system to form a complete communication system. An example of the decoding device is shown schematically in FIG. 3, and comprises a data reconstruction circuit 50 which receives a de-multiplexed input. The reconstructed data is supplied to a de-interleaving circuit 52, and to a channel decoder 54.
  • For a punctured transmission, the data reconstruction circuit 50 fills in the punctured bits with dummy bits. This enables the de-interleaving to be performed to reconstruct the coded input sequence, but with some dummy bits. The decoding circuit can derive the location of the dummy bits from the known interleaving matrix and the known puncturing pattern, and can thereby ignore the dummy bits during the reconstruction of the original data sequence.
  • For a transmission having repeated bits, the data reconstruction circuit 50 will remove the bit repetitions, but will also use those repetitions to provide an estimation of the value of the respective bit with lower probability of error. A soft combining technique may be used to derive the most probable value for the bit concerned from the plurality of repetitions received.
  • The coding system described may be used only for an up-link transmission in a cellular cordless telephone network, or it may be used for both the up- and down-link transmission channels in such a network. The system may be implemented in the UMTS cordless communications network.
  • The present invention is applicable to radio communication systems such as UMTS.

Claims (17)

1-10. (canceled)
11. A communication system comprising a transmitter and a receiver, the transmitter comprising a digital input, a coding device for generating data bits for transmission, and means for transmitting the data bits during respective frames of a transmission channel, the coding device comprising a coding circuit for generating a coded output having a greater number of bits than the digital input, an interleaving circuit for operating on the coded output to generate a data block comprising a plurality of interleaved words, and a rate matching circuit for adjusting the number of bits in the data block, the rate matching circuit having means for adjusting the number of bits in the data block using a rate matching pattern to provide data bits, and means for selecting the rate matching pattern depending on an associated bit deletion or repetition pattern that is selected to ensure that the deleted or repeated bits of the data block are not required to enable all bits from the digital input to be reconstructed, and the receiver comprising means for receiving the data bits and a data reconstruction circuit having means for adjusting the number of bits in the data block to reverse the action of the rate matching circuit, thereby reconstructing the interleaved words, a de-interleaving circuit having means for generating each of the plurality of interleaved words, and a channel decoder, the data reconstruction circuit having means for selecting the rate matching pattern depending on the characteristics of the coding device.
12. A system as claimed in claim 11, wherein said means for selecting select the rate matching pattern in such a way that all bits of the digital input can be derived from bits in the data block other than the deleted or repeated bits of the data block.
13. A system as claimed in claim 11, wherein the rate matching pattern for each interleaved word within the data block is offset with respect to the rate matching pattern of an adjacent interleaved word or words within the data block.
14. A system as claimed in claim 11, wherein said means for selecting select the rate matching pattern as a function of an interleaving depth of the interleaving circuit.
15. A system as claimed in claim 11, wherein the coding circuit applies convolutional coding and said means for selecting select the rate matching pattern as a function of a constraint length of the convolutional code.
16. A system as claimed in claim 11, wherein the transmitter comprises additional coding devices, each for coding a respective digital input, and a multiplexer for combining output data words of said coding device and said additional coding devices for subsequent transmission by the transmission means on a single transmission channel.
17. A system as claimed in claim 16, wherein the outputs of said coding device and said additional coding devices are selected to have different data rates, the combined data rate corresponding to the channel capacity of the transmission channel.
18. A system as claimed in claim 11, wherein the rate matching pattern forms a matrix including change bits that indicate a change of corresponding bits of said interleaved words within said data block, wherein each row of said matrix includes a maximum of one of said change bits.
19. A system as claimed in claim 11, wherein said coding circuit has one of: (a) a fixed code rate and (b) a predetermined number of rates for a variable data source.
20. A system as claimed in claim 11, wherein said interleaving circuit is not adaptive.
21. A system as claimed in claim 11, wherein said interleaving circuit has a constant input bit rate.
22. A system as claimed in claim 11, wherein said coding circuit has one of: (a) a fixed code rate and (b) a predetermined number of rates for a variable data source, and wherein said interleaving circuit is not adaptive.
23. A system as claimed in claim 11, wherein said rate matching circuit alters a coding rate of said coding circuit according to the bit deletion or repetition pattern.
24. A method of operating a communication system comprising a transmitter and a receiver, the method comprising the transmitter operating on the digital input to generate a coded output having a greater number of bits than the digital input, operating on the coded output to generate a data block comprising a plurality of interleaved words and adjusting the number of bits in the data block using a rate matching pattern to provide data bits for transmission during respective frames of a transmission channel, and the receiver receiving the data bits, adjusting the number of bits in the data block to reverse the action of the rate matching operation, thereby reconstructing the interleaved words, and de-interleaving and decoding the interleaved words to reverse the actions of the interleaving and coding operations, wherein the rate matching pattern is selected depending on an associated bit deletion or repetition pattern that is selected to ensure that the deleted or repeated bits are not required to enable all bits from the digital input to be reconstructed.
25. A system as claimed in claim 11, wherein said rate matching pattern includes change bits for deleting or repeating bits of said data block and said change bits are offset with respect to each other along adjacent columns of a matrix of said rate matching pattern.
26. The method of claim 24, wherein said rate matching pattern includes change bits for deleting or repeating bits of said data block and said change bits are offset with respect to each other along adjacent columns of a matrix of said rate matching pattern.
US11/178,732 1998-07-10 2005-07-11 Coding device and communication system using the same Abandoned US20050246609A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US11/178,732 US20050246609A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
GB9814960.2 1998-07-10
GBGB9814960.2A GB9814960D0 (en) 1998-07-10 1998-07-10 Coding device and communication system using the same
US09/348,958 US6671851B1 (en) 1998-07-10 1999-07-07 Coding device and communication system using the same
US10/702,139 US20040073865A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US11/178,732 US20050246609A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/702,137 Continuation US7634614B2 (en) 2003-01-13 2003-11-04 Integrated-circuit implementation of a storage-shelf router and a path controller card for combined use in high-availability mass-storage-device shelves and that support virtual disk formatting

Publications (1)

Publication Number Publication Date
US20050246609A1 true US20050246609A1 (en) 2005-11-03

Family

ID=10835279

Family Applications (9)

Application Number Title Priority Date Filing Date
US09/348,958 Expired - Lifetime US6671851B1 (en) 1998-07-10 1999-07-07 Coding device and communication system using the same
US10/701,540 Abandoned US20040073864A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US10/701,539 Abandoned US20040073863A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US10/701,538 Abandoned US20040093546A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US10/702,139 Abandoned US20040073865A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US11/178,730 Abandoned US20050246607A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same
US11/178,731 Abandoned US20050246608A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same
US11/178,732 Abandoned US20050246609A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same
US11/178,733 Abandoned US20050246610A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same

Family Applications Before (7)

Application Number Title Priority Date Filing Date
US09/348,958 Expired - Lifetime US6671851B1 (en) 1998-07-10 1999-07-07 Coding device and communication system using the same
US10/701,540 Abandoned US20040073864A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US10/701,539 Abandoned US20040073863A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US10/701,538 Abandoned US20040093546A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US10/702,139 Abandoned US20040073865A1 (en) 1998-07-10 2003-11-05 Coding device and communication system using the same
US11/178,730 Abandoned US20050246607A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same
US11/178,731 Abandoned US20050246608A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same

Family Applications After (1)

Application Number Title Priority Date Filing Date
US11/178,733 Abandoned US20050246610A1 (en) 1998-07-10 2005-07-11 Coding device and communication system using the same

Country Status (9)

Country Link
US (9) US6671851B1 (en)
EP (3) EP1044508B1 (en)
JP (3) JP3897982B2 (en)
KR (3) KR100561933B1 (en)
CN (3) CN100380817C (en)
DE (3) DE69922707T2 (en)
GB (1) GB9814960D0 (en)
TW (1) TW451560B (en)
WO (1) WO2000003486A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070210923A1 (en) * 2005-12-09 2007-09-13 Butler Timothy P Multiple radio frequency network node rfid tag
WO2013160366A1 (en) * 2012-04-27 2013-10-31 Thales System and method for transmitting a plurality of multiservice streams over an hf band

Families Citing this family (56)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB9814960D0 (en) * 1998-07-10 1998-09-09 Koninkl Philips Electronics Nv Coding device and communication system using the same
CN1175582C (en) * 1999-03-19 2004-11-10 西门子公司 Data transmission with interleaving and subsequent rate matching by puncturing or repetition
JP3515701B2 (en) * 1999-03-31 2004-04-05 松下電器産業株式会社 Encoding processing device and repetition method
CA2742096C (en) * 1999-04-13 2015-01-06 Ericsson Ab Rate matching and channel interleaving for a communications system
IL141800A0 (en) * 1999-07-06 2002-03-10 Samsung Electronics Co Ltd Rate matching device and method for a data communication system
IL141743A0 (en) 1999-07-08 2002-03-10 Samsung Electronics Co Ltd Apparatus and method for controlling a demultiplexer and a multiplexer used for rate matching in a mobile communication system
DE10030407B4 (en) * 1999-07-14 2011-09-01 Lg Electronics Inc. Method for optimal rate adaptation in a mobile communication system
DE10038229B4 (en) 1999-08-24 2011-06-09 LG Electronics Inc., Kangnam-gu Method and apparatus for rate adaptation in a mobile communication system
EP1091517A1 (en) 1999-10-07 2001-04-11 Siemens Aktiengesellschaft Communication method and apparatus using punctured or repeated data
DE19953894B4 (en) 1999-11-10 2018-05-09 Ipcom Gmbh & Co. Kg Data transmission method and apparatus
JP3450788B2 (en) * 2000-03-06 2003-09-29 松下電器産業株式会社 Decoding device and decoding processing method
JP3722752B2 (en) * 2000-03-21 2005-11-30 サムスン エレクトロニクス カンパニー リミテッド Coding apparatus and method for code division multiple access communication system
US6856625B1 (en) 2000-05-10 2005-02-15 Lucent Technologies Inc. Apparatus and method of interleaving data to reduce error rate
US6898743B2 (en) * 2000-07-03 2005-05-24 Lg Electronics Inc. Data rate matching method in 3GPP2 system
AU2004200702B2 (en) * 2000-07-05 2007-03-29 Lg Electronics Inc. Method of configuring transmission in mobile communication system
AU768016B2 (en) 2000-07-05 2003-11-27 Lg Electronics Inc. Method of configuring transmission in mobile communication system
US7227851B1 (en) * 2000-11-17 2007-06-05 Lucent Technologies Inc. Transport channel multiplexing system and method
US7437654B2 (en) * 2000-11-29 2008-10-14 Lucent Technologies Inc. Sub-packet adaptation in a wireless communication system
JP3920220B2 (en) * 2001-01-31 2007-05-30 三菱電機株式会社 Communication device
RU2251793C2 (en) * 2001-02-07 2005-05-10 Самсунг Электроникс Ко., Лтд Device and method for generating codes in communications system
DE10121755A1 (en) * 2001-05-04 2002-11-07 Siemens Ag Method for converting input bits to modulation symbols
EP1303052B1 (en) * 2001-10-10 2005-08-03 Matsushita Electric Industrial Co., Ltd. Interleaver pattern modification
EP1513260B1 (en) * 2001-10-10 2007-09-26 Matsushita Electric Industrial Co., Ltd. Interference decorrelation of multiple stream interpolated data
KR100918765B1 (en) * 2001-10-20 2009-09-24 삼성전자주식회사 Apparatus and method for coding and rate mating in cdma mobile communication
JP3629241B2 (en) * 2002-01-30 2005-03-16 松下電器産業株式会社 Rate matching device and rate matching method
DE10207146A1 (en) * 2002-02-20 2003-08-28 Infineon Technologies Ag Hardware circuit for puncturing and repetition coding of data trains
US6862271B2 (en) * 2002-02-26 2005-03-01 Qualcomm Incorporated Multiple-input, multiple-output (MIMO) systems with multiple transmission modes
WO2003085838A1 (en) * 2002-04-05 2003-10-16 Sony Corporation Interleave device, interleave method, deinterleave device, and deinverleave method
JP4847679B2 (en) * 2002-04-08 2011-12-28 シーメンス アクチエンゲゼルシヤフト Method and communication device for matching data rates in a communication device
DE10306171B4 (en) * 2003-02-13 2007-02-08 Siemens Ag Method for setting the transmission powers of two channels of a connection, station and communication system
US7260659B2 (en) * 2003-06-30 2007-08-21 Intel Corporation Rate matching apparatus, systems, and methods
US7418042B2 (en) * 2003-09-17 2008-08-26 Atheros Communications, Inc. Repetition coding for a wireless system
JP4224370B2 (en) * 2003-09-25 2009-02-12 パナソニック株式会社 Input control apparatus and input control method
KR101050615B1 (en) * 2004-01-05 2011-07-19 삼성전자주식회사 Input range adjusting device and method for soft decision decoder
US7685505B2 (en) * 2004-01-20 2010-03-23 Qualcomm Incorporated Coding apparatus, and associated method, for forming a punctured binary convolutional code for use in a radio communication system
KR101123724B1 (en) * 2004-05-18 2012-03-15 에스티 에릭슨 에스에이 Transport channel decoding management in a umts mobile receiver
KR100589680B1 (en) * 2004-07-26 2006-06-19 한국전자통신연구원 Sending method and sending apparatus, receiving method and receiving apparatus for signal of mobile telecommunication system
CN100580659C (en) 2004-09-08 2010-01-13 诺基亚公司 Method and device for processing data word in a plurality of processing cycles
US20090022079A1 (en) * 2005-05-04 2009-01-22 Fei Frank Zhou Method and apparatus for providing enhanced channel interleaving
US20100098929A1 (en) * 2005-07-11 2010-04-22 John Anthony Dispenza Impact resistant composite material
KR101102396B1 (en) * 2006-02-08 2012-01-05 엘지전자 주식회사 Method of matching codeword size and transmitter therefor in mobile communications system
US7627803B2 (en) * 2006-07-05 2009-12-01 Harris Corporation System and method for variable forward error correction (FEC) protection
US8726121B2 (en) 2007-03-27 2014-05-13 Qualcomm Incorporated Circular buffer based rate matching
US8266508B2 (en) * 2007-06-08 2012-09-11 Telefonaktiebolaget L M Ericsson (Publ) Computational efficient convolutional coding with rate matching
US7890834B2 (en) * 2007-06-20 2011-02-15 Motorola Mobility, Inc. Apparatus comprising a circular buffer and method for assigning redundancy versions to a circular buffer
CN101087181B (en) * 2007-07-11 2011-09-21 中兴通讯股份有限公司 A method for removing interweaving and speed match
DE102007043083A1 (en) * 2007-09-10 2009-03-12 Continental Automotive Gmbh Method and device for coding data words
EP2383920B1 (en) 2007-12-20 2014-07-30 Optis Wireless Technology, LLC Control channel signaling using a common signaling field for transport format and redundancy version
JP2011519679A (en) 2008-05-06 2011-07-14 ウィルソン−クック・メディカル・インコーポレーテッド Devices and methods for delivering therapeutic agents
US8180995B2 (en) 2009-01-21 2012-05-15 Micron Technology, Inc. Logical address offset in response to detecting a memory formatting operation
KR100914232B1 (en) * 2009-03-30 2009-08-26 노키아 코포레이션 Processing a data word in a plurality of processing cycles
KR102415609B1 (en) 2013-01-11 2022-06-30 선 페이턴트 트러스트 Data processing, precoding method and communication device
JP6357547B2 (en) * 2014-06-13 2018-07-11 華為技術有限公司Huawei Technologies Co.,Ltd. Transmitter device and receiver device for performing iteration before interleaving and puncturing after interleaving, and method thereof
KR102265052B1 (en) 2014-12-17 2021-06-15 삼성전자주식회사 Interleaving method and apparatus for determing adaptively interleaving depth
US10033483B2 (en) 2015-05-18 2018-07-24 Microsoft Technology Licensing, Llc Adjustable interleaving for communication data
US20170325460A1 (en) * 2016-05-12 2017-11-16 Pbi-Gordon Corporation Stable aqueous herbicidal compositions

Citations (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5204876A (en) * 1991-03-13 1993-04-20 Motorola, Inc. Method and apparatus for providing high data rate traffic channels in a spread spectrum communication system
US5383219A (en) * 1993-11-22 1995-01-17 Qualcomm Incorporated Fast forward link power control in a code division multiple access system
US5511082A (en) * 1994-05-10 1996-04-23 General Instrument Corporation Of Delaware Punctured convolutional encoder
US5581575A (en) * 1993-11-01 1996-12-03 Qualcomm Incorporated Method and apparatus for transmission of variable rate digital data
US5668820A (en) * 1995-01-23 1997-09-16 Ericsson Inc. Digital communication system having a punctured convolutional coding system and method
US5691995A (en) * 1994-04-05 1997-11-25 Sony Corporation Transmission of data by using convolutional coding of different code rates and the encoded data reception including decoding of the received data
US5815514A (en) * 1996-02-09 1998-09-29 Overland Data, Inc. Variable rate bit inserter for digital data storage
US5907582A (en) * 1997-08-11 1999-05-25 Orbital Sciences Corporation System for turbo-coded satellite digital audio broadcasting
US5978365A (en) * 1998-07-07 1999-11-02 Orbital Sciences Corporation Communications system handoff operation combining turbo coding and soft handoff techniques
US6088387A (en) * 1997-12-31 2000-07-11 At&T Corp. Multi-channel parallel/serial concatenated convolutional codes and trellis coded modulation encoder/decoder
US6138261A (en) * 1998-04-29 2000-10-24 Trw Inc. Concatenated coding system for satellite communications
US6170076B1 (en) * 1997-06-25 2001-01-02 Samsung Electronics Co., Ltd. Systematic punctured convolutional encoding method
US6198748B1 (en) * 1997-09-02 2001-03-06 Motorola, Inc. Data transmission system and method
US6307867B1 (en) * 1998-05-14 2001-10-23 Telefonaktiebolaget Lm Ericsson (Publ) Data transmission over a communications link with variable transmission rates
US6671851B1 (en) * 1998-07-10 2003-12-30 Koninklijke Philips Electronics N.V. Coding device and communication system using the same

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5140596A (en) * 1990-02-20 1992-08-18 Eastman Kodak Company High speed encoder for non-systematic codes
GB2340003B (en) * 1994-12-15 2000-03-22 Inmarsat Ltd Multiplex communication
MY123040A (en) * 1994-12-19 2006-05-31 Salbu Res And Dev Proprietary Ltd Multi-hop packet radio networks
JP3169522B2 (en) * 1995-01-19 2001-05-28 沖電気工業株式会社 Data receiving device
US5671156A (en) * 1995-03-31 1997-09-23 Lucent Technologies Inc. Transmission method and system for JPEG images
ES2198452T3 (en) * 1995-06-12 2004-02-01 Siemens Aktiengesellschaft PROCEDURE AND INSTALLATION OF CODIFICATION FOR THE SECURE TRANSMISSION OF DATA BY MEANS OF CODIFICATION OF MULTIPLE COMPONENTS.
JP3399725B2 (en) * 1995-10-31 2003-04-21 富士通株式会社 Multimedia wireless communication system for asynchronous transfer mode
US5926500A (en) * 1996-05-28 1999-07-20 Qualcomm Incorporated Reduced peak-to-average transmit power high data rate CDMA wireless communication system
US6161209A (en) * 1997-03-28 2000-12-12 Her Majesty The Queen In Right Of Canada, As Represented By The Minister Of Industry Through The Communications Research Centre Joint detector for multiple coded digital signals
US6181711B1 (en) * 1997-06-26 2001-01-30 Cisco Systems, Inc. System and method for transporting a compressed video and data bit stream over a communication channel
US6175590B1 (en) * 1997-08-08 2001-01-16 Qualcomm Inc. Method and apparatus for determining the rate of received data in a variable rate communication system
US6405338B1 (en) * 1998-02-11 2002-06-11 Lucent Technologies Inc. Unequal error protection for perceptual audio coders
KR100338662B1 (en) * 1998-03-31 2002-07-18 윤종용 Apparatus and method for communication channel in a cdma communication system
KR100295760B1 (en) * 1998-12-31 2001-09-06 윤종용 Apparatus and method for convolutional decoding in digital system
US6385752B1 (en) * 1999-06-01 2002-05-07 Nortel Networks Limited Method and apparatus for puncturing a convolutionally encoded bit stream
US6516437B1 (en) * 2000-03-07 2003-02-04 General Electric Company Turbo decoder control for use with a programmable interleaver, variable block length, and multiple code rates

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5204876A (en) * 1991-03-13 1993-04-20 Motorola, Inc. Method and apparatus for providing high data rate traffic channels in a spread spectrum communication system
US5581575A (en) * 1993-11-01 1996-12-03 Qualcomm Incorporated Method and apparatus for transmission of variable rate digital data
US5383219A (en) * 1993-11-22 1995-01-17 Qualcomm Incorporated Fast forward link power control in a code division multiple access system
US5691995A (en) * 1994-04-05 1997-11-25 Sony Corporation Transmission of data by using convolutional coding of different code rates and the encoded data reception including decoding of the received data
US5511082A (en) * 1994-05-10 1996-04-23 General Instrument Corporation Of Delaware Punctured convolutional encoder
US5668820A (en) * 1995-01-23 1997-09-16 Ericsson Inc. Digital communication system having a punctured convolutional coding system and method
US5815514A (en) * 1996-02-09 1998-09-29 Overland Data, Inc. Variable rate bit inserter for digital data storage
US6170076B1 (en) * 1997-06-25 2001-01-02 Samsung Electronics Co., Ltd. Systematic punctured convolutional encoding method
US5907582A (en) * 1997-08-11 1999-05-25 Orbital Sciences Corporation System for turbo-coded satellite digital audio broadcasting
US6198748B1 (en) * 1997-09-02 2001-03-06 Motorola, Inc. Data transmission system and method
US6088387A (en) * 1997-12-31 2000-07-11 At&T Corp. Multi-channel parallel/serial concatenated convolutional codes and trellis coded modulation encoder/decoder
US6138261A (en) * 1998-04-29 2000-10-24 Trw Inc. Concatenated coding system for satellite communications
US6307867B1 (en) * 1998-05-14 2001-10-23 Telefonaktiebolaget Lm Ericsson (Publ) Data transmission over a communications link with variable transmission rates
US5978365A (en) * 1998-07-07 1999-11-02 Orbital Sciences Corporation Communications system handoff operation combining turbo coding and soft handoff techniques
US6671851B1 (en) * 1998-07-10 2003-12-30 Koninklijke Philips Electronics N.V. Coding device and communication system using the same
US20040073864A1 (en) * 1998-07-10 2004-04-15 Moulsley Timothy J. Coding device and communication system using the same

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070210923A1 (en) * 2005-12-09 2007-09-13 Butler Timothy P Multiple radio frequency network node rfid tag
WO2013160366A1 (en) * 2012-04-27 2013-10-31 Thales System and method for transmitting a plurality of multiservice streams over an hf band
FR2990093A1 (en) * 2012-04-27 2013-11-01 Thales Sa SYSTEM AND METHOD FOR TRANSMITTING MULTIPLE HF TAND MULTISERVICE FLOWS
US20150124721A1 (en) * 2012-04-27 2015-05-07 Thales System and method for transmitting a plurality of multi-service streams over an hf band
US9723515B2 (en) * 2012-04-27 2017-08-01 Thales System and method for transmitting a plurality of multi-service streams over an HF band

Also Published As

Publication number Publication date
WO2000003486A1 (en) 2000-01-20
GB9814960D0 (en) 1998-09-09
CN1161887C (en) 2004-08-11
US20050246610A1 (en) 2005-11-03
US20040073863A1 (en) 2004-04-15
JP3897982B2 (en) 2007-03-28
US20040073864A1 (en) 2004-04-15
TW451560B (en) 2001-08-21
CN100380817C (en) 2008-04-09
DE69922707T2 (en) 2005-12-22
DE69908293T2 (en) 2004-03-25
KR100561933B1 (en) 2006-03-20
KR100533592B1 (en) 2005-12-06
KR20040073536A (en) 2004-08-19
KR20040096517A (en) 2004-11-16
DE69916903T2 (en) 2005-04-07
KR100533594B1 (en) 2005-12-06
US20050246608A1 (en) 2005-11-03
EP1044508A1 (en) 2000-10-18
EP1227596A2 (en) 2002-07-31
EP1227596B1 (en) 2004-12-15
JP3894947B2 (en) 2007-03-22
CN1273713A (en) 2000-11-15
CN100423455C (en) 2008-10-01
EP1241796A2 (en) 2002-09-18
US20050246607A1 (en) 2005-11-03
JP2006320008A (en) 2006-11-24
JP2006295975A (en) 2006-10-26
DE69908293D1 (en) 2003-07-03
DE69916903D1 (en) 2004-06-03
US20040093546A1 (en) 2004-05-13
EP1241796B1 (en) 2004-04-28
US6671851B1 (en) 2003-12-30
DE69922707D1 (en) 2005-01-20
KR20010023748A (en) 2001-03-26
EP1241796A3 (en) 2002-10-16
JP3894946B2 (en) 2007-03-22
US20040073865A1 (en) 2004-04-15
CN1558559A (en) 2004-12-29
EP1227596A3 (en) 2002-10-16
EP1044508B1 (en) 2003-05-28
JP2002520938A (en) 2002-07-09
CN1558558A (en) 2004-12-29

Similar Documents

Publication Publication Date Title
US6671851B1 (en) Coding device and communication system using the same
KR100407342B1 (en) Apparaus and method for communication in cdma communication system
EP1100204B1 (en) Multiplexing method and multiplexing device, and data signal transmission method and data signal transmission device
DE29924886U1 (en) Channel coding device for communication system
JP2000068863A (en) Coder and its method
JP4741130B2 (en) Method and apparatus for transmitting data frames and method and apparatus for adapting data rate
AU756591B2 (en) A communication apparatus and method for a cdma communication system
EP0912009A2 (en) Date rate conversion using repetition codes
KR100575925B1 (en) Rate Matching Method and Apparatus for Multiplexing Channels with Different Transmission Time Intervals in Communication Systems
US20020031168A1 (en) Method and apparatus for flexible data rate matching by symbol insertion for a data communication system
US20050110286A1 (en) System and method of generating an optimally-repeated turbo code stream
KR20010018890A (en) Parameter Optimization method of Parallel Puncturing Algorithm
KR100404181B1 (en) Method and Apparatus of Rate Matching for Channelization Code On up-link

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION