Abstract: In the method of rate-matching, software is used to calculate at least one rate-matching parameter for data, and dedicated hardware is used to perform at least one of a puncturing and repetition process on data based on the calculated rate-matching parameter. In rate de-matching, software is again used to calculate at least one rate de-matching parameter for received data, and dedicated hardware is used to compensate for puncturing and repetition based on the calculated rate de-matching parameter.

Abstract: Disclosed are an apparatus and a encoding method using a turbo code and a unit and a method of permutation. The apparatus for encoding using a turbo code according to an exemplary embodiment of the present invention includes: a first encoder that encodes 3 bits inputted from first to third blocks each of which is formed of N bits respectively, with recursive systematic convolutional codes to output a first parity bit; a permutation unit that permutates the 3 bits; a second encoder that encodes the permutated 3 bits with the recursive systematic convolutional codes to output a second parity bit; and a puncturing unit that optionally removes the first parity bit and the second parity bit in consideration of a coding rate of a predetermined turbo code to control the coding rate.

Abstract: A wireless bit-interleaved coded OFDM (BI-COFDM) multiple-in-multiple-out (MIMO) system that improves the diversity seen by a convolutional decoder. The bit stream is interleaved first, then bits are mapped into symbols and then symbols are parsed into Nt separate streams, where t is the number of transmitters. A deinterleaver then performs the inverse permutation before sending the symbols to a Viturbi decoder. In another embodiment, a transmitting side bit-interleaver transforms an encoded and punctured bit stream using a first permutation, groups the transformed bit stream according to a desired constellation on one of Nt antennae, splits the transformed bit stream into separate streams accordingly and bit-interleaves/symbol-maps using a plurality of bit-interleavers/symbol-mappers to permute each stream using a second permutation. A receiving side performs the inverse operations of the transmitting side.

Abstract: Apparatus and method for transmitting data using a CTC (Convolutional Turbo Code) encoder in a mobile communication system. The data transmission method according to the present invention includes: a first encoding step of encoding input data bits inputted through two input terminals of the CTC encoder and outputting first encoding bits; a step of interleaving the input data bits by using four CTC interleaver parameters (P0, P1, P2, and P3) corresponding to the sizes of the input data bits; a second encoding step of encoding the interleaved data bits and outputting second encoding bits; and a step of selectively transmitting the input data bits, the first encoding bits, and the second encoding bits to a receiving side in accordance with a predetermined coding rate.

Abstract: Embodiments disclosed herein relate to preamble configuration in wireless communication systems (e.g., UHDR-DO type systems). Disclosed embodiments disclose receiving a plurality of information bits, generating a plurality of preamble codewords based on a determined a set of monitored MAC_IDs, correlating the information bits with each of the plurality of preamble codewords, determining if a maximum correlation value exceeds a threshold, and transmitting at least one of the preamble codewords if the threshold is exceeded.

Abstract: k input bits are encoded according to a code with which is associated a m×n=m+k parity check matrix H. The resulting codeword is punctured, with n?<n bits. The punctured codeword is exported to a corrupting medium such as a communication channel or a memory. A representation of the punctured codeword is imported from the corrupting medium and is decoded using a matrix H? that is smaller than H. For example, H has at most m rows and fewer than n columns but more than n? columns.

Abstract: k input bits are encoded according to a code with which is associated a m×n=m+k parity check matrix H. The resulting codeword is punctured, with n?<n bits. The punctured codeword is exported to a corrupting medium such as a communication channel or a memory. A representation of the punctured codeword is imported from the corrupting medium and is decoded using a matrix H? that is smaller than H. For example, H has fewer than m?=m?(n?n?) rows and fewer than n? columns.

