Abstract: A method and apparatus encode a source data stream via convolutional encoding or selected encoding scheme. Plural encoded data streams are interleaved and transmitted on a transmission channel. Data groups generated via convolutional or selected encoding are interleaved via time-interleaving functions to disperse selected bits within puncture groups of the data groups, bits in between data groups, and bits in selected sets of data groups to facilitate reconstruction of the source data stream from at least a portion of the interleaved data stream received on at least one transmission channel. The time-interleaving functions are selected to facilitate reconstruction of the source data stream from one transmission channel following continuous blockage. Subsets of bits of puncture groups are selected to allow reconstruction of the source data stream from more than one of plural transmission channels using a minimum number of subsets.

Abstract: An apparatus and method for encoding a channel in a communication system using a Low-Density Parity-Check (LDPC) code. The method includes determining a number of parity bits to be subjected to puncturing; dividing the parity bits at predetermined intervals, and determining a number of puncturing bits, which are subjected to puncturing within the predetermined intervals; determining positions of puncturing parity bits corresponding to the determined number of puncturing bits; and repeatedly performing puncturing on the puncturing parity bits corresponding to the determined positions at the predetermined intervals. The predetermined intervals are determined by dividing a length of parity bits by a length of one column group in a parity-check matrix.

Abstract: Systems and methods for providing relay in communications systems are disclosed. The relay may receive signals from user equipments (UEs) transmitting coded signals. The relay may receive turbo coded signals from the UEs. The relay station may encode a network channel for transmission to the base station using a recursive systematic convolutional (“RSC”) code. The use of RSC for the network code enables the base station to form as well a distributed turbo code as one can with the UE coded signals. In this manner the base station may recover the signal estimates for the UE signals with lower error probability when estimates at the relay station include errors due to imperfect reception. The use of the relay station and the RSC network code enables the base station to receive UE signals with lower error probability even when the transmission path from the UE is imperfect.

Abstract: A decoding circuit includes: a level adjuster with pattern dependency arranged to generate a plurality of Viterbi target levels with pattern dependency; and a Viterbi decoder arranged to perform Viterbi decoding according to the Viterbi target levels with pattern dependency. A decoding circuit includes a Viterbi decoder arranged to perform Viterbi decoding, and the Viterbi decoder includes a branch metric generator arranged to generate a plurality of branch metrics with pattern dependency according to an input of the Viterbi decoder and a plurality of Viterbi target levels with pattern dependency. In particular, the branch metric generator includes: a plurality of branch metric generation paths arranged to generate a plurality of intermediate values according to the input of the Viterbi decoder and the Viterbi target levels with pattern dependency, respectively; and a selection unit for selecting a portion of the intermediate values as the branch metrics with pattern dependency.

Abstract: A method of recovering data in a line signal which is predicted to be subjected to repetitive noise impulses, the line signal comprising a series of data frames, the method comprising the steps of: predicting a group comprising one or more frames in said line signal which are expected to be corrupted by a noise signal; blanking said group of one or more frames which are predicted to be corrupted; determining the preceding and succeeding frames adjacent to said group; and including in each said group of one or more frames one or more parity blocks wherein if said noise signal deviates from its predicted timing interval or duration and corrupts the data carried in one or more of said frames adjacent to said group, the corrupted data is recovered using one or more of said parity blocks of said group of blanked frames and the other one of said adjacent frames.

Abstract: A retransmission method based on Low Density Parity Check (LDPC) and devices thereof are provided in embodiment of this present invention, so as to increase the system throughput. In the present invention, when retransmission is needed, the partial bits in the information sequence to be retransmitted are replaced by the prior information that the transmitter and the receiver both have know, with the replaced information sequence is LDPC coded, LDPC check sequence is obtained and is sent to the receiver. After receiving the LDPC check sequence, the receiver decodes the information sequence including the prior information with the LDPC check sequence. If the decoding is successful, after removing the prior information from the decoded information sequence, the receiver refills the decoded bits in a previous received information sequence, and performs decoding again with an LDPC check sequence corresponding to the previous received information sequence and obtains a complete information sequence.

