Sequential decoding with stack reordering

    公开(公告)号:US10511461B2

    公开(公告)日:2019-12-17

    申请号:US15580141

    申请日:2016-06-07

    IPC分类号: H04L25/03 H03M13/39 H03M13/00

    摘要: 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.

    Methods and systems for decoding a data signal based on the generation of a decoding tree

    公开(公告)号:US10484133B2

    公开(公告)日:2019-11-19

    申请号:US15514576

    申请日:2015-09-28

    IPC分类号: H04L1/00 H04L25/03 H04L27/38

    摘要: A decoder or a decoding method for decoding a data signal is provided by iteratively constructing a decoding tree comprising nodes, each representing a component of a symbol of a data signal, each iteration comprising, for a current node of the tree stored in the top of the stack; generating a reference child node of the current node from the data signal; from the reference child node, generating a first and second neighbor child nodes by subtracting/adding a positive integer parameter from/to the value of the reference node; storing in the stack three child nodes derived from the reference, first and second neighbor child nodes, the nodes stored in the stack being ordered by increasing values of a node metric; removing the current node stack; selecting the top node of the stack as the new current node. The data signal is estimated from the stack node information.

    Space-time coding for communication systems

    公开(公告)号:US10833801B2

    公开(公告)日:2020-11-10

    申请号:US15568177

    申请日:2016-04-27

    摘要: 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.

    Anticipated termination for sequential decoders

    公开(公告)号:US10812299B2

    公开(公告)日:2020-10-20

    申请号:US15580096

    申请日:2016-06-07

    IPC分类号: H04L25/03 H03M13/39

    摘要: 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.

    Tree search-based decoding
    5.
    发明授权

    公开(公告)号:US10735224B2

    公开(公告)日:2020-08-04

    申请号:US15550922

    申请日:2016-02-15

    摘要: 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.

    Method for selecting modes for transmission over multimode or multicore optical fibres

    公开(公告)号:US10122461B2

    公开(公告)日:2018-11-06

    申请号:US15508775

    申请日:2015-09-04

    摘要: 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.

    Map decoding method using augmented lattices

    公开(公告)号:US10340956B2

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

    申请号:US15026433

    申请日:2014-09-29

    摘要: 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).