Abstract: This disclosure relates generally to low power data decoding, and more particularly to low power data decoders for use under defects, erasures, and puncturing, with a low density parity check (LDPC) encoder. Systems and methods are disclosed for decoding a vector with punctured, detected defect and/or erased bits. Systems and methods are also disclosed for decoding a vector with undetected defects and/or unknown error patterns. Low power decoding may be performed in an LDPC decoder during the process of decoding an LDPC code in the case of defects, erasures, and puncturing. The low power techniques described herein may reduce power consumption without a substantial decrease in performance of the applications that make use of LDPC codes, or the devices that make use of low power LDPC decoders.

Abstract: An apparatus and method for generating a parity bit sequence to be transmitted or received over a plurality of frames in a communication system are provided. The method includes puncturing a first parity bit sequence by encoding, the first parity bit sequence with a first puncturing pattern; outputting, as a basic parity bit sequence, non-punctured parity bits that are remaining after the puncturing of the first parity bit sequence with the first puncturing pattern; puncturing a second parity bit sequence that is punctured by puncturing of the first parity bit sequence with the first puncturing pattern, the second parity bit sequence with a second puncturing pattern; and outputting, as an additional parity bit sequence, non-punctured parity bits that are remaining after the puncturing of the second parity bit sequence with the second puncturing pattern.

Abstract: A transmitter is capable of performing both Galois Field (GF) (16) and GF (256) encoding in a visual light communication system. The transmitter includes a GF (256) encoder. The transmitter also includes a first bit mapper configured to map a first number of bits to a second number of bits. The Galois Field (256) encoder is configured to receive and encode the second number of bits. The transmitter also includes a second bit mapper configured to map the second number of bits to the first number of bits. The transmitter also includes an interleaver unit that can pad bits based on a frame size and puncture the bits after interleaving and prior to transmission.

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 potion of a joint message. The joint message includes at least a potion of a first message from a first cooperating user device and at least a potion 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 potion of the decoded message with at least a potion of the first message to form a combined message, and then transmitting at least a potion of the combined message.

Abstract: Systems and methods for selecting a puncturing pattern for a low density parity check (LDPC) code are disclosed. One such method comprises: selecting a puncture pattern distribution for the LDPC code; calculating a security threshold and a reliability threshold for the LDPC, the LDPC having the selected puncture pattern distribution and also described by a degree distribution; storing the selected puncture pattern distribution responsive to a security gap for the LDPC being a lowest value encountered in any prior iterations; selecting another puncture pattern distribution for the LDPC code; and repeating the calculating, the storing, and the selecting another puncture pattern distribution steps.

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: Disclosed are an encoder, a transmission device, and an encoding method with which the transmission amount is reduced and a deterioration in transmission efficiency is suppressed while improving reception quality when QC-LDPC or a like block encoding is used. A puncture pattern setting unit (620) searches for a puncture pattern for each integral multiple of the number of columns or for each divisor of the number of columns of a sub block matrix that forms a check matrix (H) of a QC-LDPC code, and a puncture unit (data reduction unit) (630) switches the puncture pattern for each integral multiple of the number of columns or for each divisor of the number of columns of the sub block matrix that forms the check matrix of the QC-LDPC code.

Abstract: A plurality of information bits are encoded using a parity-check matrix that is equivalent to a modular code matrix. The modular code matrix is a diagonal sub-matrix structure immediately above a connection layer that includes a plurality of diverse connection layer sub-matrices, all but at most one of which are below corresponding diagonal matrix structure sub-matrices. The information bits are assembled with a plurality of parity bits produced by the encoding to provide a codeword that is exported to a medium. Preferably, all the diagonal matrix structure sub-matrices are identical. Preferably, some of the parity bits are computed using only diagonal matrix structure sub-matrices.

