Abstract: An application specific processor to implement a Viterbi decode algorithm for channel decoding functions of received symbols. The Viterbi decode algorithm is at least one of a Bit Serial decode algorithm, and block based decode algorithm. The application specific processor includes a Load-Store, Logical and De-puncturing (LLD) slot that performs a Load-Store function, a Logical function, a De-puncturing function, and a Trace-back Address generation function, a Branch Metric Compute (BMU) slot that performs Radix-2 branch metric computations, Radix-4 branch metric computations, and Squared Euclidean Branch Metric computations, and an Add-Compare-Select (ACS) slot that performs Radix-2 Path metric computations, Radix-4 Path metric computations, best state computations, and a decision bit generation. The LLD slot, the BMU slot and the ACS slot perform in a software pipelined manner to enable high speed Viterbi decoding functions.

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: Method and apparatus for concatenated and interleaved turbo product code decoding are described. The turbo encoder include a plurality of decoders coupled to receive first portion of data, a processor coupled to receive second portion of the data, and a controller providing a plurality of control signals coupled to the plurality of decoders and the processor. A control signal of the plurality of control signals coupled to the processor when enabled configures the processor to pre-calculate the second portion of the data, where the second portion of the data is trellis termination data.

Abstract: Methods and systems are described for scheduling data in an FLO system. The method may include turbo encoding the data, and dividing a packet of the turbo-coded data into a plurality of subpackets. The method may include scheduling the turbo-coded packet of data so as to distribute the data across multiple frames of a superframe, by transmitting each one of the subpackets during a different frame of the superframe to increase time diversity. The turbo-coded packet of data may comprise systematic bits and parity bits. The method may include separately scheduling the systematic bits and the parity bits during different frames of the superframe.

Abstract: A decoder having an element decoding unit generating external information for input data, including an exponent position determining unit, when the external information output from the element decoding unit is input, of information excluding a sign bit from the external information, specifying an exponent that is a bit position where a value different from a sign bit first appears, a mantissa obtaining unit obtaining information of 1-bit or a plurality of bits in a position next to the exponent as a mantissa out of the external information, a storage unit storing the exponent and the mantissa and a restoring unit restoring the external information by reading the exponent and the mantissa stored in the storage unit, wherein the element decoding unit performs iteration decoding based on the restored external information is utilized.

Abstract: A bit register is restored to the initial state thereof irrespective of the state of the bit register even when a convolution encoder includes a circular section. The convolution encoder comprises an input data acquiring section (F11) for acquiring input data; an encoding object data generating section (F10) for generating encoding object data on the basis of the input data; a storage section (M10) for storing data corresponding to the encoding object data; a mod2 adder (S10) for performing convolution processing of the encoding object data on the basis of the data stored in the storage section (M10); and a switching section (F12) for switching at a prescribed timing the encoding object data generated by the encoding object data generating section (F10) from data based on the input data to data based on the data stored in the storage section (M10); wherein the data stored in the storage section (M10) are data obtained as a result of the convolution processing.

Abstract: Various embodiments of the present invention provide systems and methods for data processing. For example, a data processing circuit is disclosed that includes a first data detection circuit that applies a phase dependent data detection algorithm to a data set such that a first output of the first data detection circuit varies depending upon a phase of the data set presented to the first data detection circuit. A first phase of the data set is presented to the first data detection circuit. The circuits further include a decoder circuit that applies a decoding algorithm to the first output to yield a decoded output, and a phase shift circuit that phase shifts the decoded output such that a second phase of the data set is provided as a phase shifted output.

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: Apparatus and methods store error recovery data in different dimensions of a memory array. For example, in one dimension, block error correction codes (ECC) are used, and in another dimension, supplemental error correction codes, such as convolutional codes, are used. By using separate dimensions, the likelihood that a defect affects both error recovery techniques is lessened, thereby increasing the probability that error recovery can be performed successfully. In one example, block error correction codes are used for data stored along rows, and this data is stored in one level of multiple-level cells of the array. Supplemental error correction codes are used for data stored along columns, such as along the cells of a string, and the supplemental error correction codes are stored in a different level than the error correction codes.

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: Systems and methods are provided for selecting transmission parameters used in the transmission of a communication signal in a wireless communications device. In one embodiment, a computer-implemented method for determining a convolutional code constraint length and/or a modulation type is provided. The method includes obtaining a channel condition for a channel associated with transmission of the communication signal. Based at least in part on the channel condition, the method includes selecting a convolutional code constraint length and/or a modulation type for transmitting the communications signal. In some embodiments, the method also includes selecting a data rate for transmitting the communications signal. Other aspects, embodiments, and features are also claimed and described.

