公开(公告)号：US20170294986A1

公开(公告)日：2017-10-12

申请号：US15475400

申请日：2017-03-31

Applicant: INSTITUT MINES-TELECOM

Inventor： Mohamed-Achraf KHSIBA ,  Ghaya REKAYA BEN-OTHMAN

IPC: H04L1/00 ,  H04L25/02 ,  H04L5/00

CPC classification number: H04L1/0054 ,  H04B7/0413 ,  H04L1/0048 ,  H04L5/006 ,  H04L25/0242 ,  H04L25/03242

Abstract: Embodiments of the invention provide a decoder for decoding a signal received through a transmission channel in a communication system, said signal comprising a vector of information symbols, said transmission channel being represented by a channel matrix, wherein the decoder comprises: an initial radius determination unit (307) configured to determine an initial radius; a symbol estimation unit (309) configured to iteratively determine a current radius to search a lattice point inside a current spherical region defined by said current radius, said current radius being initially set to said initial radius, said symbol estimation unit (309) being configured, for each lattice point found in said current spherical region, to store said lattice point in association with a metric, said symbol estimation unit (309) being further configured to update said current radius using a linear function, said linear function having a slope parameter strictly inferior to one, The decoder being configured to determine at least one estimate of said vector of information symbols from at least one of the lattice points found by the symbol estimation unit (309).

公开(公告)号：US20170195052A1

公开(公告)日：2017-07-06

申请号：US15322612

申请日：2015-06-26

Applicant: INSTITUT MINES-TELECOM

Inventor： Elie AWWAD ,  Ghaya REKAYA-BEN OTHMAN ,  Yves JAOUEN

IPC: H04B10/2581

CPC classification number: H04B10/2581 ,  H04B10/2507 ,  H04J14/04

Abstract: The invention relates to a system and a method for transmission over optical fiber (130) with mode or core scrambling. The system comprises a spatio-temporal encoder (110) and a plurality of modulators (1251, . . . , 125n) associated, respectively, with separate propagation modes or cores of said fiber, each modulator modulating a laser beam. Said fiber comprises a plurality of slices (1301, . . . , 130L), an amplifier (140l) being provided between any two consecutive slices of the optical fiber. A mode scrambler (150l) is associated with each amplifier in order to perform a permutation of said modes between at least two consecutive slices.

公开(公告)号：US20170187433A1

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

申请号：US15389765

申请日：2016-12-23

Applicant: INSTITUT MINES-TELECOM

Inventor： Mohammed-Achraf KHSIBA ,  Ghaya REKAYA BEN-OTHMAN ,  Asma MEJRI

IPC: H04B7/04 ,  H04L27/26 ,  H04B7/06

CPC classification number: H04B7/0413 ,  H04B7/0697 ,  H04L1/0031 ,  H04L1/0643 ,  H04L25/03006 ,  H04L27/2649 ,  H04W84/042 ,  H04W84/12

Abstract: Embodiments of the invention provide a decoder for decoding a signal represented by a vector of information symbols received through a transmission channel in a communication system, said the transmission system being represented by a channel state matrix, said information symbols being selected from a given set of values carrying a set of information bits, wherein said decoder comprises: a division unit (202) configured to divide the channel state matrix into a number of sub-blocks of column vectors, in accordance with a division of said vector of information symbols into a number of sub-vectors; a permutation unit (203) configured to determine a set of permuted channel state matrices by permuting said sub-blocks of column vectors, the permutation unit (203) being further configured to select at least one permuted channel state matrix among said set of permuted channel state matrices according to a selection criterion; a sub-block decoding unit (207) configured to determine a transformed signal from said signal and said at least one permuted channel state matrix and determine at least one estimate of each sub-vector of information symbols from said transformed signal by applying at least one iteration of a decoding algorithm; The decoder being configured to determine at least one estimate of a vector of transmitted information symbols from said at least one estimate of each sub-vector of information symbols.

公开(公告)号：US20170187432A1

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

申请号：US15389612

申请日：2016-12-23

Applicant: INSTITUT MINES-TELECOM

Inventor： Asma MEJRI ,  Mohammed-Achraf KHSIBA ,  Ghaya REKAYA BEN-OTHMAN

IPC: H04B7/04 ,  H04L27/26 ,  H04B7/06

CPC classification number: H04B7/0413 ,  H04B7/0697 ,  H04L1/04 ,  H04L1/06 ,  H04L25/03 ,  H04L27/2649 ,  H04W84/042 ,  H04W84/12

Abstract: Embodiments of the invention provide a decoder for decoding a data signal received through a transmission channel in a communication system, said transmission channel being represented by an upper triangular matrix, said signal carrying transmitted symbols, each symbol carrying a set of information bits, wherein said decoder comprises: a processing unit (213) configured to determine at least one sub-block decoding parameter given a target quality of service metric; A sub-block decoding unit (214) configured to divide said data signal into a number of sub-vectors based on said at least one sub-block decoding parameter in accordance with a division of said upper triangular matrix into a number of sub-matrices, said sub-block decoding unit (214) being further configured to determine at least one estimate of each sub-vector of transmitted symbols from said sub-vectors, and determine an estimate of the transmitted symbols from said estimates.