Abstract: A method in a communication system, where a systematic code obtained by systematic encoding of information bits having dummy bits inserted and by deletion of the dummy bits from results of the systematic encoding is transmitted. On a receiving side, the deleted dummy bits are inserted into the received systematic code and then decoded. The method includes: deciding a size of dummy bits for insertion into information bits; segmenting the information bits into a number of code blocks when a bit size of the information bits is greater than a stipulated size; inserting dummy bits into each block of the segmented information bits in conformity with a dummy bit insertion pattern; performing systematic encoding of each block of the information bits into which the dummy bits are inserted, and deleting the dummy bits from the results of the systematic encoding to generate a systematic code.

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: 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: A data rate matching method is disclosed. More particularly, a rate matching method using at least two parameters is disclosed. The rate matching method includes selecting bits from an input bitstream using a primary-indication parameter for selecting at least one bit and a secondary indication parameter for canceling the selection using the primary indication parameter or additionally selecting unselected bits, and processing the selected bits according to a rate matching mode so as to generate an output bitstream. By using the rate matching method, highspeed processing is realized by a simple calculation and the locations of target bits can be efficiently decided using at least two indication parameters. Accordingly, it is possible to reduce a calculation amount or improve performance.

Abstract: A method and system of relaying data are provided. The data is encoded into a turbo codeword by using a convolutional turbo code encoder, and the turbo codeword is transmitted from a source to a relay and a destination after puncturing by a first puncturing operation. The first punctured turbo codeword which is received in the relay is de-punctured and regenerated in a decoding operation and the regenerated turbo codeword is transmitted from the relay to the destination in punctured form after puncturing by a second puncturing operation. The punctured turbo codewords received from the source and the relay by the destination are totaled together as a totaled single turbo codeword and the totaled single turbo codeword is completely decoded to recover the data.

Abstract: An encoder receives an input bit stream and generates, based on the input bit stream, a first output bit stream based on at least a first polynomial and a second output bit stream based on at least a second polynomial. The first and second polynomials are each different from each other. The encoder forms a first packet of code symbols, having a first code rate, based on bits from the first output bit stream. A transmitter transmits the first packet. A receiver receives a first negative acknowledgment indicating unsuccessful decoding of the first packet after transmitting of the first packet. The encoder punctures bits from the second output bit stream and forms a second packet of code symbols having a second code rate. The second code rate is different from the first code rate. The transmitter transmits the second packet in response to the receiver receiving the first negative acknowledgment.

Abstract: A desired coding rate is obtained by encoding source data to produce first additional data; randomizing the source data to produce randomized data; encoding the randomized data to produce second additional data; selecting a number of bits from the first and second additional data to produce first selected data and second selected data, the number of selected bits is selected based upon a data length of the source data and a desired data length of an output sequence; and multiplexing the source data with the first and second selected data. At least one of the data length of the source data and the data length of the output sequence is variable.

Abstract: Techniques to support low density parity check (LDPC) encoding and decoding are described. In an aspect, LDPC encoding and decoding of packets of varying sizes may be supported with a set of base parity check matrices of different dimensions and a set of lifting values of different powers of two. A base parity check matrix G of dimension mB×nB may be used to encode a packet of kB=nB?mB information bits to obtain a codeword of nB code bits. This base parity check matrix may be “lifted” by a lifting value of L to obtain a lifted parity check matrix H of dimension L·mB×L·nB. The lifted parity check matrix may be used to encode a packet of up to L·kB information bits to obtain a codeword of L·nB code bits. A wide range of packet sizes may be supported with the set of base parity check matrices and the set of lifting values.

Abstract: Embodiments of the invention provide a method of de-rate matching without NULL bits skipping. Date is received without NULLs and inputted into a LLR combining block. The history data without NULLs is buffered. Log-likelihood ratio (LLR) combining is called before de-rate matching. The output of LLR combining is de-interleaved. The reading pointer is offset to forge NULLs. Finally, de-interleaving output without NULLs is sent to a turbo decoder.