Abstract: An optical communication system includes a bit-interleaved coded modulation (BICM) coder; and a low-density parity-check (LDPC) coder coupled to the BICM coder to generate codes used as component codes and in combination with a coherent detector.

Abstract: Embodiments of a decoder and method of decoding blocks of soft bits in a wireless receiver are generally described herein. Other embodiments may be described and claimed. In some embodiments, a memory is initialized with encoded input data and updated with sums of extrinsic reliabilities. Decoded output data is provided from the memory after a predetermined number of iterations.

Abstract: Embodiments of a broadcast receiver and method for optimizing a scale factor in a log-likelihood ratio (LLR) mapper are generally described herein. In some embodiments, the broadcast receiver includes an LLR mapper to generate LLRs from demodulated data samples, a low-density parity-check (LDPC) decoder to generate decoded data from the LLRs, and an LLR optimizer to dynamically select a scale factor for the LLR mapper based on a number of iterations for convergence of the LDPC decoder. In some embodiments, the LLR optimizer iteratively revises the scale factor during receipt of broadcast signals until the number of iterations of the iterative decoder is either minimized for convergence or minimized for convergence failures.

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: Disclosed herein is a decoding apparatus for decoding an LDPC (Low Density Parity Check) code received in a first format or a second format wherein a process to decode received values each obtained as a result of receiving the LDPC code in the first or second format includes at least F check-node processes carried out concurrently as processes of F check nodes respectively or F variable-node processes carried out concurrently as processes of F variable nodes respectively.

Abstract: Methods and devices are disclosed for encoding and decoding convolutional codes in a communication system. In various embodiments of the disclosure, a codeword comprises message data and parity data. A convolutional codeword is generated by multiplying the message data and the parity data with a convolutional polynomial. The convolutional codeword may be decoded by a convolutional code decoder that uses the convolutional polynomial and a maximum likelihood divisor to obtain a maximum likelihood message from the convolutional codeword.

Abstract: A pre-decoded tail-biting convolutional code (TBCC) decoder and a decoding method thereof are provided. The decoder includes a pre-decoder, a storage module, and a control module. The pre-decoder receives a current state, a neighboring state, and a current path status corresponding to sequential data encoded in TBCC, generates predicted decoded bits, and determines whether states corresponding to minimum path metrics of neighboring stages are in continuity according to the current state, the neighboring state, and a current path status. The storage module is connected to the pre-decoder and stores the predicted decoded bits. The control module is connected to the storage module and the pre-decoder. In addition, the control module selects to output the decoded bits from the storage module when the continuity between the states corresponding to the minimum path metrics of the neighboring stages reaches a truncation length.

Abstract: A method of calculating backward computations branch metrics for a butterfly in a trellis of a MAP-genre decoding algorithm includes providing initialized branch metrics for the transitions in the butterfly and incrementing the branch metrics with a group of data values corresponding to the transitions in accordance with control signals derived from the butterfly index and one or more polynomials describing tap positions of the encoding equipment to whose operation the trellis relates, wherein the group comprises systematic bit and parity bit values.

Abstract: A method of transmitting data using a Convolutional Turbo Code (CTC) encoder by a transmitting end in a mobile communication system includes providing first encoded bits by encoding input data bits inputted to two input ports of the CTC encoder, interleaving the input data bits using 4 CTC interleaver parameters (P0, P1, P2, and P3) corresponding to a size of the input data bits, providing second encoded bits by encoding the interleaved input data bits, and transmitting the input data bits, the first encoded bits, and the second encoded bits.

Abstract: A method for data transmission in a multiple input multiple output (MIMO) system. The method for data transmission includes receiving multiple input data streams and performing low density parity check (LDPC) encoding of the input data streams utilizing a parity check matrix. The parity check matrix comprises a plurality of sub-parity check matrices for encoding respective associated ones of the input data streams and performing space time encoding for transmitting the LDPC encoded input data streams over a plurality of antennas. The performing of the LDPC encoding of the input data streams includes generating one or more connection matrices, each connection matrix for injecting information of one of the input data streams into the encoding of another one of the input data streams.