Abstract: A wireless device for implementing Incremental Redundancy (IR) operations includes an IR memory dedicated to storing data related to the IR operations. The IR memory includes a Type I IR memory adapted to store IR status information of a Radio Link Control (RLC) data block and a Type II IR memory adapted to store the RLC data block.

Abstract: The present invention relates to a method for transmitting a signal in a wireless communication system. The method includes channel coding a data stream using a first turbo encoded puncture pattern, and channel coding the data stream using a second turbo encoded puncture pattern. Preferably, the first turbo encoded puncture pattern is a turbo encoded puncture pattern of a first local operator infrastructure (LOI) and the second turbo encoded puncture pattern is a turbo encoded puncture pattern of a second LOI that neighbors the first LOI.

Abstract: Systems and techniques for transmitting an Irregular Systematic with Serially Concatenated Parity (Ir-S-SCP) are described. The techniques include generating an outer code comprising a plurality of bits using systematic bits as input, repeating the plurality of bits of the outer code a pre-determined number of times to generate at least a first set of repeated bits and a second set of repeated bits, serializing the generated sets of repeated bits, wherein each generated set is serialized in parallel with another generated set, interleaving the generated sets of repeated bits, generating an inner code, the inner code generated in part based on the interleaved sets, puncturing the inner code to output parity bits, wherein the puncturing is non-uniform and the puncturing is based at least in part on an incremental redundancy scheme, and transmitting the parity bits, wherein the transmitted parity bits and the systematic bits comprise the Ir-S-SCP code.

Abstract: Header encoding for SC and/or OFDM signaling using shortening, puncturing, and/or repetition in accordance with encoding header information within a frame to be transmitted via a communication channel employs different respective puncturing patterns as applied to different portions thereof. For example, a first puncturing pattern is applied to a first portion of the frame, and a second puncturing pattern is applied to a second portion of the frame (the second portion may be a repeated version of the first portion). Shortening (e.g., by padding 0-valued bits thereto) may be made to header information bits before they undergo encoding (e.g., in an LDPC encoder). One or both of the information bits and parity/redundancy bits output from the encoder undergo selective puncturing. Moreover, one or both of the information bits and parity/redundancy bits output from the encoder may be repeated/spread before undergoing selective puncturing to generate a header.

Abstract: Variable modulation within combined LDPC (Low Density Parity Check) coding and modulation coding systems. Variable modulation encoding of LDPC coded symbols is presented. In addition, LDPC encoding, that generates an LDPC variable code rate signal, may also be performed as well. The encoding can generate an LDPC variable code rate and/or modulation signal whose code rate and/or modulation may vary as frequently as on a symbol by symbol basis. Some embodiments employ a common constellation shape for all of the symbols of the signal sequence, yet individual symbols may be mapped according different mappings of the commonly shaped constellation; such an embodiment may be viewed as generating a LDPC variable mapped signal. In general, any one or more of the code rate, constellation shape, or mapping of the individual symbols of a signal sequence may vary as frequently as on a symbol by symbol basis.

Abstract: Methods and apparatus for enabling effective decoding of rate-compatible punctured codes are presented herein. A puncturing component can derive one or more partial puncturing patterns and corresponding decoding matrices/graphs that represent punctured code from a parity check matrix/graph of a mother code and a puncturing pattern specified for the mother code. Further, a rowcombining component can combine rows of the parity check matrix/graph based on the derived one or more partial puncture patterns. Further, the rowcombining component can create at least one decoding matrix/graph to represent the punctured code based on the combined rows. In addition, a selection component can select a decoding matrix/graph from the created at least one decoding matrix/graph that does not contain a girth-4 cycle.

Abstract: A code encoding apparatus includes a delay circuit and a code generator. The delay circuit generates delayed information based on p-bit input information received in parallel. The delayed information is generated according to a clock. The code generator generates n·p-bit code based on at least one of the input information and the delayed information, where n is a rational number.