Abstract: An apparatus for processing data is provided comprising processing circuitry having permutation circuitry for performing permutation operations, a register bank having a plurality of registers for storing data and control circuitry responsive to program instructions to control the processing circuitry to perform data processing operations. The control circuitry is arranged to be responsive to a control-generating instruction to generate in dependence upon a bit-mask control signals to configure permutation circuitry for performing permutation operation on an input operand. The bit-mask identifies within the input operand the first group of data elements having a first ordering and a second group of data elements having a second ordering and the permutation operation is such that it preserves one of the first ordering and the second ordering but changes the other of the first ordering and the second ordering.

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: According to some embodiments of the disclosed method and apparatus, systems and methods are provided that utilize extra payload capacity present in a symbol pad of a PHY payload to decrease the coding rate of an FEC coding scheme without increasing the symbol rate or decreasing the PHY rate of a corresponding data transmission. If a symbol pad length that would result from encoding a MAC frame using a default coding scheme would be at least as great as a parity length of the default coding scheme, and a new coding scheme maintaining the same parity length but having a reduced information bit length may be determined and used to encode the MAC frame. Owing the reduced information bit length, the new coding scheme has a reduced coding rate, but maintains the same number of OFDM symbols as the default coding scheme.

Abstract: The invention relates to a method of processing bit errors in a bit frame emanating from a digital audio coder, comprising a step of receiving a current bit frame liable to comprise bit errors. According to the invention, the bit frame comprises sensitive bits to be protected which are catalogued in at least one category according to the type of parameter that they code and the method furthermore comprises the steps of receiving protection bits, of reading the sensitive bits received in the current bit frame, the number of sensitive bits being lower than the number of bits of the bit frame, of detecting bit errors as a function of said protection bits received and of said sensitive bits received and in the event of detecting at least one erroneous bit in said bit frame, of modifying the current bit frame before decoding, as a function of the category in which the erroneous bit is catalogued.

Abstract: Apparatus and methods store data in a non-volatile solid state memory device according to a rate-compatible code, such as a rate-compatible convolutional code (RPCC). An example of such a memory device is a flash memory device. Data can initially be block encoded for error correction and detection. The block-coded data can be further convolutionally encoded. Convolutional-coded data can be punctured and stored in the memory device. The puncturing decreases the amount of memory used to store the data. Depending on conditions, the amount of puncturing can vary from no puncturing to a relatively high amount of puncturing to vary the amount of additional error correction provided and memory used. The punctured data can be decoded when data is to be read from the memory device.

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 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. Subsets of bits of data 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. Multiple combinations of subsets can be received on both transmission channels to reconstruct the source data stream following blockage of one channel.

Abstract: A rate matching method and device wherein the number of times to output each bit included in input data is determined in parallel, and the data length of the input data is expanded or contracted, based on basic parameters for expanding or contracting the input data and the bit number (m) of each bit of the input data. A de-rate matching method and device is also disclosed wherein expanded or contracted data is decoded to pre-expanded/contracted data.

Abstract: LDPC coding systems for 60 GHz millimeter wave based physical layer extension. LDPC (Low Density Parity Check) encoding in cooperation with sub-carrier interleaving, in the context of orthogonal frequency division multiplexing (OFDM), and appropriate symbol mapping is performed in accordance with transmit processing as may be performed within a communication device. In a receiving communication device, receive processing may be performed on a received signal based on the type of LDPC, sub-carrier interleaving, and symbol mapping thereof. The LDPC code employed in accordance with such LDPC encoding may have a partial-tree like structure. In addition, appropriate manipulation of the bits assigned to respective sub-carriers may be performed to ensure that the bits emplaced in the MSB (Most Significant Bit) location of various symbols has some desired diversity (e.g., from different codewords, from appropriately different locations within a given codeword, etc.).

Abstract: Apparatuses and methods are provided for generating a plurality of redundancy versions using various rate matching algorithms. In some embodiments, a rate matcher is provided that allocates systematic and parity bits to the redundancy versions in a manner that allows all of these bits to be transmitted in at least one redundancy version. In some embodiments, the rate matcher uses a first puncturing algorithm to generate both a first redundancy version and a third redundancy version, but allocates a different proportion of the systematic bits to these redundancy versions. In these embodiments, the second redundancy version may include only bits that were not transmitted in the first redundancy version.

