Search device and search method searching data based on key
US-9690652-B2 · Jun 27, 2017 · US
Compressing data from multiple reads for error control management in memory systems
US9239751B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-9239751-B1 |
| Application number | US-201313831686-A |
| Country | US |
| Kind code | B1 |
| Filing date | Mar 15, 2013 |
| Priority date | Dec 27, 2012 |
| Publication date | Jan 19, 2016 |
| Grant date | Jan 19, 2016 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
The various implementations described herein include systems, methods and/or devices that may enhance the reliability with which data can be stored in and read from a memory. Some implementations include a method of compressing a sequence of read data values into a bit-tuple of a predefined length to enable soft information decoding systems that use less power and/or less memory. In some implementations, the bit-tuple of a predefined length is produced using M single-bit buffer locations, where M corresponds to the predefined length of the bit-tuple. Some implementations utilize a collection of characterization vectors that include soft information values associated with the possible permutations of the bit-tuples. In turn, a sequence of bit-tuples is converted into a sequence of soft information values by retrieving a particular characterization vector, and selecting a respective soft information value from that characterization vector for each bit-tuple in the sequence.
First claim
Opening claim text (preview).
What is claimed is: 1. A method of representing a N-bit binary sequence from a sequence of N memory read operations, the method comprising: in response to M initial read operations in a sequence of N read operations that read from a single memory location, populating the M single-bit buffer locations by setting each respective single-bit buffer location of the M single-bit buffer locations to a value corresponding to a read value obtained by a respective read operation of the M i…
Assignees
Inventors
Classifications
- G06F11/085Primary
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9239751B1 cover?
- The various implementations described herein include systems, methods and/or devices that may enhance the reliability with which data can be stored in and read from a memory. Some implementations include a method of compressing a sequence of read data values into a bit-tuple of a predefined length to enable soft information decoding systems that use less power and/or less memory. In some implem…
- Who is the assignee on this patent?
- Chen Xiaoheng, Tai Ying Yu, Zhu Jiangli, and 2 more
- What technology area does this patent fall under?
- Primary CPC classification G06F11/085. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Jan 19 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).