Abstract: A transmission device in a communication system where a systematic code obtained by systematic encoding of information bits into which dummy bits are inserted and by deletion of the dummy bits from the results of the systematic encoding is transmitted. The transmission device inserts dummy bits into information bits based on an interleaving pattern of an interleaving portion in a turbo encoder; performs systematic encoding of the information bits into which the dummy bits are inserted, and then deletes the dummy bits from the results of the systematic encoding to generate a systematic code; and transmits the systematic code. By considering the interleaving pattern, original bit positions, which, after interleaving, exists within the ranges of stipulated numbers of bits at the beginning and at the end, are determined in advance, and the dummy bit insertion portion executes control so as not to insert dummy bits into the original bit positions.

Abstract: In one implementation, a decoding architecture is provided that includes an input buffer configured to receive and store one or more codewords to be processed, and a decoder coupled to the input buffer. The decoder is configured to receive a first codeword and a second codeword from the input buffer, and simultaneously process the first codeword and the second codeword such that each of the first codeword and the second codeword is processed only for a minimum amount of time for the first codeword or the second codeword to become decoded. The input buffer is further configured to load a third codeword into the decoder responsive to the first codeword or the second codeword being decoded.

Abstract: A method for creating cyclic permutation matrices P (810), with an arbitrary size Z×Z set by a parameter Z5 and which are used to create one or more LDPC related matrices in OFDMA systems, comprising: defining an integer value Z; creating an initial matrix (810); creating a matrix (810) by using cyclic shifts to each row; repeating stage 3, up to Z?2 times as required, thus creating up to Z?2 matrices: P(o) . . . P(Z?I); creating an additional stairs matrix P(st). A method for using cyclic per-mutation matrixes P (840), with a fixed size Z×Z set by a parameter Z, and which are used to create one or more LDPC related matrices (820) in OFDMA systems, comprising: defining an integer value Z; storing in memory means an initial matrix (810) and its cyclic shifts permutations (840), thus keeping memory means matrices: P(o) . . . P(Z?I); storing an additional stairs matrix P(st) (840); using these matrices (810) to create LDPC related matrices (840) or LDPC operations.

Abstract: Methods and apparatuses for encoding data in a wireless communication system including receiving an information sequence, and encoding the received information sequence to generate three subblocks of sequences. A first subblock of the three subblocks is the information sequence, a second subblock of the three subblocks is an encoded sequence, and a third subblock of the three subblocks is an interleaved and encoded sequence. The method further includes permuting the three subblocks of encoded sequences separately by subblock permutation, and continuously mapping the three subblocks into a circular buffer, the circular buffer including a first part, a second part, and a third part.

Abstract: A method of transmitting data by transmitting apparatus, that includes controlling generation of bit sequences to adjust an occupation rate of systematic bits in a first data block including systematic bits and parity bits, which is obtained by encoding first data in a first encoding process, and is equal or closer to an occupation rate of systematic bits in a second data block including systematic bits and parity bits, which is obtained by encoding second data in a second encoding process, and to adjust an occupation rate of parity bits in the first data block that is closer to an occupation rate of parity bits in the second data block, in regard to first bit positions of the bit sequences generated using bits included in the first and second data blocks and performs multi-level modulation for transmission based on the generated bit sequences.

Abstract: A method and apparatus are disclosed for forming a frame of interleaved information bits in a communication system, where the decoding of the frame of interleaved information bits may begin before all of the bits in the frame are received. An exemplary interleaved frame is formed by receiving a frame of N information bits within the communication system; encoding the information bits at a code rate R to provide encoded bits; and arranging the encoded bits into a frame of N/R coded bits, wherein a plurality of puncturing patterns pi are applied to the frame of N/R coded bits such that a code rate of R/ai is produced for each of the plurality of puncturing pattern pi. The arrangement of encoded bits involves applying a puncturing pattern pj to the encoded bits; and applying a permutation function to the punctured encoded bits to generate a fractional section of the frame of N/R coded bits. The fractional section of the frame of N/R coded bits comprises N/R*aj bits.