Abstract: A method and apparatus are provided for transmitting and receiving information in a broadcasting/communication system. The method includes comparing a number of bits of an information word to be transmitted with a predetermined threshold value; if the number of bits of the information word is less than the predetermined threshold value, determining a first parameter pair; if the number of bits of the information word is not less than the predetermined threshold value, determining a second parameter pair; determining a number of bits to be punctured based on one of the first parameter pair and the second parameter pair; and puncturing the determined number of bits to be punctured, with respect to parity bits of a codeword generated by encoding the information word.

Abstract: k input bits are encoded according to a code with which is associated a m×n=m+k parity check matrix H. The resulting codeword is punctured, with n?<n bits. The punctured codeword is exported to a corrupting medium such as a communication channel or a memory. A representation of the punctured codeword is imported from the corrupting medium and is decoded using a matrix H? that is smaller than H. For example, H? is m?=m?(n?n?)×n? and is derived by merging selected rows of H.

Abstract: In one aspect of the present invention, the method receiving a signal is disclosed. The method includes receiving a signal transmitted in a radio frequency (RF) band including at least one RF channel, demodulating the received signal, parsing a preamble of a signal frame including layer-1 information, from the demodulated signal, deinterleaving bits of the layer-1 information, decoding the deinterleaved bits using an error correction decoding scheme including a shortening scheme and a puncturing scheme and obtaining physical layer pipes (PLPs) from the signal frame using the error-correction-decoded layer-1 information.

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: An apparatus for coding a communication signal is provided. The apparatus includes an encoder configured to encode the communication signal, to increase the length of the communication signal, and a repetition coder configured to repetitively code part of the encoded communication signal, to utilize at least some of the increased length of the communication signal. The apparatus further includes an interleaver configured to interleave the repetitively coded communication signal. A method is also provided for coding a communication signal.

Abstract: A method and apparatus for transmitting control information in a wireless communication system using a Low Density Parity Check (LDPC) code is provided. The number of LDPC blocks, through which L1 post-signaling information is to be transmitted, is determined according to the total number of bits of the L1 post-signaling information. The number of input information bits of each LDPC block is calculated when the determined number of LDPC blocks is plural. The number of puncturing bits among parity bits of each LDPC block is determined considering a modulation order. A frame including one or multiple LDPC blocks generated through the preceding steps is transmitted.

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 device and method for rate matching channel-encoded symbols in a data communication system. The rate matching device and method can be applied to a data communication system which uses one or both of a non-systematic code (such as a convolutional code or a linear block code) and a systematic code (such as a turbo code). In one aspect, the rate matching device includes a plurality of rate matching blocks, the number of the rate matching blocks being equal to a reciprocal of a coding rate of a channel encoder. The rate matching device can rate match the symbols encoded with a non-systematic code or the symbols encoded with a systematic code, by changing initial parameters including the number of input symbols, the number of output symbols, and the puncturing or repetition pattern determining parameters.

Abstract: A communication system that performs encoding and decoding for communication includes a transmitting apparatus and a receiving apparatus. The transmitting apparatus includes a turbo encoding unit including a first encoding unit that encodes an input signal and generates a first parity bit by bit-based encoding and n (n=1, 2, 3, . . . ) second encoding units that encode the input signal and generate second parity bits by bit-based encoding, and a symbol mapping unit that maps an output from the turbo encoding unit to a symbol by bit-based mapping operation and modulates the output. And the receiving apparatus includes a demodulating unit that demodulates a transmission signal, and a turbo decoding unit that performs turbo decoding on the demodulated signal by bit-based decoding.

