H03M13/356

Method of Shifting Redundancy Version for the Transmission of a Transport Block Over Multiple Slots

Where large transport blocks are rate-matched and transmitted on each PUSCH segment using different redundancy versions (RVs), RV cycling with a small number of PUSCH segments might not cover the whole codeword, and/or rate-matching a large TBS across many PUSCH segments into the resource of a single PUSCH segment may lead to an effective coding rate of the self-decodable redundancy versions that is too high. To avoid these issues, the starting position of one or more RVs may be shifted by setting the starting position of a current RV to be the same as an ending position of a previous position, or by scaling the starting position by a value. Alternatively, these issues may be avoided by setting a new starting position for an RV based on the gap from the end of a previous RV to the start of a current RV.

Variable Length ECC Code According to Value Length in NVMe Key Value Pair Devices
20230208448 · 2023-06-29 ·

A data storage device includes a memory device and a controller coupled to the memory device. The controller is configured to determine an error correction code (ECC) code length for KV pair data and/or an ECC code rate for the KV pair data, where the ECC code length and the ECC code rate are selected according to a value length and decoding capability of the KV pair data, generate ECC parity based on the selecting, and program the KV pair data and the generated ECC parity to the memory device.

Low gate-count generalized concatenated code (GCC) by online calculation of syndromes instead of buffer

A device for decoding a generalized concatenated code (GCC) codeword includes: a buffer; and at least one processor configured to: obtain the GCC codeword, calculate a plurality of inner syndromes based on a plurality of frames; calculate a plurality of sets of delta syndromes based on the frames; determine a plurality of outer syndromes based on the sets of delta syndromes; store the inner syndromes and the outer syndromes in a buffer; perform inner decoding on the frames based on the inner syndromes stored in the buffer; update at least one outer syndrome stored in the buffer based on a result of the inner decoding; perform outer decoding on the frames based on the updated at least one outer syndrome; and obtain decoded information bits corresponding to the GCC codeword based on a result of the inner decoding and the result of the outer decoding.

DATA PROCESSING APPARATUS AND DATA PROCESSING METHOD

The present technology relates to a data processing apparatus and a data processing method that are able to secure good communication quality in data transmission using an LDPC code. One symbol is mapped to one of 16 signal points prescribed in 16APSK, with code bits of four bits of an LDPC code having a code length of 16200 bits and a code rate of 7/15 as one symbol. 16 signal points prescribed in 16APSK are four signal points on an inner circle and 12 signal points on an outer circle, and a radius ratio of the inner circle and the outer circle is 5.25. The present technology may be applied to, for example, a case of performing data transmission using an LDPC code.

ERASURE CODING AND REPLICATION IN STORAGE CLUSTERS

A cluster receives a request to store an object using replication or erasure coding. The cluster writes the object using erasure coding. A manifest is written that includes an indication of erasure coding and a unique identifier for each segment. The cluster returns a unique identifier of the manifest. The cluster receives a request from a client that includes a unique identifier. The cluster determines whether the object has been stored using replication or erasure coding. If using erasure coding, the method reads a manifest. The method identifies segments within the cluster using unique segment identifiers of the manifest. Using these unique segment identifiers, the method reconstructs the object. A persistent storage area of another disk is scanned to find a unique identifier of a failed disk. If using erasure coding, a missing segment previously stored on the disk is identified. The method locates other segments. Missing segments are regenerated.

CODING AND MODULATION APPARATUS USING NON-UNIFORM CONSTELLATION

A coding and modulation apparatus and method are presented. The apparatus comprises an encoder that encodes input data into cell words, and a modulator that modulates said cell words into constellation values of a non-uniform constellation. The modulator is configured to use, based on the total number M of constellation points of the constellation and the signal-to-noise ratio SNR in dB, a non-uniform constellation from a group of constellations comprising one or more of predetermined constellations defined by the constellation position vector w.sub.0 . . . b−1, wherein b=M/4.

Priority-Based Channel Coding for Control Information
20220376822 · 2022-11-24 · ·

Systems, methods, and instrumentalities are disclosed for priority-based channel coding for control information. A wireless transmit/receive unit (WTRU) may sort control information associated with a first control information type into a first control information group and the control information associated with a second control information type into a second control information group, for example, based on respective priorities associated with the first and second control information types. The WTRU may group one or more bits of the first control information group into a first bit level control information group and a second bit level control information group based on priority. The WTRU may selectively apply a cyclic redundancy check (CRC) to the first control information group, the second control information group, the first bit level control information group, and/or the second bit level control information group.

Data processing device and data processing method

A code bit of an LDPC code in which a code length is 16200 bits and an encoding rate is 8/15 is interchanged with a symbol bit of a symbol corresponding to any of 8 signal points defined by 8PSK. When 3 bits of code bits stored in three units of storages having a storage capacity of 16200/3 bits and read bit by bit from the units of storages are allocated to one symbol, a (#i+1)-th bit from a most significant bit of the 3 bits of code bits is set to a bit b#i, a (#i+1)-th bit from a most significant bit of 3 bits of symbol bits of the one symbol is set to a bit y#i, and a bit b0 is interchanged with a bit y1, a bit b1 is interchanged with a bit y0, and a bit b2 is interchanged with a bit y2.

CHECKSUM ADDITION METHOD, CHECKSUM ADDITION DEVICE, AND SENSOR SYSTEM
20230179227 · 2023-06-08 ·

A checksum addition method includes obtaining a command and an address transmitted from a request source; reading data from the address according to the command; calculating a checksum to be added to the data; and transmitting the checksum and the data to the request source, wherein the calculating calculates the checksum in a data unit according to a type of the command.

Method for transmitting data by using polar coding in wireless access system
RE049547 · 2023-06-06 · ·

The present invention relates to data transmission/reception methods using a polar coding scheme, and devices for supporting same. The method for transmitting data by using polar coding in a wireless access system, according to one embodiment of the present invention, may comprise the steps of deriving Bhattacharyya parameters according to data bits input for finding noise-free channels among equivalent channels; allocating data payloads comprising data bits and cyclic redundancy check (CRC) bits to the found noise-free channels; inputting the data payloads into a polar encoder; and transmitting code bits output by the polar encoder, wherein the CRC bits may be allocated to better noise-free channels, among the noise-free channels indicated by the Bhattacharyya parameters, than the data bits.