Abstract: In one embodiment, the present patent application comprises a method and apparatus to generate low rate protographs from high rate protographs, comprising copying a base graph; permuting end points of edges of a same type in copies of the base graph to produce a permuted graph; and pruning systematic input nodes in the permuted graph and the edges connected to them. In another embodiment, the present patent application comprises a method and apparatus to generate high-rate codes from low-rate codes, comprising puncturing a subset of codeword bits, wherein the step of puncturing a subset of codeword bits comprises regular-irregular puncturing the subset of codeword bits, random puncturing variable nodes, or progressive node puncturing variable nodes to obtain a desired code from a preceding code.

Abstract: Cooperative concatenated coding techniques are provided for wireless communications between at least two users and a base station. A network system employing cooperative concatenated coding includes cooperating user devices each configured to encode and transmit at least a portion of a joint message. The joint message includes at least a portion of a first message from a first cooperating user device and at least a portion of a second message from a second cooperating user device. An embodiment includes encoding a first message from a first cooperating user, receiving a second message from a second cooperating user and decoding the second message. The methodology also includes re-encoding at least a portion of the decoded message with at least a portion of the first message to form a combined message, and then transmitting at least a portion of the combined message.

Abstract: There is provided with a transmitter including: an input unit configured to input a data symbol sequence; a block generator configured to sequentially generate data blocks each including a plurality of data symbols by using the data symbol sequence; an addition unit configured to add a duplicate of h data symbols at an end of a first data block to a head of the first data block as a cyclic prefix to obtain a first data block with the cyclic prefix; and a transmission unit configured to transmit the first data block with the cyclic prefix, wherein the block generator uses, as k data symbols that precede the h data symbols at the end of the first data block, a duplicate of k data symbols at an end of a second data block that precedes the first data block.

Abstract: The subject matter disclosed herein provides methods and systems for converting fixed-point soft bit values, provided by a demapper, into floating-point soft bits values. In one aspect, there is provided a method. The method may include receiving, from a demapper, soft bits formatted as a fixed-point value. Moreover, the soft bits may be converted from the fixed-point value to a floating-point value. The floating-point value is punctured to remove a bit. The converted soft bits are provided to a buffer to enable decoding of the buffered soft bits. Related systems, apparatus, methods, and/or articles are also described.

Abstract: Disclosed is a transmission device in a communication system in which a systematic code obtained by systematic encoding of information bits into which dummy bits are inserted and by deleting the dummy bits from the results of the systematic encoding is transmitted and, on the receiving side, the dummy bits which had been deleted on the transmitting side are inserted into the received systematic code, and then decoding is performed. In this transmission device, a dummy bit insertion portion decides the size of the dummy bits to be inserted into the information bits based on a specified code rate or based on the physical channel transmission rate, and uniformly inserts dummy bits of this size into the information bits; a systematic code generation portion performs systematic encoding of the information bits into which the dummy bits are inserted, and deletes the dummy bits from the results of the systematic encoding to generate a systematic code, which is transmitted.

Abstract: A method and apparatus for decoding a signal in a communication system. The method and apparatus includes receiving a punctured codeword including information bit nodes and unpunctured parity bit nodes; analyzing the unpunctured parity bit nodes, and detecting at least one first block including the unpunctured parity bit nodes among a plurality of blocks each including parity bit nodes having the same importance among all parity bit nodes; and recovering said all parity bit nodes by serial-decoding parity bit nodes included in the first block according to decoding priorities of parity bit nodes, determined by reflecting the first block in a predetermined decoding priority determining algorithm.

Abstract: A decoding apparatus includes a memory and a receiving unit and is adapted to decode data in units of codewords each including a parity part. The memory has a storage capacity capable of storing at least data with a length equal to the length of one codeword. The receiving unit receives, as received values, elements of a codeword in a bit-interleaved form, performs bit deinterleaving and parity permutating on the received values, and stores the resultant received values in the memory.

