-
公开(公告)号：US20180241591A1
公开(公告)日：2018-08-23
申请号：US15550922
申请日：2016-02-15
Applicant: INSTITUT MINES TELECOM
Inventor： Ghaya REKAYA-BEN OTHMAN , Asma MEJRI
Abstract: A method, device, and a computer program are provided to decode a signal received through a transmission channel in a communication system, the received signal being represented by a signal vector. The method comprises: calculating an initial estimate of a transmitted symbol vector carried by the received signal vector; calculating a bound parameter (201) from a linear function of the initial estimate of the transmitted symbol vector, the linear function being defined by a slope coefficient and an intercept coefficient, the method further comprising: determining estimated symbols representative of the transmitted symbols carried by the received signal, the estimated symbols being determined from a set of candidate lattice points, each lattice point comprising a set of components, each component of a candidate lattice point being searched in a search interval (203), the search interval having at least one search interval bound computed from the bound parameter; determining (205) the estimated symbols from the closest lattice point to the received signal vector among the candidate lattice points.
-
公开(公告)号：US20180191532A1
公开(公告)日：2018-07-05
申请号：US15580096
申请日：2016-06-07
Applicant: INSTITUT MINES-TELECOM
Inventor： Asma MEJRI , Ghaya REKAYA-BEN OTHMAN
IPC: H04L25/03
Abstract: There is provided a decoder for decoding a data signal received through a transmission channel in a communication system, the decoder (310) comprising a symbol estimation unit (311) configured to determine estimated symbols representative of the transmitted symbols carried by the received signal, the estimated symbols being determined from nodes of a decoding tree based on a weight metric associated with each of the node. The decoder further comprises a termination alarm monitoring unit (312) for monitoring a termination alarm depending on the current decoding computation complexity, the termination alarm being associated with a metric parameter, the symbol estimation unit being configured to reduce the weight metric of each node of the decoding tree by a quantity corresponding to a function of the metric parameter associated with the termination alarm, in response to the triggering of the termination alarm.
-
公开(公告)号：US20180145852A1
公开(公告)日：2018-05-24
申请号：US15580141
申请日：2016-06-07
Applicant: INSTITUT MINES-TELECOM
Inventor： Asma MEJRI , Ghaya REKAYA-BEN OTHMAN
IPC: H04L25/03
Abstract: There is provided a decoder (310) for sequentially decoding a data signal received through a transmission channel in a communication system, the received data signal carrying transmitted symbols, the decoder comprising a symbol estimation unit (311) configured to determine estimated symbols representative of the transmitted symbols carried by the received signal from information stored in a stack, the stack being filled by iteratively 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 the received data signal and each node being associated with a predetermined metric, the stack being filled at each iteration with at least some of the expanded child nodes and being ordered by increasing values of the metrics associated with the nodes, the selected node for each iteration corresponding to the node having the lowest metric in the stack. The decoder further comprises a stack reordering activation monitoring unit (313) configured to monitor at least one stack reordering activation condition and, in response to a stack reordering activation condition being verified, to cause the symbol estimation unit to: reduce the metric associated with each node stored in the stack by a quantity, reorder the stack by increasing value of the reduced metric, and remove a set of nodes from the reordered stack so as to maintain a number N of nodes in the reordered stack, the maintained nodes corresponding to the N nodes having the lowest metrics in the reordered stack.
-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：US20160226527A1
公开(公告)日：2016-08-04
申请号：US15026433
申请日：2014-09-29
Applicant: INSTITUT MINES-TELECOM
Inventor： Asma MEJRI , Ghaya REKAYA-BEN OTHMAN
CPC classification number: H03M13/3916 , H03M13/616 , H03M13/63 , H04L1/0076 , H04L1/06 , H04L25/03171 , H04L2001/0097
Abstract: The invention relates to a MAP decoding method of a signal received through a noisy channel, the signal being composed of symbols in an alphabet having a non-uniform probability distribution, the symbols being represented by points in a lattice (Λ). The probability distribution of symbols is modeled using a Gaussian distribution. An augmented lattice (Λexp) is formed from the lattice (Λ) and the ratio (β) between variance of the noise and variance of the Gaussian distribution of symbols. Therefore, the disclosed MAP decoding method consists essentially of decoding using an ML criterion searching the point in the augmented lattice closest to the point representative of the received signal (yexp).
Abstract translation: 本发明涉及通过噪声信道接收的信号的MAP解码方法，该信号由具有不均匀概率分布的字母表中的符号组成，该符号由格（Λ）中的点表示。 符号的概率分布使用高斯分布进行建模。 增益格（Λexp）由格（Λ）形成，噪声方差与符号高斯分布方差之间的比率（β）形成。 因此，所公开的MAP解码方法基本上包括使用搜索最接近代表接收信号的点的扩充格子中的点的ML标准进行解码（yexp）。
-
公开(公告)号：US20180083732A1
公开(公告)日：2018-03-22
申请号：US15568177
申请日：2016-04-27
Applicant: INSTITUT MINES-TELECOM
Inventor： Ghaya REKAYA-BEN OTHMAN , Asma MEJRI , Mohammed-Achraf KHSIBA
Abstract: There is provided a method of generating a space-time block code (STBC) for encoding a digital data sequence comprising a set of independent symbols to be transmitted through a transmission channel in a communication system, the space-time block code being represented by a set of linear dispersion matrices in a linear dispersion representation, each linear dispersion matrix comprising components having complex values, the method comprising, generating at least some of the linear dispersion matrices depending on component-wise conditions related to a set of selected pairs of the linear dispersion matrices, each pair comprising a first linear dispersion matrix and a second linear dispersion matrix, said component-wise conditions comprising a component-wise condition between the components of the first linear dispersion matrix and the components of the second linear dispersion matrix.
-
7.发明申请公开(公告)号：US20170264392A1
公开(公告)日：2017-09-14
申请号：US15514576
申请日：2015-09-28
Applicant: INSTITUT MINES TELECOM
Inventor： Asma MEJRI , Ghaya REKAYA-BEN OTHMAN
CPC classification number: H04L1/0052 , H04L1/0054 , H04L25/03197 , H04L25/03203 , H04L25/03891 , H04L27/38 , H04L2025/03426
Abstract: Methods, systems, and computer program products for decoding a received data signal in a communication system by iteratively constructing a decoding tree, each node of said decoding tree corresponding to a component of a symbol of said data signal, and being associated with a metric, the construction of the decoding tree implementing at least one iteration of the following steps, for a current node of the tree stored in the top of a stack: generating (102) a reference child node of said current node from said vector representing the received data signal, from the reference child node, generating (106) a first neighbor child node by subtracting a positive integer parameter from the value of the reference node, and a second neighbor child node by adding said positive integer parameter to the value of the reference child node; storing (108) in said stack three child nodes deriving from the reference child node and from said first and second neighbor child nodes, each child node being stored in the stack in association with node information comprising a predetermined metric, the nodes in the stack being ordered by increasing values of metrics; removing (109) the current node from said stack; selecting (111) the top node of said stack as the new current node; wherein said method further comprises determining an estimation of said data signal from the node information stored in said stack.
-
8.发明申请公开(公告)号：US20170264367A1
公开(公告)日：2017-09-14
申请号：US15508775
申请日：2015-09-04
Applicant: INSTITUT MINES-TELECOM
Inventor： Elie AWWAD , Ghaya REKAYA-BEN OTHMAN , Yves JAOUEN
IPC: H04B10/2581 , H04B7/0413 , H04B10/079
CPC classification number: H04B10/2581 , H04B7/0413 , H04B10/0795 , H04J14/04
Abstract: The invention relates to a mode selection method for a system for MIMO transmission on an optical fiber of multimode type. It comprises a step of measuring the transfer matrix of the transmission channel made up of a set of modes of the optical fiber (110), a step of transforming (120) the transfer matrix into a block diagonal matrix, each block being associated with a mode subset, a step of determining (130) the gain and/or the transmission capacity for each of the mode subsets, and a selection (140) of the mode subset corresponding to the highest gain and/or capacity, the MIMO transmission system then using only the modes of the subset thus selected to transmit on the optical fiber.The invention relates also to a core selection method for a system for MIMO transmission on optical fiber of multicore type.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.014 seconds)