Abstract: A receiving system and a data processing method are disclosed. The receiving system includes: a receiving unit receiving a broadcast signal including a first group comprising mobile service data, known data and signaling data; a signaling decoder decoding the signaling data from the received broadcast signal; a demodulator demodulating the received broadcast signal based upon the known data; an equalizer channel-equalizing the demodulated broadcast signal based upon the known data; a turbo decoder performing turbo decoding on the mobile service data of the channel-equalized broadcast signal by applying a Serial Concatenated Convolutional Coding (SCCC) mode based upon the signaling data; and an error correction unit performing error correction decoding on the turbo-decoded mobile service data based upon the signaling data.

Abstract: When a wired interface circuit receives a CEC message destined for a node device connected through a wireless transceiver circuit, a CEC controller of a wireless node device outputs an ACK for the received CEC message from the wired interface circuit, and transmits a wireless data packet containing contents of the CEC message from the wireless transceiver circuit. The CEC controller also waits for the wireless interface transceiver circuit to receive a wireless ACK packet for the transmitted wireless data packet.

Abstract: An apparatus for encoding an information bit stream using turbo code is provided. The apparatus includes a temporary bit generator for creating a temporary bit stream, an interleaver for independently receiving the information bit stream and the temporary bit stream, a first constituent encoder for independently receiving the information bit stream and the temporary bit stream and generating a first parity bit stream and a second constituent encoder for receiving an output of the interleaver and generating a second parity bit stream. Performance of a turbo code can be enhanced without changing a code rate by making a decoded bit stream longer.

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: An error coding circuit comprises a non-systematic convolutional encoder for coding an input bit stream to produce two or more groups of parity bits, an interleaver circuit for interleaving parity bits within each group of parity bits, and a rate-matching circuit for outputting a selected number of the interleaved parity bits ordered by group to obtain a desired code rate.

Abstract: An apparatus for error-correcting an input signal to generate an output signal. The apparatus includes an unreliable-location determining module for determining unreliable-locations of the input signal and generating an indication signal accordingly, a first error-correcting module for error-correcting the input signal to generate a first candidate signal, a second error-correcting module coupled to the unreliable-location determining module for error-correcting the input signal with reference to the indication signal to generate a second candidate signal, and a selecting module coupled to the first and second error-correcting modules for selecting one of the first and second candidate signals to be the output signal.

Abstract: An error rate sensitive error correction (ERSEC) system acting on product code is disclosed herein that improves error correction effectiveness by allocating error correction resources based on error susceptibility. The ERSEC system acts on vectors (bits or multiple-bit symbols) of a data matrix arranged from a data sequence. The ERSEC system obtains a signal-to-noise (SNR) profile that includes different SNR domains, assigns at least two vectors of the same dimension to different SNR domains, and allocates a level of error correction for the assigned vectors based on the SNR magnitudes of the assigned-to SNR domains.

Abstract: A computer-implemented system and method for off-line delivery of content through an active screen display are provided. A processor includes an encoding application to assemble and encode digitally-stored content into encoded content, and to interleave the encoded content with a signal conveying a live screen representation. The live screen representation includes output of a user interface for applications executing on the processor. An active screen display is coupled to the processor over a physical display interface connection. The active screen display includes a runtime application to identify the encoded content within the signal on the active screen display and to decode the encoded content into decoded content. The active screen display further includes an offline application to unilaterally display the decoded content on the active screen display without use of the processor and in an absence of the live screen presentation.

Abstract: A user equipment (UE) comprising at least one component configured to decode a tail-biting convolution code (TBCC) by calculating a plurality of paths that correspond to a plurality of encoder starting states and trace back at least one of the calculated paths per at least one iteration until a trace-back convergence check (TCC) condition fails, wherein the TCC condition fails if a starting state of a first traced back path among the calculated paths is not equal to a starting state of a subsequent traced back path.

Abstract: The present invention improves communication systems by providing a virtual binary erasure channel over a frame-based data exchange infrastructure, through a combination of time diversity mechanisms with bit-based interleaving agents. The interleaving agents are judiciously positioned in the data processing path to provide benefits to the forward error correction functions of the communication system. The invention thus allows for a significant reduction of the complexity of the error correction facilities of a communication system such as a DVB-SH system, by allowing the efficient use of a low-complexity binary based decoder.