Abstract: Method and system for data-rate control by randomized bit-puncturing in communication systems. An encoder encodes at least one information bit thereby generating a group of encoded bits or an encoded frame. The encoder may be any type of encoder including a turbo encoder, an LDPC (Low Density Parity Check) encoder, a RS (Reed-Solomon) encoder, or other type of encoder. Any sub-portion of an encoded frame generated by such an encoder can be viewed as being a group of encoded bits. If the encoded frame is sub-divided into multiple groups of bits, each group can under processing in accordance with the means presented herein to effectuate rate matching. Based on a number of bits to be punctured from the group or frame generated by the encoder, a set of pointers and random-generated displacements is used to generate addresses for bits in the group or frame to be transmitted or punctured.

Abstract: To improve performance of a decoder even in a system with the coder configuration determined by inserting a doping bit sequence known between a transmission apparatus and a reception apparatus in an information bit sequence to transmit, the transmission apparatus is a transmission apparatus that transmits radio signals to the reception apparatus, and is provided with a doping section 23 that inserts a doping bit sequence which is known between the transmission apparatus and the reception apparatus in an information bit sequence to transmit to the reception apparatus, coding sections 11a, 11b that performerror-correcting coding on a bit sequence with the doping bit sequence inserted therein, a puncturing section that performs puncturing on a bit sequence subjected to the error-correcting coding, and a wireless transmission section 24 that transmits a bit sequence subjected to the puncturing.

Abstract: A rate adjustment apparatus includes a calculating section to calculate a number of outputs where bits of input data are sequentially output when a number of times of puncturing of the input data to be punctured is smaller than a number of remaining bits after puncturing, and a processing section to sequentially output bits of the input data and puncture the bits of the input data based on the number of outputs calculated by the calculating section.

Abstract: Virtual limited buffer modification for rate matching. A reduced-size memory module is employed within a communication device to assist in storage of log-likelihood ratios (LLRs) employed in accordance with turbo decoding. This architecture is also applicable to other types of error correction code (ECC) besides turbo code as well. The memory size is selected to match the number of coded bits (e.g., including information bits and redundancy/parity bits) that is included within a transmission. The received signals may be various transmissions made in accordance with hybrid automatic repeat request (HARQ) transmissions. When the LLRs calculated from a first HARQ transmission is insufficient to decode, those LLRs are selectively stored in the memory module. When LLRs corresponding to a second HARQ transmission is received, LLRs corresponding to both the first HARQ transmission and the second HARQ transmission are passed from the memory module for joint use in decoding.

Abstract: A data communication method for puncturing of parity bits defining all parity data for a minimum code rate generated by an encoder is disclosed. The method initializes an accumulator associated with the parity bits to an initial value, and for each parity bit increments the accumulator by a increment value and determines if the accumulator has overflowed. If the accumulator overflows, at least one of the parity bits is selected for transmission.

Abstract: An approach is provided for encoding information bits to output a coded signal using turbo code encoding with a low code rate.

Abstract: In one embodiment, the present patent application comprises a method and apparatus to generate low rate protographs from high rate protographs, comprising copying a base graph; permuting end points of edges of a same type in copies of the base graph to produce a permuted graph; and pruning systematic input nodes in the permuted graph and the edges connected to them. In another embodiment, the present patent application comprises a method and apparatus to generate high-rate codes from low-rate codes, comprising puncturing a subset of codeword bits, wherein the step of puncturing a subset of codeword bits comprises regular-irregular puncturing the subset of codeword bits, random puncturing variable nodes, or progressive node puncturing variable nodes to obtain a desired code from a preceding code.

Abstract: A system includes a header stripper configured to strip header data from a plurality of legacy system frames. Each of the plurality of legacy system frames (i) being in accordance with a legacy system frame format and (ii) including a header block and a traffic channel block. A first encoder is configured to encode speech data for a plurality of slots of the traffic channel blocks. A second encoder is configured to encode the stripped header data as a frame header. A combiner is configured to combine the frame header and the encoded speech data to generate a frame. A segmenter segments the frame into a plurality of segments. A transmitter is configured to transmit the plurality of segments as traffic channel data in accordance with the legacy system frame format.

