知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

2789 records (took 0.059 seconds)

    DECODERS FOR DECODING A CODEWORD OF A TUNSTALL CODE
    2.
    发明申请
    DECODERS FOR DECODING A CODEWORD OF A TUNSTALL CODE 有权

    公开(公告)号：US20250055478A1

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

    申请号：US18717310

    申请日：2022-12-06

    Applicant: NANYANG TECHNOLOGICAL UNIVERSITY ,  AGENCY FOR SCIENCE, TECHNOLOGY AND RESEARCH

    Inventor： Chunyun CHEN ,  Mohamed Mostafa Sabry ALY ,  Zhe WANG ,  Jie LIN

    IPC: H03M7/30 ,  H03M7/40

    Abstract: A decoder for decoding a codeword of a Tunstall code is provided, including: a sub-decoder configured to receive an input codeword of the Tunstall code to the decoder and output a decoded symbol of the input codeword: a symbol memory configured to receive and store the decoded symbol of the input codeword from the sub-decoder; and a controller configured to control the symbol memory to output one or more decoded symbols stored in the symbol memory. The sub-decoder includes: a node memory configured to store, for a plurality of nodes of a Tunstall tree of the Tunstall code corresponding to a first level of the Tunstall tree, a plurality of codewords of the Tunstall code assigned to the plurality of nodes, respectively: and a comparator configured to compare the input codeword with the plurality of codewords assigned to the plurality of nodes corresponding to the first level of the Tunstall tree received from the node memory and produce the decoded symbol of the input codeword with respect to the first level of the Tunstall tree based on the comparison. Another decoder for decoding a codeword of a Tunstall code is also provided, including: a symbol memory comprising a plurality of memory entries, each memory entry having stored therein one or more decoded symbols of a codeword of the Tunstall code corresponding to the memory entry; and a controller configured to receive an input codeword of the Tunstall code to the decoder and control the symbol memory to output the one or more decoded symbols stored in one of the plurality of memory entries corresponding to the input codeword.

    Huffman packing for delta compression
    5.
    发明授权
    Huffman packing for delta compression 有权

    公开(公告)号：US12199642B2

    公开(公告)日：2025-01-14

    申请号：US17850546

    申请日：2022-06-27

    Applicant: ATI Technologies ULC

    Inventor： Yaser ElSayed ,  Angel Serah ,  Jing Xie

    IPC: H03M7/40 ,  H03M7/30 ,  H03M7/32

    Abstract: Huffman packing for delta compression is described. In accordance with the described techniques, delta values between neighboring elements of a data block are generated using delta compression. The delta values are transformed according to a transformation algorithm. The transformed delta values are packed using Huffman encoding to generate compressed data that corresponds to the data block.

    In-phase and quadrature (I/Q) encoding for variable data rates
    6.
    发明授权
    In-phase and quadrature (I/Q) encoding for variable data rates 有权

    公开(公告)号：US12160311B2

    公开(公告)日：2024-12-03

    申请号：US17628699

    申请日：2019-10-09

    Applicant: Telefonaktiebolaget LM Ericsson (publ)

    Inventor： Glen Rempel ,  Joleen Hind ,  Viktor Ackovik

    IPC: H03M7/40 ,  H03M7/32 ,  H04L1/00 ,  H04L27/00 ,  H04L27/36

    Abstract: According to one or more embodiments, a network node for communicating with at least one radio unit is provided. The network node including processing circuitry configured to: determine at least one code frame characteristic of a non-linear grid, map in-phase and quadrature, I/Q, data to non-linear grid having a plurality of regions that correspond to a plurality of code words where a plurality of bit sizes of the plurality of code words is a function of a radial distance from an origin of the non-linear grid, select a subset of the plurality of code words based at least in part on a target data rate for transmission, and cause transmission of the I/Q data based at least in part on the selected subset of the plurality of code words.

    Efficient update of cumulative distribution functions for image compression
    7.
    发明授权
    Efficient update of cumulative distribution functions for image compression 有权

    公开(公告)号：US12149265B2

    公开(公告)日：2024-11-19

    申请号：US17904030

    申请日：2020-07-06

    Applicant: GOOGLE LLC

    Inventor： Pascal Massimino ,  Vincent Rabaud

    IPC: H03M7/30 ,  H03M7/40 ,  H04N19/91

    Abstract: Updating cumulative distribution functions (CDFs) during arithmetic encoding can be a challenge because the final element of the CDF should remain fixed during the update calculations. If the probabilities were floating-point numbers, this would not be too much of a challenge; nevertheless, the probabilities and hence the CDFs are represented as integers to take advantage of infinite-precision arithmetic. Some of these difficulties may be alleviated by introducing a “mixing” CDF along with the active CDF being updated; the mixing CDF provides nonlocal context for updating the CDF due to the introduction of a particular symbol in the encoding. Improved techniques of performing arithmetic encoding include updating the CDF using two, one-dimensional mixing CDF arrays: a symbol-dependent array and a symbol-dependent array. The symbol-dependent array is a sub array of a larger, fixed array such that the sub array selected depends on the symbol being used.

    METHODS AND DEVICES FOR TREE SWITCHING IN POINT CLOUD COMPRESSION
    8.
    发明申请
    METHODS AND DEVICES FOR TREE SWITCHING IN POINT CLOUD COMPRESSION 有权

    公开(公告)号：US20240380414A1

    公开(公告)日：2024-11-14

    申请号：US18778441

    申请日：2024-07-19

    Applicant: BlackBerry Limited

    Inventor： Sébastien Lasserre ,  Jonathan Taquet ,  Gaëlle Christine Martin-Cocher

    IPC: H03M7/40 ,  H03M7/30

    Abstract: Methods and devices for coding point cloud data using volume trees and predicted-point trees. In one embodiment of the disclosure, a method of encoding a point cloud data to generate a bitstream of compressed point cloud data representing a three-dimensional location of a physical object is provided, the point cloud data being located within a volumetric space. The method includes compressing a first part of the point cloud data represented by a first tree of a first type; determining for a given node of the first tree if an assignation to a second type of tree is enabled, said given node still being processed for the first tree; when the assignation is enabled, compressing a second part of the point cloud data represented by a second tree of the second type wherein, features associated with a root node of the second tree are at least partially obtained from the given node.

    Data compression via binary substitution
    9.
    发明授权
    Data compression via binary substitution 有权

    公开(公告)号：US12136933B2

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

    申请号：US18471178

    申请日：2023-09-20

    Applicant: Anthony Ben Benavides

    Inventor： Anthony Ben Benavides

    IPC: H03M7/40 ,  H03M7/04 ,  H03M7/30

    Abstract: Operations include obtaining a binary source data set and determining a decimal value that represents the source data set. In addition, the operations include determining a Kinetic Data Primer (KDP) that represents the decimal value. The KDP may include a mathematical expression that represents the decimal value. Further, the operations may include storing the KDP as a compressed version of the source data set.

Patent Agency Ranking