Abstract: Methods and apparatuses to perform iterative decoding of Low Density Parity Check (LDPC) codes based on selecting a lambda number of minimum values. In one aspect, an LDPC decoder is configured for: sorting a plurality of incoming messages of a check node according to magnitudes of the incoming messages; identifying a predetermined number of unique message magnitudes from the incoming messages; and computing outgoing messages for a subset of the plurality of incoming message, where the messages of the subset have different magnitudes larger than the predetermined number of unique message magnitudes but the outgoing messages are computed to have the same magnitude. In at least one example, the decoder is further configured for computing outgoing messages that have magnitudes equal to any of the predetermined number of unique message magnitudes. In general, the magnitudes computed for all outgoing messages may not necessarily be the same.

Abstract: A broadcast transmitting system and a method of processing broadcast data in the broadcast transmitting system are disclosed. Herein, the broadcast transmitting system includes a group formatting unit for mapping mobile service data into at least one region of a plurality of regions within a data group and adding a plurality of known data sequences to the data group, a deinterleaver for deinterleaving data in the data group, a first multiplexer for multiplexing mobile service data packets including the deinterleaved data with main service data packets including main service data, an interleaver for interleaving data in the multiplexed data packets, a trellis encoding unit for trellis encoding the interleaved data, a second multiplexer for multiplexing the trellis-encoded data with segment synchronization data and field synchronization data, and a modulator for modulating a broadcast signal including the multiplexed data.

Abstract: A transmitting system and a method of processing data are disclosed herein. The transmitting system includes a service multiplexer and at least one transmitter located in a remote position from the service multiplexer. The service multiplexer transmits an operations and maintenance (OM) packet and mobile service data. Herein, the OM packet describes a transmission parameter including a transmission frame information, a Reed-Solomon (RS) frame information, and a serial concatenated convolution code (SCCC) information of the mobile service data. Each transmitter performs error correction encoding and block encoding on the mobile service data based upon the transmission parameter within the OM packet transmitted from the service multiplexer, thereby transmitting the processed mobile service data to a receiving system.

Abstract: A decoding apparatus includes a row processing unit 5 and a column processing unit 6 for performing a calculation and an update of probability information with row processing and column processing according to a Min-Sum algorithm on a received signal which is low-density parity-check coded in batches of 1 bit or a predetermined number of bits, a decoded result judgment unit 8 for determining a decoded result from a hard decision of a posterior value, for performing a parity check on the decoded result, and for judging whether or not the decoded result is correct, and a control unit for controlling iteration of decoding processing by the row processing unit 5 and column processing unit 6 on the basis of the judgment result of the decoded result judgment unit 8.

Abstract: The invention relates to a method for transmitting a data block (104) via a message channel (130), said method having the following steps of: —subdividing the data block into at least one first sub-block (108) and one second sub-block (110), —generating first check data (114) for the first sub-block (108) and second check data (116) for the second sub-block (110), wherein a first transmission sub-block (118) is formed by the first sub-block and the first check data, and wherein a second transmission sub-block (120) is formed by the second sub-block and the second check data, —transmitting the first and second transmission sub-blocks in a transmission block (124) via the message channel, wherein the order of the bits to be transmitted in the transmission block is determined by a predefined scheme, wherein the scheme is designed in such a manner that one or more bits of the first transmission sub-block and one or more bits of the second transmission sub-block alternately follow one another.

Abstract: A method, apparatus, and machine readable medium for processing a plurality of Z-vectors. Each Z-vector includes Z elements, and each element includes K bits. The Z-vectors correspond to a binary codeword, portions of which have a relationship to a plurality of transmission units. The Z-vectors are stored in a set of D memory arrays. Each memory array includes Z rows of memory locations. Each memory location corresponds to a different array column, and each array column corresponds to a different Z-vector. Each Z-vector identifies one column. A series of sets of control information is generated. Each set includes a transmission unit identifier, a Z-vector identifier, and a row identifier. For at least one set, P times K divided by D bits is read from each column identified by the Z-vector that is identified by the Z-vector identifier included in the set.

Abstract: A method and a device (4) for block interleaving of size K with N iterations of index j, N being greater than or equal to 1, of input digital data items indexed by a variable k={0, . . . , K?1}. The interleaving method uses a turbo structure that has two inputs and one output. At the end of each iteration j, the interleaving law I(j)(k) at the output of the interleaver (4) is modified in accordance with an input sequence formed by the position indices of the data items before interleaving (typically a ramp) and in accordance with an interleaved sequence (which provides the position of the data items after interleaving) resulting from the previous iteration of the same interleaving algorithm.