Abstract: A method and apparatus for buffering an encoded signal having a plurality of codewords for a turbo decoder is provided. The method comprises de-interleaving each sub-block of the codeword received at the turbo-decoder; and storing LLRs of the de-interleaved codeword LLRs into an input buffer. Thereafter, each of punctured locations, if any, in the de-interleaved codeword is indicated to a read logic for enabling the latter to fill in each of those locations with a pre-determined LLR value as and when a read request corresponding to one of those locations arrives. This method obviates the need for storing the pre-determined LLRs at the punctured locations into the input buffer and thereby cuts down the input latency of turbo decoder significantly for higher code rates.

Abstract: A method for a Code Division Multiple Access telecommunication system implemented by a mobile station. The Code Division Multiple Access telecommunication system implementing a phase of communicating data conveyed by a plurality of transport channels. The Code Division Multiple Access telecommunication system includes at least one base station and at least the mobile station with the mobile station performing a plurality of rate matching steps. Each of the rate matching steps executing a transformation of an input block of an initial size into an output block of a final size by puncturing or repeating at least one bit of the input block.

Abstract: A device including a minimal trellis decoder is disclosed. The device can receive an encoded codeword, which the minimal trellis decoder efficiently decodes. In a specific implementation, the device can include a Bluetooth receiver that, in operation, receives an encoded codeword from a Bluetooth transmitter, which is decoded by the minimal trellis decoder.

Abstract: A method of encoding non-key frame data is disclosed. The method includes forming a bit stream from the data by arranging the bits from the data in a known order. The bit stream is interleaved to form an interleaved bit stream, and parity bits are generated for each of the bit stream and the interleaved bit stream. Bits are deleted from the generated parity bits dependant upon the bit plane of those bits, and an encoded bit stream is created from the remaining parity bits.

Abstract: A method for retransmission of erroneous data in a communications system includes receiving data blocks at a receiver that have been generated in a transmitter by the use of an error correcting code. The received data blocks are decoded by a linear programming algorithm. One or more symbols in the decoded data block are identified by subjecting the symbols in the decoded data block to an integrality criterion. A retransmission of a part of the data block based on the one or more identified symbols is then initiated.

Abstract: In a frame sync method, a receiver searches for the presence of an N-symbol long unique word pattern. For each possible frame sync detected, the receiver proceeds to demodulation and FEC processing. After each iteration of the FEC decoder, the detected unique word pattern is compared to the expected one and the frame sync is detected if the number of unique word errors has decreased.

Abstract: A method and apparatus for transmitting a broadcast physical layer packet in a mobile communication system supporting multi-slot transmission and hybrid Automatic Repeat Request (H-ARQ) are provided. The method comprises initially transmitting the broadcast physical layer packet according to a fixed transmission format for at least one first slot interval and retransmitting the broadcast physical layer packet for at least one second slot interval using a variable transmission format different from the transmission format used in the first slot interval.

Abstract: Detecting, avoiding and/or correcting problematic puncturing patterns in parity bit streams used when implementing punctured Turbo codes is achieved without having to avoid desirable code rates. This enables identification/avoidance of regions of relatively poor Turbo code performance. Forward error correction comprising Turbo coding and puncturing achieves a smooth functional relationship between any measure of performance and the effective coding rate resulting from combining the lower rate code generated by the Turbo encoder with puncturing of the parity bits. In one embodiment, methods to correct/avoid degradations due to Turbo coding are implemented by puncturing interactions when two or more stages of rate matching are employed.

Abstract: Disclosed is an encoding processing apparatus in which reception precision characteristics are improved by specially adapting puncture processing in respect of the code words for each encoding system. A puncture section (130) switches between a puncture pattern for a first code word partial sequence obtained on the basis of the head and tail in a fixed information block, and a puncture pattern for a second code word partial sequence obtained on the basis of the middle portion, excluding the head and tail. Also, the puncture section (130) receives the number of retransmissions of information from a retransmission control section (180) and switches the puncture pattern for the second code word partial sequence in accordance with the number of retransmissions. In addition, the puncture section (130) prioritising systematic bits over parity bits when puncturing the first code word partial sequence.

