METHOD FOR ENCODING REAL NUMBER M-ARY SIGNAL AND ENCODING APPARATUS USING SAME

    公开(公告)号:US20180123839A1

    公开(公告)日:2018-05-03

    申请号:US15561904

    申请日:2015-04-21

    Inventor: Hae Chung Han Chung

    Abstract: Disclosed are a real number M-ary signal encoding method, where M is a real number having N time dimensions and L frequency dimensions, and an encoding apparatus using the encoding method. The real number M-ary encoding apparatus according to the present invention comprises a coding unit which codes every K (K is an integer) binary bit units of binary data DATA to generate a first input code and a second input code, a first signal generator which receives the first input code and generates N1 number of M1-ary signals, a second signal generator which receives the second input code and generates N2 number of M2-ary signals, and a first time division multiplexing module which temporally multiplexes the N1 number of M1-ary signals and the N2 number of M2-ary signals to generate a real number M-ary signal which utilizes a voltage ratio a (a=A2/A1) used for M1-ary and M2-ary signals to minimize a transmission error rate.

    Elastic data packer
    54.
    发明授权

    公开(公告)号:US09941899B1

    公开(公告)日:2018-04-10

    申请号:US15681249

    申请日:2017-08-18

    Applicant: Innovium, Inc.

    CPC classification number: H03M7/3082 H03M7/30 H04B7/2606

    Abstract: This disclosure relates to compressing and/or decompressing a group of similar data units, such as a table or queue of data units processed by a networking device or other computing apparatus. Each data unit in the group may only have values for fields in a master set. The described systems are particularly suited for hardware-level processing of groups of sparsely-populated data units, in which a large number of the data units have values for only a small number of the fields. In an embodiment, non-value carrying fields in a data unit are compressed based on a compression profile selected for the data unit. The compression profile indicates, for each master field, whether the compressed data unit includes a value for that field. Non-value carrying fields are omitted from the compressed data unit. The compression profile also permits compression of value-carrying fields using variable-width field lengths specified in the profile.

    Memory compression operable for non-contiguous write/read addresses

    公开(公告)号:US09929744B2

    公开(公告)日:2018-03-27

    申请号:US15782052

    申请日:2017-10-12

    CPC classification number: H03M7/30 G06F3/06 G06F13/00 G06F2212/401 H03M7/6047

    Abstract: Disclosed embodiments include a system having a first memory for storing a plurality of data quantities, each data quantity consisting of a first number of bits, and a second memory for storing a plurality of compressed data quantities, each compressed data quantity consisting of a second number of bits that is less than the first number of bits. The system includes circuitry for reading data quantities from the first memory and for writing compressed data quantities, corresponding to respective read data quantities, to non-sequential addresses in the second memory. The circuitry for reading data quantities from the first memory is for reading along a read orientation selected from one of row-orientation or column-orientation from the first memory, and the circuitry for writing compressed data quantities in the second memory is for writing along a write orientation in the second memory that differs from the read orientation.

    Path compression of a network graph

    公开(公告)号:US09922264B2

    公开(公告)日:2018-03-20

    申请号:US15285906

    申请日:2016-10-05

    Abstract: In an approach to analyzing a path on a graph, a computer receives a graph comprising a plurality of vertices and edges, each edge linking two vertices. The computer, for each one of said plurality of vertices, analyzes edges linked to said one of plurality of vertices to determine a number of outbound links from said one of plurality of vertices, orders said edges, and assigns a value to each ordered edge. The computer, for the graph, receives a path comprising a plurality of edges linking two of said plurality of vertices through at least one other of said plurality of vertices, encodes said path, the encoding using said number of outbound links and said assigned values of each of said one or more edges linking said two of said plurality of vertices, compresses the encoded path, and analyzes said path on said graph using said compressed, encoded path.

    Method and system for coding information

    公开(公告)号:US09900024B2

    公开(公告)日:2018-02-20

    申请号:US14357468

    申请日:2012-11-13

    CPC classification number: H03M7/30 G06F17/16

    Abstract: A method and an apparatus are described for coding information, the method comprising obtaining a list of integers to be encoded; determining a hyper-pyramid having a dimension adapted to encode the list of integers, the hyper-pyramid having a plurality of vertices whose number is determined by the degree of the hyper-pyramid, which is equal to the sum of the integers of the list of integers and by the dimension of the hyper-pyramid which is equal to the number of integers of the list of integers minus one; indexing the list of integers in the hyper-pyramid using an indexing system; and providing an indication of the indexing of the list of integers in the hyper-pyramid.

Patent Agency Ranking