Relational method for transforming unsorted sparse dictionary encodings into unsorted-dense or sorted-dense dictionary encodings
US11379450B2 · kind B2 · utility
2Cited by
6References
10Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 9, 2018 |
| Grant date | Jul 5, 2022 |
| Priority date | — |
| Expiry date | Nov 11, 2038 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M7/3091
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Unsorted sparse dictionary encodings are transformed into unsorted-dense or sorted-dense dictionary encodings. Sparse domain codes have large gaps between codes that are adjacent in order. Unlike spare codes, dense codes have smaller gaps between adjacent codes; consecutive codes are dense codes that have no gaps between adjacent codes. The techniques described herein are relational approaches that may be used to generate sparse composite codes and sorted codes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.