公开(公告)号：US20170149932A1

公开(公告)日：2017-05-25

申请号：US15316632

申请日：2015-06-08

Applicant: Institut Mines-Telecom

Inventor： Dario Rossi ,  Giuseppe Rossini

IPC: H04L29/08 ,  H04L12/813

Abstract: The present invention relates to a method for managing packets in a network of Information Centric Networking (ICN) nodes (1, 2a, 2b, 2c, 2d, 2e), the method comprising:—at a first node (1), performing steps of: ∘ Receiving a request (i) for a data packet (C), and if the data packet (C) is stored, responding to the request (i) by forwarding the data packet (C); otherwise ∘ sending to at least one neighboring node (2a, 2b) of the network a request (i′) for meta-data packets (@), a meta-data packet (@) indicating availability of said data packet (C) at a target node; ∘ receiving in response at least one meta-data packet (@), so as to identify at least one target node (2c, 2e) wherein said data packet (C) is available; ∘ forwarding the request (i) for said data packet (C) toward one selected target node (2c);—at a second node (2a, 2b, 2c, 2d, 2e), performing steps of: ∘ Receiving a request (i′) for meta-data packets (@), and if the data packet (C) is stored, responding to the request (i′) by forwarding a meta-data packet (@) indicating availability of said data packet (C) at the second node (2c, 2e); otherwise ∘ forwarding to at least one neighboring node (2c, 2d, 2e) of the network the request (i′) for meta-data packets (@).

公开(公告)号：US20170149533A1

公开(公告)日：2017-05-25

申请号：US15355311

申请日：2016-11-18

Applicant: INSTITUT MINES-TELECOM

Inventor： Asma MEJRI ,  Mohammed-Achraf KHSIBA ,  Ghaya REKAYA BEN-OTHMAN

IPC: H04L1/00 ,  H04L25/03

CPC classification number: H04L1/0052 ,  H04L25/03184 ,  H04L25/03191 ,  H04L25/03203 ,  H04L25/03305 ,  H04L25/03891

Abstract: There is provided a decoder for sequentially decoding a data signal received through a transmission channel in a communication system, said data signal carrying transmitted symbols, said decoder comprising a symbol estimation unit (301) configured to determine estimated symbols representative of the transmitted symbols carried by the received signal from information stored in a stack, said symbol estimation unit (301) being configured to iteratively fill the stack by expanding child nodes of a selected node of a decoding tree comprising a plurality of nodes, each node of the decoding tree corresponding to a candidate component of a symbol of said data signal and each node being assigned a metric, the stack being filled at each iteration with a set of expanded child nodes and being ordered by increasing values of the metrics assigned to the nodes, the selected node for each iteration corresponding to the node being assigned the lowest metric in the stack, the decoder comprising a metric determination unit (302) configured to determine an initial metric for each child node of said set of expanded child nodes, wherein the decoder further comprises a modified metric calculation unit (303) configured to calculate a modified metric for at least one of the expanded child nodes from the metric associated with said expanded child node and a weighting coefficient, said weighting coefficient being a function of the level of said node in the decoding tree, the decoder assigning said modified metric to said at least one of the expanded child nodes.

公开(公告)号：US20170054627A1

公开(公告)日：2017-02-23

申请号：US15307785

申请日：2015-04-29

Applicant: INSTITUT MINES-TELECOM

Inventor： Dario ROSSI ,  Giuseppe ROSSINI ,  Emilio LEONARDI ,  Michele GARETTO

IPC: H04L12/759 ,  G06F12/0811

CPC classification number: H04L45/028 ,  G06F12/0811 ,  G06F12/0862 ,  G06F12/0897 ,  G06F2212/1024 ,  G06F2212/6024 ,  G06F2212/608

Abstract: The present invention relates to an ICN router (1), comprising a first cache layer (L1) and a second cache layer (L2), the first cache layer (L1) comprising a first content memory (11) and the second cache layer (L2) comprising a second content memory (21), the second content memory (21) having a higher capacity but a slower access speed than the first content memory (11), the router (1) being configured so that the first cache layer (L1) is adapted to fetch data from second cache layer (L2) when the router (1) is requested to output said data, characterized in that the first content memory (11) presents a first block size and the second content memory (21) presents a second block size, the second block size being higher that the first block size, the first content memory (11) comprising a swap area (110) through which the first content memory (11) is connected to the second content memory (21), the swap area (110) being adapted for individually serving blocks at the first block size as parts of blocks at the second size fetched from the second content memory (21).

