Variable run length encoding of a bit stream
    1.
    发明授权
    Variable run length encoding of a bit stream 有权
    位流的可变游程长度编码

    公开(公告)号:US09484949B1

    公开(公告)日:2016-11-01

    申请号:US14682227

    申请日:2015-04-09

    CPC classification number: H03M5/145 H03M7/4037 H04L25/4908

    Abstract: An apparatus and method for encoding data are disclosed that may allow for variable run length encoding of data to be transmitted. An ordered stream of data bits is received from a logic circuit, and N sequential data bits of the stream are selected, where N is a positive integer. Of the N sequential data bits, M sequential data bits are selected, wherein M is a positive integer less than N. The M sequential data bits are then encoded to generate a code word that includes P data bits, wherein P is a positive integer greater than M and less than N. The code word is then concatenated with a subset of the N sequential data bits that excludes the M sequential data bits to form a transmission word. A transmit unit then sends the data bits of the transmission word in a serial fashion.

    Abstract translation: 公开了一种用于编码数据的装置和方法,其可以允许要发送的数据的可变行程长度编码。 从逻辑电路接收有序的数据位流,并且选择流的N个顺序数据位,其中N是正整数。 在N个顺序数据位中,选择M个顺序数据位,其中M是小于N的正整数。然后对M个顺序数据位进行编码,以产生包含P个数据位的代码字,其中P是更大的正整数 并且小于N.然后将代码字与排除M个顺序数据位的N个顺序数据位的子集连接以形成传输字。 然后,发送单元以串行方式发送传输字的数据位。

    VARIABLE RUN LENGTH ENCODING OF A BIT STREAM
    2.
    发明申请
    VARIABLE RUN LENGTH ENCODING OF A BIT STREAM 有权
    一个位流的可变长度编码

    公开(公告)号:US20160301422A1

    公开(公告)日:2016-10-13

    申请号:US14682227

    申请日:2015-04-09

    CPC classification number: H03M5/145 H03M7/4037 H04L25/4908

    Abstract: An apparatus and method for encoding data are disclosed that may allow for variable run length encoding of data to be transmitted. An ordered stream of data bits is received from a logic circuit, and N sequential data bits of the stream are selected, where N is a positive integer. Of the N sequential data bits, M sequential data bits are selected, wherein M is a positive integer less than N. The M sequential data bits are then encoded to generate a code word that includes P data bits, wherein P is a positive integer greater than M and less than N. The code word is then concatenated with a subset of the N sequential data bits that excludes the M sequential data bits to form a transmission word. A transmit unit then sends the data bits of the transmission word in a serial fashion.

    Abstract translation: 公开了一种用于编码数据的装置和方法,其可以允许要发送的数据的可变行程长度编码。 从逻辑电路接收有序的数据位流,并且选择流的N个顺序数据位,其中N是正整数。 在N个顺序数据位中,选择M个顺序数据位,其中M是小于N的正整数。然后对M个顺序数据位进行编码,以产生包含P个数据位的代码字,其中P是更大的正整数 并且小于N.然后将代码字与排除M个顺序数据位的N个顺序数据位的子集连接以形成传输字。 然后,发送单元以串行方式发送传输字的数据位。

    Efficient silent code assignment to a set of logical codes

    公开(公告)号:US10944421B2

    公开(公告)日:2021-03-09

    申请号:US16556326

    申请日:2019-08-30

    Inventor: Sadar Ahmed

    Abstract: The least-significant-bits (LSBs) of a first data word of a first subset of a first plurality of data words may be compared to the LSBs of each data word of a second subset of a second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

    EFFICIENT SILENT CODE ASSIGNMENT TO A SET OF LOGICAL CODES

    公开(公告)号:US20190386678A1

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

    申请号:US16556326

    申请日:2019-08-30

    Inventor: Sadar Ahmed

    Abstract: The least-significant-bits (LSBs) of a first data word of a first subset of a first plurality of data words may be compared to the LSBs of each data word of a second subset of a second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

    Efficient silent code assignment to a set of logical codes

    公开(公告)号:US09966970B2

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

    申请号:US14682244

    申请日:2015-04-09

    Inventor: Sadar Ahmed

    CPC classification number: H03M7/04 H03M13/05 H03M13/09

    Abstract: A method for determining a mapping between two code spaces is disclosed. The method may include receiving first and second plurality of data words. The least-significant-bits (LSBs) of a first data word of a first subset of the first plurality of data words may be compared to the LSBs of each data word of a second subset of the second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

    EFFICIENT SILENT CODE ASSIGNMENT TO A SET OF LOGICAL CODES
    6.
    发明申请
    EFFICIENT SILENT CODE ASSIGNMENT TO A SET OF LOGICAL CODES 有权
    有效的静电代码分配到一套逻辑代码

    公开(公告)号:US20160301426A1

    公开(公告)日:2016-10-13

    申请号:US14682244

    申请日:2015-04-09

    Inventor: Sadar Ahmed

    CPC classification number: H03M7/04 H03M13/05 H03M13/09

    Abstract: A method for determining a mapping between two code spaces is disclosed. The method may include receiving first and second plurality of data words. The least-significant-bits (LSBs) of a first data word of a first subset of the first plurality of data words may be compared to the LSBs of each data word of a second subset of the second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

    Abstract translation: 公开了一种用于确定两个代码空间之间的映射的方法。 该方法可以包括接收第一和第二多个数据字。 可以将第一多个数据字的第一子集的第一数据字的最低有效位(LSB)与第二多个数据字的第二子集的每个数据字的LSB进行比较。 然后可以将第一数据字映射到第二子集的第二数据字。 与第一数据字的LSB匹配的第二数据字的多个LSB可以大于与第一数据字的LSB匹配的第二子集的第三子集的每个数据字的相应数量的LSB的相应数量的LSB,其中第三子集 排除第二数据字,并且第二数据字的最高有效位(MSB)可以与第一数据字的MSB相同。

    Efficient silent code assignment to a set of logical codes

    公开(公告)号:US10404273B2

    公开(公告)日:2019-09-03

    申请号:US15973429

    申请日:2018-05-07

    Inventor: Sadar Ahmed

    Abstract: The least-significant-bits (LSBs) of a first data word of a first subset of a first plurality of data words may be compared to the LSBs of each data word of a second subset of a second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

    EFFICIENT SILENT CODE ASSIGNMENT TO A SET OF LOGICAL CODES

    公开(公告)号:US20180254782A1

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

    申请号:US15973429

    申请日:2018-05-07

    Inventor: Sadar Ahmed

    CPC classification number: H03M7/04 H03M13/05 H03M13/09

    Abstract: The least-significant-bits (LSBs) of a first data word of a first subset of a first plurality of data words may be compared to the LSBs of each data word of a second subset of a second plurality of data words. The first data word may then be mapped to a second data word of the second subset. A number of LSBs of the second data word matching LSBs of the first data word may be greater than a respective number of LSBs of each data word of a third subset of the second subset matching the LSBs of the first data word, where the third subset excludes the second data word and a most-significant-bit (MSB) of the second data word may be the same as a MSB of the first data word.

Patent Agency Ranking