Abstract: Optimal circular buffer rate matching for turbo code. An offset index, ?, of 3 and a skipping index, ?, of 3 is employed in accordance with circular buffer rate matching. This allows less puncturing of information bits and more puncturing of redundancy/parity bits (e.g., which can provide for a higher rate). Multiple turbo codes may be generated from a mother code such that each generated turbo code can be employed to encode information bits. For example, a first turbo coded signal can be generated using a first turbo code generated from the mother code, and a second turbo coded signal can be generated using a second turbo code generated from the mother code. Any of these turbo coded signal can be decoded using parallel decoding processing or a single turbo decoder (when each turbo coded signal undergoes processing to transform it back to the mother code format).

Abstract: Turbo coding having combined turbo de-padding and rate matching de-padding. An approach is presented by which a singular module is operable to perform both zero bit de-padding and dummy bit de-padding in accordance with turbo encoding. Zero padding can be performed on an input information stream before undergoing turbo encoding. One or more of the 3 outputs from the turbo encoding module (e.g., systematic bits, parity 1 bits, and parity 2 bits) may then undergo dummy bit padding as well. Thereafter, these 3 streams (some or all of which may have undergone dummy bit padding) undergo sub-block interleaving. After all of these operations have taken place, a singular combined de-padding module that can be employed to perform de-padding any zero padded bits and any dummy padded bits from each of the three streams that have undergone the sub-block interleaving.

Abstract: An apparatus and method for receiving data when an HS-SCCH is not used in a mobile communication system are provided. In the apparatus and method, retransmission data is received, parameters including information about initial transmission data are acquired from the retransmission data, the initial transmission data is retrieved from a second-rate dematching input buffer based on the information about the initial transmission data, second-rate dematching is performed on the initial transmission data and the retransmission data, and first output data is generated by soft-combining the second rate-dematched initial transmission data with the second rate-dematched retransmission data. Accordingly, memory usage can be reduced.

Abstract: An apparatus and method for rate dematching in a communication system are provided. The apparatus includes an input sequence generator, an error calculator, and a puncture/repetition determiner. The input sequence generator calculates if current input data among data, which are input in interleaved sequence, corresponds to any nth sequence among before-interleaved sequence. The error calculator calculates an error for the current input data using the calculated sequence. The puncture/repetition determiner determines type of the current input data using the error for the current input data.

Abstract: A multiplexing method for data switching is disclosed. In the method, a continuous data is received, and the continuous data includes a plurality of super frames, and each super frame includes a plurality of frames. These super frames are divided into a set of even super frames and a set of odd super frames. The frames included in the set of odd super frames are sorted by corresponding required bit error rate of each frame decreasingly or increasingly. The frames included in the set of even super frames are sorted by the required bit error rate of each frame increasingly or decreasingly. An encoder is used to encode these sorted super frames.

Abstract: At a transmitting end, information data, which is data to be transmitted, is copied via a number of wireless transmission paths and then encoded. Each piece of data is then subjected to a respective different pattern of puncturing process and transmitted to a receiving end via a respective wireless transmission path. At the receiving end, dummy data is embedded into the punctured data and decoded. The puncture patterns at the transmitting end for the respective different wireless transmission paths are prepared such that they are different from each other. In particular, the bits to be removed are preferably different from each other between the different puncture patters. At the receiving end, if the decoding of the data for any wireless transmission path has failed, the data obtained from other wireless transmission paths are combined and decoded. In this way, the probability of a decoding failure occurring can be lowered.

Abstract: A method for matching a rate in a mobile communication system causes puncturing or repetition in a fixed pattern, in which puncturing or repetition is applied to each bitstream on transport channels supporting different services in a next generation mobile communication system of the W-CDMA (Wideband Code Division Multiple Access) system.