Abstract translation: 本发明涉及一种包括第一高速缓存层（L1）和第二高速缓存层（L2）的ICN路由器（1），第一高速缓存层（L1）包括第一内容存储器（11）和第二高速缓存层 L2）包括第二内容存储器（21），所述第二内容存储器（21）具有比所述第一内容存储器（11）更高的容量但更慢的访问速度，所述路由器（1）被配置为使得所述第一高速缓存层 当所述路由器（1）被请求输出所述数据时，L1）适于从第二高速缓存层（L2）获取数据，其特征在于，所述第一内容存储器（11）呈现第一块大小，并且所述第二内容存储器（21） 呈现第二块大小，第二块大小高于第一块大小，第一内容存储器（11）包括交换区域（110），第一内容存储器（11）通过其交换到第二内容存储器（21） ），所述交换区域（110）适于以第一块大小a单独地服务块 从第二内容存储器（21）提取的具有第二大小的块的部分块。

公开(公告)号：US20150365229A1

公开(公告)日：2015-12-17

申请号：US14764955

申请日：2014-01-30

Applicant: MORPHO ,  INSTITUT MINES TELECOM

Inventor： Alain Patey ,  Herve Chabanne ,  Gerard Cohen

IPC: H04L9/00 ,  H04L9/08

CPC classification number: H04L9/008 ,  H04L9/0869 ,  H04L9/304 ,  H04L9/3231

Abstract: The invention concerns a method for encrypting a binary data item characterised in that it comprises the steps consisting of: —generating a public key and a private key, the public key being a sparse matrix comprising m rows and n columns, m being greater than the number I of bits of the binary data item, I being an integer strictly greater than 1, and the private key being a set of I indexed sets of integers between 1 and m such that for each set, the sum of the elements of the rows of the sparse matrix indexed by the elements of a set is zero, and—generating a binary sequence b comprising m bits, such that b=Mx+e+y in which o x is a random binary vector, o e is a random binary noise vector, and o y is a linear encoding of data item c. The invention also concerns a method for calculating a Hamming distance on data encrypted by the method of encryption.

Abstract translation: 本发明涉及一种用于加密二进制数据项的方法，其特征在于它包括以下步骤： - 产生公共密钥和私有密钥，所述公共密钥是包括m行和n列的稀疏矩阵，m大于 二进制数据项的位数I，I是严格大于1的整数，私钥是1和m之间的I索引整数集的集合，使得对于每个集合，行的元素之和 由集合的元素索引的稀疏矩阵为零，并且生成包括m位的二进制序列b，使得b = Mx + e + y，其中ox是随机二进制向量，oe是随机二进制噪声向量 而oy是数据项目c的线性编码。 本发明还涉及一种用于通过加密方法加密的数据计算汉明距离的方法。

公开(公告)号：US20250148366A1

公开(公告)日：2025-05-08

申请号：US18837306

申请日：2023-02-09

Applicant: PREDISURGE ,  INSTITUT MINES-TELECOM ,  ASSOCIATION POUR LA RECHERCHE ET LE DEVELOPPPEMENT DE METHODES ET PROCESSUS INDUSTRIELS - ARMINES

Inventor： Beatrice BISIGHINI ,  Miquel AGUIRRE ,  Baptiste PIERRAT ,  Stéphane AVRIL ,  David PERRIN

IPC: G06N20/00

Abstract: A method for training a machine learning system, including: based on at least one image dataset representing at least one portion of the hollow structure, calculating a signed distance field of each portion and calculating at least one geometrical parameter of each portion; generating a deployed in-use representation of the device by computing contact forces between the device and each portion based on the signed distance field and by applying these contact forces to a geometrical representation of the device; and training the machine learning system with each calculated geometrical parameter as an input and the corresponding deployed in-use representation as an associated target output, the obtained trained machine learning system being configured to receive as input at least one geometrical parameter and provide as output the deployed in-use representation of the device.

公开(公告)号：US20250088648A1

公开(公告)日：2025-03-13

申请号：US18758390

申请日：2024-06-28

Applicant: SISVEL TECHNOLOGY S.R.L. ,  UNIVERSITÀ DEGLI STUDI DI TORINO ,  INSTITUT MINES TELECOM

Inventor： Alberto Presta ,  Attilio Fiandrotti ,  Enzo Tartaglione ,  Marco Grangetto

IPC: H04N19/42 ,  G06N3/0455 ,  H04N19/124 ,  H04N19/91

Abstract: A method for learned image compression implemented in an autoencoder including a learnable encoder and a decoder, the method including: a) extracting from an image a latent space by the learnable encoder; b) quantizing the latent space by a quantizer to obtain a quantized latent space; c) entropy coding the quantized latent space by an entropy encoder to obtain a bitstream, wherein an entropy model used to encode the latent space is represented by a probability distribution; d) entropy decoding the bitstream by an entropy decoder to obtain an entropy decoded bitstream; e) feeding the entropy decoded bitstream to the decoder; f) recover a reconstructed image by the decoder; g) training the autoencoder via standard gradient descent of the backpropagated error gradient by finding learnable parameters of the learnable encoder and of the decoder that minimize a rate distortion cost function, wherein the entropy encoder is based on a differentiable formulation of a soft frequency counter.