Abstract:
The invention relates to a micro base station (100a-d) configured to provide a file of a plurality of files to an user equipment (101a-c) within the service area (103a) of a macro base station (103), wherein each file of the plurality of files can be decomposed into a plurality of file fragments. The micro base station (100a-d) comprises a cache memory (105a) configured to store a subset of the plurality of file fragments of the plurality of files, a communication interface (107a) configured to receive a request by the user equipment (101a-c) for a file of the plurality of files and a processor (109a) configured to provide any file fragments of the file requested by the user equipment (101a-c), which are part of the subset of the plurality of file fragments available in the cache memory (105a), to the communication interface (107a) for sending the file fragments to the user equipment (101a-c), wherein the processor (109a) is further configured to update the cache memory (105a) by replacing at least one of the file fragments of another file in the cache memory (105a) with at least one file fragment of the file requested by the user equipment (101a-c), which is not part of the subset of the plurality of file fragments available in the cache memory (105a).
Abstract:
The present invention relates to a device (102b, 104b) for generating a multi-kernel polar code ϰ N of length N and dimension K on the basis of a first transformation matrix G N of size N x N defining a first multi-kernel polar code. The device (102b, 104b) comprises a processor (102c, 104c) configured to generate a second transformation matrix G' N of size N x N by permuting the order of at least two columns of a sub-matrix of the first transformation matrix G N , and generate the multi-kernel polar code ϰ N on the basis of the following equation: ϰ N = u N ⋅ G' N , wherein u N = ( u 0 ,..., u N-1 ) is a vector of size N , with the elements u i , i = 0,... N - 1, corresponding to an information bit if i ε /, / being a set of K information bit indices, and u i = 0, if i ε F, F being a set of N - K frozen bit indices.
Abstract:
The invention relates to a base station (100) configured to manage the distribution of a plurality of files to an user equipment (111a-c) located within the service area (100a) of the base station (100), wherein each file of the plurality of files can be decomposed into a plurality of file fragments. The base station (100) comprises: a selector (101) configured to select for each micro base station of a plurality of micro base stations (109a-d) located within the service area (100a) of the base station (100) and for each file of the plurality of files a subset of the plurality of file fragments of the file; and a distributor (103) configured to distribute to each micro base station of the plurality of micro base stations (109a-d) for each file of the plurality of files the selected subset of the plurality of file fragments for caching the selected subset of the plurality of file fragments at the respective micro base station (109a-d) for being available for download by the user equipment (111a-c). Moreover, the invention relates to a method of managing the distribution of a plurality of files to an user equipment located within the service area of such a base station.
Abstract:
An apparatus for generating a frozen set associated with a polar code of length 'N' and dimension 'K' comprises a processing unit configured to take in input the polar code length 'N', the dimension 'K', and a profile of a structure of a block lower triangular affine (BLTA) group. The BLTA group structure is associated with an affine transformation matrix of size 'n x n' and the profile is an ordered set of a plurality of values corresponding to block sizes of blocks. The blocks are sub-matrices of the affine transformation matrix with all the diagonals of blocks in the same order as the ordered block sizes, forming the diagonal of the affine transformation matrix, each of the block sizes is such that 'n' is equal to the sum of block sizes and 'n' is equal to log2(N). The processing unit generates the frozen set so that the associated polar code admits all affine automorphisms belonging to the BLTA group.
Abstract:
Encoder (400) for encoding K information bits into a code word of length N´ on the basis of a polar code of length N, wherein N is a power of 2 and greater than or equal to N´. The encoder (400) comprises a memory (403) storing a plurality of bit indices, wherein the plurality of bit indices comprise a set of N frozen bit indices associated with the polar code of length N, a set of N/2 puncturing bit indices and/or a set of N/2 shortening bit indices and a processor (401) configured to retrieve at least a subset of the plurality of bit indices from the memory (403), to encode the K information bits using the polar code of length N for obtaining encoded data of length N and to reduce the number of bits of the encoded data to the length N´ for obtaining the code word of length N´.
Abstract:
The present disclosure relates generally to the field of data encoding and decoding, and particularly to automorphism-based polar encoding and decoding apparatuses and methods, as well as computer program products embodying the method steps in the form of computer codes. More specifically, it is proposed to design polar codes such that their frozen bits support automorphisms described by a binary upper triangular matrix having a diagonal including at least one of zeros and units. Codewords generated using these polar codes may be subsequently subjected to automorphism-based polar decoding in an efficient manner and with a lower decoding latency compared to the conventional Successive Cancellation List decoding algorithms. Furthermore, the efficiency of the automorphism-based polar decoding may be increased even more if the automorphisms are based on matrix elements arranged above the diagonal in a vicinity of a bottom right corner of the binary upper triangular matrix.
Abstract:
The present disclosure relates to the field of channel coding using polar codes, in particular, using product polar codes. The disclosure presents, accordingly, a first device for product polar-code encoding, and a second device for product polar-code decoding. The first device is configured to determine an exclusion set of bits in a first codeword matrix, and to transmit a second codeword matrix obtained by removing the exclusion set of bits from the first codeword matrix. The second device is configured to determine a first codeword matrix based on a second codeword matrix, wherein the first codeword matrix is obtained by adding a determined set of bits or a determined set of reals values to the second codeword matrix.
Abstract:
A communication device (40) comprises a code constructor (41) and a channel encoder (42). The channel encoder (42) is configures to encode a number of input symbols u to a number of output symbols x using a polar code of a code length N with a transformation matrix GN. The code constructor (41) is configured to compose the transformation matrix GN from at least two different polar code Kernels.
Abstract:
The present invention relates to a device (102b, 104b) for generating a polar code ϰ N of length N and dimension K on the basis of a transformation matrix G N of size N x N , wherein the transformation matrix G N is based on a first matrix G N r of size N r x N r , and on a second matrix G Nd of size N d x N d , wherein N = N r ⋅ N d , and wherein the polar code ϰ N is given by ϰ N = υ N ⋅ G N , wherein υ N = (υ 0 ,..., υ N -1 )is a vector of size N , υ i , i = 0,... N −1, corresponding to an information bit if i ε I , I being a set of K information bit indices, and υ i = 0, if i ε F , F being a set of N − K frozen bit indices. The device (102b, 104b) comprises a processor (102c, 104c) configured to generate a reliability vector v GNr = [v 1 ,... v Nr ], wherein v i represents a reliability of an i -th input bit of a code generated by the first matrix G Nr , generate a distance spectrum vector d GNd = [d 1 ,..., d Nd ] of a code generated by the second matrix G Nd , wherein d j represents a minimum distance of the code generated by the second matrix G Nd of dimension j , determine the set of K information bit indices I on the basis of the reliability vector v GNr and of the distance spectrum vector d GN , and generate the polar code c N on the basis of the set of K information bit indices I .
Abstract:
Provided is a procedure for sequentially decoding a polar code. The procedure comprises propagating statistical values representing initial estimates of codeword bits received via a noisy channel through multiple decoding stages comprising multiple kernel units representing polar code kernels of different sizes, determining first decoded bit values based on output statistical values of a kernel unit of an ultimate decoding stage, propagating the first decoded bit values through a subset of the multiple decoding stages and storing first partial sums determined from the propagated first decoded bit values in first memory elements of a memory. The procedure is continued by determining second decoded bit values based on the first stored partial sums and at least some of the propagated statistical values, and propagating the second decoded bit values through a subset of the multiple decoding stages and storing second partial sums determined from the propagated second decoded bit values in the memory, wherein the stored second partial sums consume memory space gained by releasing the first memory elements.