A communication device includes an interleaving unit that determines an interleaving length of transmit data to be transmitted through free-space optical communication, and interleaves the transmit data based on the determined interleaving length, and a shaping unit that shapes the interleaved transmit data so as to make the interleaving length detectable on a receiving side of the free-space optical communication.

Disclosed by the present application are a resource mapping method and apparatus and device, comprising: determining to-be-sent data hosted on a data-channel physical downlink shared channel (PDSCH)/physical uplink shared channel (PUSCH); mapping said to-be-sent data to a virtual resource block (VRB); mapping the virtual resource block to a physical resource block (PRB) in resource block (RB) bundle units. Using the present application, it is possible to prevent the problem of the size of a virtual resource block bundle being inconsistent with the size of a physical resource block bundle, thus causing it to be impossible to map the virtual resource block to the physical resource block.

A deinterleaver device, a method for deinterleaving, an interleaver device, and a method for interleaving are disclosed. The method for deinterleaving includes: providing a memory and a stream count for a frame; virtually dividing the memory into equal sections, wherein a section count equals the stream count; calculating a write address for a sample of the samples based on a location of the sample in the frame and a correspondence of the location to one of the sections; receiving the sample; and writing the received sample to the write address, wherein the calculating and the write address corresponds to a correct deinterleaving location in one of the sections for the sample.

A polar-code based encoder is used to perform a transfer of useful data to a polar-code based decoder via a Binary Discrete-input Memory-less Channel. The Divide and Conquer structure consists of a multiplexer having useful data bits and a set of frozen bits as inputs followed by a polarization block of size N=2.sup.L, wherein the polarization block of size N comprises a set of front kernels followed by a shuffler and two complementary polarization sub-blocks of size N/2 with a similar structure as the polarization block of size N but with half its size. A dynamically configurable interleaver is present between the shuffler and one and/or the other of the complementary polarization sub-blocks at each recursion of the Divide and Conquer structure. The configuration of the dynamically configurable interleavers is dynamically modified according to changes detected in the Binary Discrete-input Memory-less Channel.

The present technique relates to a data processing apparatus, and a data processing method each of which enables a valid address to be more reliably produced in interleave. In a data processing apparatus, a frequency interleaver for carrying out frequency interleave calculates a first bit stream produced by a first pseudo random number generating portion configured to produce a random bit stream, a second bit stream produced by a second pseudo random number generating portion configured to produce a random bit stream, and an additional bit produced by a bit producing portion configured to alternately produce a bit as 0 and a bit as 1. As a result, in producing a write address or a read address including a random bit stream, the bit as 0 and the bit as 1 are alternately repeated as the most, significant bit in the random bit stream. The present technique, for example, can be applied to a frequency interleaver for carrying out frequency interleave.

There is provided an apparatus including an acquisition unit configured to acquire an information block generated from transmission data for a user and subjected to error correction coding; and an interleaving unit configured to interleave a bit sequence of the information block using an interleaver unique to the user. The interleaving unit interleaves the bit sequence by interleaving each of two or more partial sequences obtained from the bit sequence.

A method and an apparatus for controlling an interleaving depth are provided. The interleaving depth controlling method includes performing a modulo operation on an interleaving depth selected to be less than or equal to a maximum interleaving depth and a total number of codewords to obtain a number of remaining codewords; and comparing the total number of the codewords to the interleaving depth, when the number of the remaining codewords excludes 0, to control the interleaving depth.

There is provided an apparatus including an acquisition unit configured to acquire an information block generated from transmission data for a user and subjected to error correction coding and an interleaving unit configured to interleave a bit sequence of the information block using an interleaver unique to the user. The interleaving unit interleaves the bit sequence by interleaving each of two or more partial sequences obtained from the bit sequence.

Methods are proposed herein to perform rate matching for polar codes via circular buffering of the polar encoded bits. Embodiments are directed to methods of operation of a transmitting node in a wireless system including performing polar encoding of a set of information bits in accordance with a polar sequence of length N.sub.B to thereby generate N.sub.B coded bits. The method can further include interleaving the coded bits to thereby provide an interleaved coded bit sequence, and storing the interleaved coded bit sequence into a circular buffer of length N.sub.B. According to certain embodiments, the method can further include extracting N coded bits for transmission from the circular buffer. N can be greater than, equal to, or less than N.sub.B.

A method and an apparatus for controlling an interleaving depth are provided. The interleaving depth controlling method includes performing a modulo operation on an interleaving depth selected to be less than or equal to a maximum interleaving depth and a total number of codewords to obtain a number of remaining codewords; and comparing the total number of the codewords to the interleaving depth, when the number of the remaining codewords excludes 0, to control the interleaving depth.