中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

2276 records (took 0.025 seconds)

    DECODING WITH SELECTIVE ITERATIVE DECODING SKIPPING
    3.
    发明公开
    DECODING WITH SELECTIVE ITERATIVE DECODING SKIPPING 审中-公开

    公开(公告)号：US20240154649A1

    公开(公告)日：2024-05-09

    申请号：US18498778

    申请日：2023-10-31

    Applicant: SAMSUNG ELECTRONICS CO., LTD.

    Inventor： Yoochang Eun

    IPC: H04B7/0413 ,  H04L1/00

    CPC classification number: H04B7/0413 ,  H04L1/005 ,  H04L1/0063

    Abstract: An operating method of a decoder device, included in a reception device of a multiple input multiple output (MIMO) communication system, includes receiving a transport block including a plurality of code blocks from a transmission device, performing sequential decoding on the plurality of code blocks and performing iterative decoding by up to a maximum iteration number on each of the plurality of code blocks, monitoring a result of the sequential decoding in real time to generate a count value of a decoding fail number, and determining whether to activate selective skipping of the iterative decoding or selective skipping of the sequential decoding on one or more remaining code blocks of the transport block, based on the count value.

    Data encoding and decoding method for underwater acoustic networks (UANs) based on improved online fountain code
    7.
    发明授权
    Data encoding and decoding method for underwater acoustic networks (UANs) based on improved online fountain code 有权

    公开(公告)号：US11722245B2

    公开(公告)日：2023-08-08

    申请号：US17971408

    申请日：2022-10-21

    Applicant: Qinghai Normal University

    Inventor： Xiuxiu Liu ,  Xiujuan Du ,  Long Jin

    IPC: H04L1/00 ,  H04B13/02

    CPC classification number: H04L1/005 ,  H04B13/02 ,  H04L1/0061

    Abstract: A data encoding and decoding method for underwater acoustic networks (UANs) based on an improved online fountain code, including: in a build-up phase, subjecting all original packets to sequential encoding according to their serial numbers to generate and send encoded packets with degree 2; merging k original packets to k/8 connected components with a size of 8; performing random encoding until a largest connected component is successfully decoded; in a completion phase, sending, by a receiver, a feedback packet according to a current decoding graph; according to a feedback packet containing decoding states of all the original packets, sending, by a sender, encoded packets with degree m; and randomly selecting original packets for recursive encoding to generate and send encoded packets with degree 1 or 2; and setting, by the receiver, a threshold to restrict the number of feedback packets.

    2D probalistic constellation shaping using shell mapping
    8.
    发明授权
    2D probalistic constellation shaping using shell mapping 有权

    公开(公告)号：US11711148B2

    公开(公告)日：2023-07-25

    申请号：US16354115

    申请日：2019-03-14

    Applicant: Infinera Corporation

    Inventor： Mehdi Torbatian ,  Han Henry Sun ,  Kuang-Tsan Wu

    IPC: H04B10/516 ,  H04B10/50 ,  H04L1/00 ,  H04L27/34 ,  H04L27/36

    CPC classification number: H04B10/503 ,  H04B10/516 ,  H04L1/005 ,  H04L1/0052 ,  H04L27/3483 ,  H04L27/363

    Abstract: Probabilistic constellation shaping (PCS) is applied to a desired probability distribution over the 2-D constellation points. Constellation points are partitioned into multiple disjoint sets in which all the constellation points within a subset have the same energy level (i.e., amplitude) or distance from the origin on the complex plane. Each of the sets may be further subdivided into smaller disjoint sets of constellation points to facilitate labeling of the constellation points. The sets may be indexed from 0 to the total number of disjoint sets to form an index set. The desired distribution may then be applied over the index set either using a distribution matcher (DM) or using a lookup table. The desired distribution may be generated before forward error correction (FEC) encoding that preserves the generated amplitude distribution through FEC encoding of data bits. The scheme may map the FEC encoded data bits to the constellation points, such that the probability of occurrence of each signal set (with a specific energy level) follows the desired probability distribution within a fixed codeword length. In addition, PCS can be applied to both square and non-square constellations, which may or may not be arranged on a Cartesian grid.

    Decoding Signals By Guessing Noise
    9.
    发明申请
    Decoding Signals By Guessing Noise 审中-公开

    公开(公告)号：US20190199473A1

    公开(公告)日：2019-06-27

    申请号：US16026811

    申请日：2018-07-03

    Applicant: Massachusetts Institute of Technology ,  National University of Ireland, Maynooth

    Inventor： Muriel MEDARD ,  Kenneth R. DUFFY ,  Jiange LI

    IPC: H04L1/00 ,  H03M13/37

    CPC classification number: H04L1/0054 ,  H03M13/37 ,  H04L1/005 ,  H04L1/0057 ,  H04L1/0065

    Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

    Decoding Signals Codes by Guessing Noise
    10.
    发明申请
    Decoding Signals Codes by Guessing Noise 审中-公开

    公开(公告)号：US20190199377A1

    公开(公告)日：2019-06-27

    申请号：US16026822

    申请日：2018-07-03

    Applicant: Massachusetts Institute of Technology ,  National University of Ireland, Maynooth

    Inventor： Muriel MEDARD ,  Kenneth R. DUFFY

    IPC: H03M13/29 ,  H04L1/00

    CPC classification number: H04L1/0054 ,  H03M13/37 ,  H04L1/005 ,  H04L1/0057 ,  H04L1/0065

    Abstract: Devices and methods described herein decode a sequence of coded symbols by guessing noise. In various embodiments, noise sequences are ordered, either during system initialization or on a periodic basis. Then, determining a codeword includes iteratively guessing a new noise sequence, removing its effect from received data symbols (e.g. by subtracting or using some other method of operational inversion), and checking whether the resulting data are a codeword using a codebook membership function. This process is deterministic, has bounded complexity, asymptotically achieves channel capacity as in convolutional codes, but has the decoding speed of a block code. In some embodiments, the decoder tests a bounded number of noise sequences, abandoning the search and declaring an erasure after these sequences are exhausted. Abandonment decoding nevertheless approximates maximum likelihood decoding within a tolerable bound and achieves channel capacity when the abandonment threshold is chosen appropriately.

Patent Agency Ranking