Abstract: An apparatus and method are provided for estimating a refined location in dependence on a plurality of measurements of one or more communication channels. The apparatus comprises one or more processors configured to: compress each channel measurement; process the compressed channel measurements using a neural network to form a plurality of intermediate location estimates; and process the intermediate location estimates to form the refined location.

Abstract: A data processing system having a neural network architecture for receiving a binary network input and, in dependence on the binary network input, propagating signals via a plurality of processing nodes, in accordance with respective binary weights, to form a network output, the data processing system being configured to train a node by implementing an error correcting function to identify a set of binary weights which minimize, for a given input to the node, any error between an output of the node when formed in accordance with current binary weights of the node and a preferred output from the node and to update the binary weights of the node to be the identified weights. This training is performed without storing and/or using any higher arithmetic precision weights or other components.

Abstract: The present disclosure relates to a device for generating a polar code xN of length N and dimension K on the basis of a transformation matrix GN of size N×N, wherein the transformation matrix GN is based on a first matrix GN, of size Nr×N, and on a second matrix GNd of size Nd×Nd, wherein N=Nr·Nd, and wherein the polar code xN is given by xN=uN·GN, wherein uN=(u0, . . . uN-1) is a vector of size N, an element ui, i=0, . . . N?1, of the vector corresponding to an information bit if i?I, I being a set of K information bit indices, and ui=0, if i?F, F being a set of N?K frozen bit indices.

Abstract: A number K of N sub-channels that are defined by a code and that have associated reliabilities for input bits at N input bit positions, are to be selected to carry bits that are to be encoded. A localization area that includes multiple sub-channels and is located below fewer than K of the N sub-channels in a partial order of the N sub-channels is determined based on one or more coding parameters. The fewer than K sub-channels of the N sub-channels above the localization area in the partial order are selected, and a number of sub-channels from those in the localization area are also selected. The selected fewer than K sub-channels and the number of sub-channels selected from those in the localization area together include K sub-channels to carry the bits that are to be encoded.

Abstract: A number K of N sub-channels that are defined by a code and that have associated reliabilities for input bits at N input bit positions, are to be selected to carry bits that are to be encoded. A localization area that includes multiple sub-channels and is located below fewer than K of the N sub-channels in a partial order of the N sub-channels is determined based on one or more coding parameters. The fewer than K sub-channels of the N sub-channels above the localization area in the partial order are selected, and a number of sub-channels from those in the localization area are also selected. The selected fewer than K sub-channels and the number of sub-channels selected from those in the localization area together include K sub-channels to carry the bits that are to be encoded.

Abstract: A method for generating a polar code cN of length N and dimension K, on the basis of a generator matrix GN of size N×N, is provided. The method includes generating a distance spectrum vector dTp=(dTp(1), . . . , dTp(p)) of size p of the kernel Tp, wherein dTp(h), h=1, . . . , p, corresponds to a maximum value among all possible minimum distances of all possible polar codes of size p and dimension h generated on the basis of the kernel Tp. The method also includes generating a distance spectrum vector dGN of size N of the generator matrix GN on the basis of the distance spectrum vector dTp, determining the set of K information bit indices I on the basis of the distance spectrum vector dGN, and generating the polar code cN on the basis of the set of K information bit indices I.

Abstract: Encoding of information bit sequences by use of an encoding device having more than two encoding entities is provided. Decoding of output codewords by a decoding device having more than two decoding entities is further provided. The encoding and the decoding are implemented through transmitting output codewords, generated by the encoding device, to the decoding device via a channel, wherein two or more user devices transmit the respective output codewords concurrently via the channel.

Abstract: The present disclosure relates to a device for generating a polar code xN of length N and dimension K on the basis of a transformation matrix GN of size N×N, wherein the transformation matrix GN is based on a first matrix GN, of size Nr×N, and on a second matrix GNd of size Nd×Nd, wherein N=Nr·Nd, and wherein the polar code xN is given by xN=uN·GN, wherein uN=(u0, . . . uN-1) is a vector of size N, an element ui, i=0, . . . N?1, of the vector corresponding to an information bit if i?I, I being a set of K information bit indices, and ui=0, if i?F, F being a set of N?K frozen bit indices.

Abstract: An encoder for encoding K information bits into a code word of length N? on the basis of a polar code of length N is provided, wherein N is a power of 2 and greater than or equal to N?. The encoder comprises a memory storing a plurality of bit indices, which 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 configured to retrieve at least a subset of the plurality of bit indices from the memory, 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: A method for generating a polar code cN of length N and dimension K, on the basis of a generator matrix GN of size N×N, is provided. The method includes generating a distance spectrum vector dTp=(dTp(1), . . . , dTp(p)) of size p of the kernel Tp, wherein dTp(h),h=1, . . . , p, corresponds to a maximum value among all possible minimum distances of all possible polar codes of size p and dimension h generated on the basis of the kernel Tp. The method also includes generating a distance spectrum vector dGN of size N of the generator matrix GN on the basis of the distance spectrum vector dTp, determining the set of K information bit indices I on the basis of the distance spectrum vector dGN, and generating the polar code cN on the basis of the set of K information bit indices I.

Abstract: Encoding of information bit sequences by use of an encoding device having more than two encoding entities is provided. Decoding of output codewords by a decoding device having more than two decoding entities is further provided. The encoding and the decoding are implemented through transmitting output codewords, generated by the encoding device, to the decoding device via a channel, wherein two or more user devices transmit the respective output codewords concurrently via the channel.

Abstract: Encoder 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 comprises a memory 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 configured to retrieve at least a subset of the plurality of bit indices from the memory, 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: A number K of N sub-channels that are defined by a code and that have associated reliabilities for input bits at N input bit positions, are to be selected to carry bits that are to be encoded. A localization area that includes multiple sub-channels and is located below fewer than K of the N sub-channels in a partial order of the N sub-channels is determined based on one or more coding parameters. The fewer than K sub-channels of the N sub-channels above the localization area in the partial order are selected, and a number of sub-channels from those in the localization area are also selected. The selected fewer than K sub-channels and the number of sub-channels selected from those in the localization area together include K sub-channels to carry the bits that are to be encoded.

Abstract: A method is provided for decoding a signal received by a receiver including at least one reception antenna. The method includes: selecting, among at least two techniques available in the receiver, a decoding technique representative of a space/time encoding implemented upon transmission; and decoding the signal using the selected decoding technique. The selecting step takes into account at least one selection criterion.

Abstract: A method is provided for decoding a signal received by a receiver including at least one reception antenna. The method includes: selecting, among at least two techniques available in the receiver, a decoding technique representative of a space/time encoding implemented upon transmission; and decoding the signal using the selected decoding technique. The selecting step takes into account at least one selection criterion.