A MICRO BASE STATION COMPRISING A CACHE-MEMORY TO PROVIDE FILES TO A USER-EQUIPMENT
    1.
    发明申请
    A MICRO BASE STATION COMPRISING A CACHE-MEMORY TO PROVIDE FILES TO A USER-EQUIPMENT 审中-公开
    包含高速缓存的微基站将文件提供给用户设备

    公开(公告)号:WO2017108070A1

    公开(公告)日:2017-06-29

    申请号:PCT/EP2015/080737

    申请日:2015-12-21

    CPC classification number: H04L67/2842 H04L67/2852

    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 translation: 本发明涉及一种微型基站(100a-d),其被配置为向宏服务区(103a)内的用户设备(101a-c)提供多个文件的文件 基站(103),其中所述多个文件中的每个文件可以被分解成多个文件片段。 微基站(100a-d)包括:高速缓冲存储器(105a),被配置为存储多个文件的多个文件片段的子集;通信接口(107a),被配置为接收用户设备(101a) -c)用于所述多个文件的文件;以及处理器(109a),被配置为提供由所述用户设备(101a-c)请求的所述文件的任何文件片段,所述文件片段是可用的所述多个文件片段的子集的一部分 在高速缓冲存储器(105a)中发送到用于将文件片段发送到用户设备(101a-c)的通信接口(107a),其中处理器(109a)还被配置为通过在 所述高速缓冲存储器(105a)中的另一文件的至少一个文件片段与所述用户设备(101a-c)所请求的文件的至少一个文件片段不是所述多个可用文件片段的子集的一部分 在高速缓冲存储器(105a)中。

    DEVICE AND METHOD FOR GENERATING A MULTI-KERNEL POLAR CODE

    公开(公告)号:WO2019037841A1

    公开(公告)日:2019-02-28

    申请号:PCT/EP2017/071185

    申请日:2017-08-23

    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.

    A BASE STATION AND A METHOD FOR MANAGING THE DISTRIBUTION OF A PLURALITY OF FILES TO A USER EQUIPMENT
    3.
    发明申请
    A BASE STATION AND A METHOD FOR MANAGING THE DISTRIBUTION OF A PLURALITY OF FILES TO A USER EQUIPMENT 审中-公开
    基站和管理向用户设备分发多个文件的方法

    公开(公告)号:WO2017063670A1

    公开(公告)日:2017-04-20

    申请号:PCT/EP2015/073618

    申请日:2015-10-13

    CPC classification number: H04L67/2842 H04W84/045

    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 translation: 本发明涉及被配置为管理多个文件到位于基站的服务区(100a)内的用户设备(111a-c)的分发的基站(100) 100),其中所述多个文件中的每个文件可被分解成多个文件片段。 基站(100)包括:选择器(101),被配置为为位于基站(100)的服务区域(100a)内的多个微基站(109a-d)中的每个微基站选择并且用于 多个文件中的每个文件是文件的多个文件片段的子集; 以及分配器(103),被配置为向所述多个微基站(109a-d)中的每个微基站分配所述多个文件的每个文件用于缓存所述多个文件片段的所选择的子集 在相应的微基站(109a-d)处的多个文件片段可用于由用户设备(111a-c)下载。 此外,本发明涉及一种管理多个文件向位于这种基站的服务区域内的用户设备的分发的方法。

    APPARATUS AND METHOD FOR GENERATING A FROZEN SET ASSOCIATED WITH A POLAR CODE

    公开(公告)号:WO2023046300A1

    公开(公告)日:2023-03-30

    申请号:PCT/EP2021/076444

    申请日:2021-09-27

    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.

    PUNCTURING AND SHORTENING OF POLAR CODES
    5.
    发明申请
    PUNCTURING AND SHORTENING OF POLAR CODES 审中-公开
    极化代码的调整和缩​​短

    公开(公告)号:WO2017194133A1

    公开(公告)日:2017-11-16

    申请号:PCT/EP2016/060730

    申请日:2016-05-12

    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 translation: 用于将K个信息比特编码为长度为N的码字的编码器(400) 基于长度为N的极性码,其中N是2的幂并且大于或等于N. 编码器(400)包括存储多个比特索引的存储器(403),其中多个比特索引包括与长度为N的极性码相关联的一组N个冻结比特索引,一组N / 2个打孔比特索引 和/或一组N / 2个缩短比特索引,以及处理器(401),被配置为从存储器(403)检索多个比特索引的至少一个子集,以使用长度极性码对K个信息比特进行编码 N,用于获得长度为N的编码数据并将编码数据的比特数减少到长度N; 用于获取长度为N的码字。

    AUTOMORPHISM-BASED POLAR ENCODING AND DECODING

    公开(公告)号:WO2022174884A1

    公开(公告)日:2022-08-25

    申请号:PCT/EP2021/053710

    申请日:2021-02-16

    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.

    RATE MATCHING FOR POLAR PRODUCT CODES
    7.
    发明申请

    公开(公告)号:WO2022122166A1

    公开(公告)日:2022-06-16

    申请号:PCT/EP2020/085672

    申请日:2020-12-11

    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.

    CONSTRUCTION OF A POLAR CODE BASED ON A DISTANCE CRITERION AND A RELIABILITY CRITERION, IN PARTICULAR OF A MULTI-KERNEL POLAR CODE

    公开(公告)号:WO2019020182A1

    公开(公告)日:2019-01-31

    申请号:PCT/EP2017/068930

    申请日:2017-07-26

    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 .

    DECODING OF MULTI-KERNEL POLAR CODES
    10.
    发明申请

    公开(公告)号:WO2019007495A1

    公开(公告)日:2019-01-10

    申请号:PCT/EP2017/066747

    申请日:2017-07-05

    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.

Patent Agency Ranking