Patent US5561631A successfully refreshed from Google Patents.
US5561631A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High-speed minimal logic self blank checking method for programmable logic device
Assignee: Xilinx Inc
•
Filing: 1995-03-03
•
Granted: 1996-10-01
•
Expires: 2015-03-03
Abstract
Abstract A programmable logic device (PLD) performs a self-test erase check operation on memory elements to verify if the PLD is completely erased. The output signals of the sense amplifiers associated with the PLD bitlines drive a plurality of NMOS devices. The NMOS devices share a common source (node), thereby providing in effect an n-input NOR gate, where n is the number of bitlines in the array. The memory cells associated with an entire wordline of the PLD memory array are simultaneously checked for an erased state by bringing the wordline under test high while keeping all other wordlines low. If all of the memory cells on a wordline are erased, every sense amplifier output is low, all of the NMOS devices are off, and the output signal of the NOR gate is high due to a weak pull-up on the common node, thereby indicating that the whole column is properly erased. If one or more memory cells on the selected wordline are not completely erased, then at least one sense amplifier output is high because the cell is not able to pull its bitline low to switch the sense amplifier. The high output of the sense amplifier turns on its associated NMOS device, thereby pulling down the voltage on the common node and providing a low output signal from the NOR gate, thereby indicating that additional erasing of the array is necessary.
Inventors
- 👤 Derek R. Curd
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 02:18
CPC Classifications
G; G11; G11C; G11C16/00; G11C16/02; G11C16/06; G11C16/34; G11C16/3436; G11C16/344; G11C16/3445; G11C29/00; G11C29/04; G11C29/08; G11C29/12; G11C29/18; G11C29/30; G11C29/34; G11C29/52; H; H03; H03K; H03K19/00; H03K19/02; H03K19/173; H03K19/177; H03K19/17704; H03K19/17748; H03K19/1776; H03K19/17764
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
136 words
An apparatus for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said apparatus comprising: an n-input gate, wherein each input terminal of said n-input gate is coupled to an output terminal of one of said associated sense amplifiers, wherein said n-input gate determines the state of said column of memory cells when said wordline is addressed and provides an output signal in accordance therewith; and means for erasing said column of memory cells, wherein said means for erasing receives said output signal and is operatively coupled to said column of memory cells.
Claim 2
Independent Claim
136 words
An apparatus for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said apparatus comprising: an n-input gate, wherein each input terminal of said n-input gate is coupled to an output terminal of one of said associated sense amplifiers, wherein said n-input gate determines the state of said column of memory cells when said wordline is addressed and provides an output signal in accordance therewith; and means for erasing said column of memory cells, wherein said means for erasing receives said output signal and is operatively coupled to said column of memory cells.
Claim 3
Dependent Claim
44 words
The apparatus of claim 1, wherein if said output signal has a first logic state, then said column is erased; and wherein if said output signal has a second logic state, then at least one memory cell in said column is not completely erased.
Claim 4
Dependent Claim
17 words
The apparatus of claim 1, wherein if one wordline is addressed, then all other wordlines are unaddressed.
Claim 5
Dependent Claim
78 words
The apparatus of claim 1, said n-input gate further comprising: a plurality of NMOS devices, each NMOS device receiving a signal from one of said associated sense amplifiers, wherein a low voltage signal is provided by said sense amplifier if said bitline is in a low state, and wherein a high voltage signal is provided by said sense amplifier if said bitline is in a high state; wherein said plurality of NMOS devices share a common output node.
Claim 6
Dependent Claim
36 words
The apparatus of claim 4, said gate further comprising: a PMOS device, connected to said output common node, having a gate that is permanently grounded, said PMOS device providing a weak pull-up on said output node.
Claim 7
Independent Claim
150 words
An apparatus for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said apparatus comprising: an n-input gate comprised of a plurality of devices, all of said devices sharing a common node, wherein each of said devices is coupled to an output terminal of one of said associated sense amplifiers, wherein said n-input gate simultaneously checks all memory cells in said column for an erased state when said wordline is addressed, and produces an output signal in accordance therewith; and means for erasing said column of memory cells, wherein said means for erasing receives said output signal and is operatively coupled to said column of memory cell.
Claim 8
Independent Claim
150 words
An apparatus for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said apparatus comprising: an n-input gate comprised of a plurality of devices, all of said devices sharing a common node, wherein each of said devices is coupled to an output terminal of one of said associated sense amplifiers, wherein said n-input gate simultaneously checks all memory cells in said column for an erased state when said wordline is addressed, and produces an output signal in accordance therewith; and means for erasing said column of memory cells, wherein said means for erasing receives said output signal and is operatively coupled to said column of memory cell.
Claim 9
Dependent Claim
43 words
The apparatus of claim 6, wherein if said output signal has a first logic state, then said column is erased; and if said output Signal has a second logic state, then at least one memory cell in said column is not fully erased.
Claim 10
Dependent Claim
17 words
The apparatus of claim 6, wherein said devices may be any of NMOS, PMOS, and bipolar devices.
Claim 11
Dependent Claim
18 words
The apparatus of claim 6, wherein said associated sense amplifier amplifies the non-inverted signal on said associated bitline.
Claim 12
Dependent Claim
38 words
The apparatus of claim 6, wherein said PLD includes a plurality of columns of memory cells, wherein each column of memory cells has an associated wordline, wherein if one wordline is addressed, then all other wordlines are unaddressed.
Claim 13
Dependent Claim
33 words
The apparatus of claim 6, said n-gate further comprising: a pull-up device having a gate that is connected to said common node, said pull-up device providing a weak pull-up on said common node.
Claim 14
Independent Claim
98 words
A method for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said method comprising the step of: using an n-input gate to simultaneously check all memory cells in said column for an erased state when said wordline is addressed, wherein said n-input gate provides an output signal on an output node in accordance therewith.
Claim 15
Independent Claim
98 words
A method for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said method comprising the step of: using an n-input gate to simultaneously check all memory cells in said column for an erased state when said wordline is addressed, wherein said n-input gate provides an output signal on an output node in accordance therewith.
Claim 16
Dependent Claim
47 words
The method of claim 12, wherein if said output signal has a first logic state, then said column of memory cells is erased; and wherein if said output signal has a second logic state, then at least one memory cell in said column is not fully erased.
Claim 17
Dependent Claim
35 words
The method of claim 12, wherein said PLD includes a plurality of columns of memory cells, each column including an associated wordline, and wherein if one wordline is addressed, then all other wordlines are unaddressed.
Claim 18
Dependent Claim
43 words
The method of claim 12, further comprising the steps of: providing a low signal to said n-input gate if said associated bitline has a low state; and providing a high signal to said n-input gate if said associated bitline has a high state.
Claim 19
Dependent Claim
18 words
The method of claim 12, further comprising the step of: providing a weak pull-up on said output node.
Claim 20
Independent Claim
120 words
A method for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said method comprising the step of: simultaneously checking the state of said column of memory cells when said common wordline is addressed using an n-input gate comprised of a plurality of devices, all of said devices sharing a common output node, wherein each of said devices receives a control signal from one of said associated sense amplifiers; and producing an output signal in accordance therewith.
Claim 21
Independent Claim
120 words
A method for verifying the erasure of a column of memory cells in a programmable logic device (PLD), each memory cell in said column having one terminal coupled to a common voltage source, a second terminal coupled to an associated bitline and an associated sense amplifier, and a control terminal coupled to a common wordline, said method comprising the step of: simultaneously checking the state of said column of memory cells when said common wordline is addressed using an n-input gate comprised of a plurality of devices, all of said devices sharing a common output node, wherein each of said devices receives a control signal from one of said associated sense amplifiers; and producing an output signal in accordance therewith.
Claim 22
Dependent Claim
45 words
The method of claim 17, further comprising the steps of: providing a signal of a first logic state if said column is erased; and providing a signal of a second logic state if at least one memory cell in said column is not fully erased.
Claim 23
Dependent Claim
49 words
The method of claim 17, further comprising the steps of: outputting a low voltage signal from said associated sense amplifier if said associated bitline is in a low state; and outputting a high voltage signal from said associated sense amplifier if said associated bitline is in a high state.
Claim 24
Dependent Claim
30 words
The method of claim 17, further comprising the step of: addressing each wordline in turn, with all other wordlines unaddressed, to verify whether an entire PLD memory array is erased.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-10-01 | 2000-04-01 | 2000-10-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-10-01 | 2004-04-01 | 2004-10-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-10-01 | 2008-04-01 | 2008-10-01 | $7700.00 | Window Closed / Lapsed |