Abstract: In an information recording, a first data processor divides input data into a plurality of frames so as to arrange the plurality of frames for each unit block. The unit block is a unit of error-correction with respect to the input data and the frames include first identification information, respectively. A second data processor inserts a linking block on a boundary portion between unit blocks in the record data. The unit blocks are adjacent to each other. The linking block includes a second identification information and the second identification information is different from each of the first identification information. A controller controls to record the unit block and the linking block on the information recording medium.

Abstract: A method of rate matching process of the hybrid Automatic Repeat reQuestion (HARQ) operation in which coded bits are selected for a transmission depends on whether the transmission is a first transmission of a new packet or a retransmission of an existing packet. In downlink of long term evolution (LTE) system, a downlink grant message is transmitted along with the packet data transmission. The grant message may also contain the redundancy version (RV). A new data indicator (NDI) is introduced to indicate the start of a new packet. The improved method of rate matching may be implanted into either a transmitter or a receiver.

Abstract: Embodiments of the present invention provide a read channel including a front end to receive an optical image, convert the optical image into multi-bit soft information, and to serially transmit the multi-bit soft information to other components of the read channel. Other embodiments may be described and claimed.

Abstract: A method of serving content to multiple clients via a network is provided. Independent sessions with each of a plurality of clients are maintained, wherein the number of clients in the plurality of clients can vary over time, and wherein the start of each session and the end of each session can be independent of the start and end of other sessions. A stream of packet payloads is received, each packet payload of the stream of packet payloads including data generated from the content, wherein each packet payload in at least a subset of the stream of packet payloads includes a different set of data. Each packet payload in the stream of packet payloads is transmitted to each client of the plurality of clients in corresponding packets, wherein the packet payload transmitted to a client at any particular time is independent of the state of the corresponding session.

Abstract: A parameterized interleaver design process is provided, which optimizes the design for interleavers of any size, and can be completely specified using only a few design parameters. According to the parameterized interleaver design process an interleaver ?(i) of a length N is generated. A number of subpermutation masks are defined, and a first intermediate interleaver permutation is partitioned into a number of subgroups, wherein the number of subgroups corresponds with the number of subpermutation masks. Each of the subgroups of the first intermediate interleaver permutation is partitioned into a number of further subgroups, and each of the subpermutation masks is applied to each of the further subgroups of a corresponding subgroup of the first intermediate interleaver permutation, resulting in a corresponding portion of a second intermediate interleaver permutation. The resulting interleaver ?(i) is generated based at least in part on the first and second intermediate interleaver permutations.

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: The present invention aims at providing an encoding device for error correction, encoding method for error correction and encoding program for error correction wherein countermeasures against eavesdropping are taken into account. To achieve this, in accordance with an aspect of the present invention there is provided an encoding device for error correction, the device comprises a generation means for generating randomly a vector u=(xk+1, . . . , xm) composed of m-k digit(s); a creation means for creating an x?=[xu]=(x1, . . . , xm) by concatenating the vector u=(xk+1, . . . , xm) composed of m-k digit(s) randomly created by the creation means to data x=(x1, . . . , xk) to send; and an output means for outputting a vector of length n by carrying out [n, m] encoding of the x? created by the creation means.

Abstract: Systems and methods for encoding user information and decoding signal vectors using fractional encoding/decoding and set partitioning. A fractional encoder can select a coset for transmitting or storing user information based on one or more deterministic bits and on encoded user information. The deterministic bits limit the encoder to using only a subset of the available signal vectors in a modulation scheme. A fractional decoder can receive a signal vector, and can find at least two nearest neighbors in each dimension. The fractional decoder can form a set of potential signal vectors using only the at least two nearest neighbors. The decoder may determine which of these potential signal vectors are valid within the fractional signaling scheme, and can decode the received signal vector based on the valid potential signal vectors.

Abstract: A method is used that substantially simultaneously trellis encodes data to be modulated onto multiple tones. The embodiments of the present invention comprise the steps of: (a) using a first input operand comprising state bits for a first trellis stage; (b) using a second input operand comprising a plurality of input data bits; and (c) generating an output comprising output data bits and output state bits from a first or later trellis stage.

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: Methods and systems for slow associated control channel signaling are disclosed. An example method for securing communications in a mobile network disclosed herein comprises transmitting a first variant of a message of a first type on a first slow associated control channel (SACCH) before ciphering is started on the first SACCH, and after ciphering is started on the first SACCH, transmitting a second variant of the message of the first type on the first SACCH, and subsequently transmitting the second variant of the message of the first type on the first SACCH, wherein the subsequently transmitted second variant of the message of the first type is the next transmitted message of the first type on the first SACCH.

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.