Abstract: Apparatus and methods store data in a non-volatile solid state memory device according to a rate-compatible code, such as a rate-compatible convolutional code (RPCC). An example of such a memory device is a flash memory device. Data can initially be block encoded for error correction and detection. The block-coded data can be further convolutionally encoded. Convolutional-coded data can be punctured and stored in the memory device. The puncturing decreases the amount of memory used to store the data. Depending on conditions, the amount of puncturing can vary from no puncturing to a relatively high amount of puncturing to vary the amount of additional error correction provided and memory used. The punctured data can be decoded when data is to be read from the memory device.

Abstract: A method and system for writing in flash memory, the system operative for, and the method comprising, writing data onto a plurality of logical pages characterized by a plurality of different probabilities of error respectively, the writing including encoding data intended for each of the plurality of physical pages using a redundancy code with a different code rate for each individual physical page, the code rate corresponding to the probability of error in the individual logical page.

Abstract: A wireless device for implementing Incremental Redundancy (IR) operations includes system processing circuitry operable to perform Physical (PHY) layer operations, Media Access Control (MAC) layer operations and Radio Link Control (RLC) operations of the wireless device. The system processing circuitry further includes an IR control module for processing IR transactions related to a received RLC data block and for tracking an Automatic Repeat Request (ARQ) receiving state and received block bit map and a Layer 1 (L1) module for intercepting and diverting the IR transactions to the IR control module and for passing a correctly decoded RLC data block to the RLC layer operations via the MAC layer operations thereby automatically synchronizing the RLC layer operations. An IR processing module is coupled to the system processing circuitry to perform IR operations on the received RLC data block based upon a direction from the IR control module.

Abstract: Circuits and methods to generate a True Random Number Generator (TRNG) with tamper-detection are presented. In one embodiment, the circuit includes two identical TRNG circuits and logic circuitry that combines and correlates the outputs of the two TRNG circuits. The two identical TRNG circuits are located in close proximity to each other inside an Integrated Circuit (IC). The logic circuitry analyzes the outputs of the two TRNG circuits and the historical values of the relation between the outputs of the two TRNG circuits to determine if the outputs are correlated. If the outputs are not correlated, the logic circuitry outputs a true random number sequence based on the combination of the two TRNG circuits. As a result, circuit tampering, such as changes in temperature or voltage supplies, is detected in the IC.

Abstract: A system and method for rate matching to enhance system throughput based on packet size is provided. A method for transmitting information includes encoding a block of N bits, where N is an integer, demultiplexing the encoded block of N bits into at least one subblock of systematic bits and at least one subblock of parity bits, and permuting the at least one subblock of systematic bits and the at least one subblock of parity bits to generate at least one permuted subblock. The method also includes forming at least one output block from the at least one permuted subblock, computing a starting position of a redundancy version for a hybrid automatic repeat request (HARQ) transmission based on a relationship between N and a threshold, and transmitting the redundancy version. The redundancy version begins at the computed starting position and ends when a specified number of bits has been transmitted.

Abstract: An apparatus and a method for transmitting and receiving a signal in a communication system are provided. The method includes checking a type of the signal to be transmitted; determining a number of puncture bits according to the type of the signal; and puncturing an encoded signal to be transmitted according to the number of puncture bits.

Abstract: A method of storing a set of metadata bits associated with each of multiple data words includes combining the set of metadata bits with each of the multiple data words to generate multiple extended data words. The method includes encoding each of the multiple extended data words to generate multiple codewords and puncturing each of the multiple codewords to generate multiple punctured codewords, where in each of the punctured codewords the set of metadata bits is removed. The method includes storing the multiple punctured codewords, transforming the set of metadata bits to generate a set of transformed metadata bits, and storing the set of transformed metadata bits.

Abstract: Certain embodiments of the present invention are improved turbo-equalization methods for decoding encoded codewords. In one embodiment, in global decoding iteration i, the magnitude values of all decoder-input LLR values (Lch) are adjusted based on the number b of unsatisfied check nodes in the decoded codeword produced by global iteration i?1. The improved turbo-equalization methods can be used as the sole turbo-equalization method for a given global decoding session, or interleaved with other turbo-equalization methods.