Dissertation/Thesis
An Optimal Algorithm for Detecting Pattern Sensitive Faults in Semiconductor Random Access Memories
| Title: | An Optimal Algorithm for Detecting Pattern Sensitive Faults in Semiconductor Random Access Memories |
|---|---|
| Authors: | Subrin, Richard I. |
| Source: | Retrospective Theses and Dissertations |
| Publisher Information: | STARS |
| Publication Year: | 1981 |
| Collection: | University of Central Florida (UCF): STARS (Showcase of Text, Archives, Research & Scholarship) |
| Subject Terms: | Pattern recognition systems, Random access memory, Adjacent-pattern interference faults (APIFs), Pattern-sensitive faults, Optimal test algorithm, Memory operation minimization, RAM test sequence model, Engineering |
| Description: | Random-access memory (RAM) testing to detect unrestricted pattern-sensitive faults (PSFs) is impractical due to the size of the memory checking sequence required. A formal model for restricted PSFs in RAMs called adjacent-pattern interference faults (APIFs) is presented. A test algorithm capable of detecting APIFs in RAMs requiring a minimum number of memory operations is then developed. |
| Document Type: | Thesis |
| File Description: | application/pdf |
| Language: | English |
| Relation: | https://stars.library.ucf.edu/rtd/596; https://stars.library.ucf.edu/context/rtd/article/1595/viewcontent/68456.pdf |
| Availability: | https://stars.library.ucf.edu/rtd/596 https://stars.library.ucf.edu/context/rtd/article/1595/viewcontent/68456.pdf |
| Rights: | Public Domain |
| Accession Number: | edsbas.67CC5C0 |
| Database: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://stars.library.ucf.edu/rtd/596# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.67CC5C0 RelevancyScore: 675 AccessLevel: 3 PubType: Dissertation/Thesis PubTypeId: unknown PreciseRelevancyScore: 675.149597167969 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: An Optimal Algorithm for Detecting Pattern Sensitive Faults in Semiconductor Random Access Memories – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Subrin%2C+Richard+I%2E%22">Subrin, Richard I.</searchLink> – Name: TitleSource Label: Source Group: Src Data: Retrospective Theses and Dissertations – Name: Publisher Label: Publisher Information Group: PubInfo Data: STARS – Name: DatePubCY Label: Publication Year Group: Date Data: 1981 – Name: Subset Label: Collection Group: HoldingsInfo Data: University of Central Florida (UCF): STARS (Showcase of Text, Archives, Research & Scholarship) – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Pattern+recognition+systems%22">Pattern recognition systems</searchLink><br /><searchLink fieldCode="DE" term="%22Random+access+memory%22">Random access memory</searchLink><br /><searchLink fieldCode="DE" term="%22Adjacent-pattern+interference+faults+%28APIFs%29%22">Adjacent-pattern interference faults (APIFs)</searchLink><br /><searchLink fieldCode="DE" term="%22Pattern-sensitive+faults%22">Pattern-sensitive faults</searchLink><br /><searchLink fieldCode="DE" term="%22Optimal+test+algorithm%22">Optimal test algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Memory+operation+minimization%22">Memory operation minimization</searchLink><br /><searchLink fieldCode="DE" term="%22RAM+test+sequence+model%22">RAM test sequence model</searchLink><br /><searchLink fieldCode="DE" term="%22Engineering%22">Engineering</searchLink> – Name: Abstract Label: Description Group: Ab Data: Random-access memory (RAM) testing to detect unrestricted pattern-sensitive faults (PSFs) is impractical due to the size of the memory checking sequence required. A formal model for restricted PSFs in RAMs called adjacent-pattern interference faults (APIFs) is presented. A test algorithm capable of detecting APIFs in RAMs requiring a minimum number of memory operations is then developed. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Thesis – Name: Format Label: File Description Group: SrcInfo Data: application/pdf – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: https://stars.library.ucf.edu/rtd/596; https://stars.library.ucf.edu/context/rtd/article/1595/viewcontent/68456.pdf – Name: URL Label: Availability Group: URL Data: https://stars.library.ucf.edu/rtd/596<br />https://stars.library.ucf.edu/context/rtd/article/1595/viewcontent/68456.pdf – Name: Copyright Label: Rights Group: Cpyrght Data: Public Domain – Name: AN Label: Accession Number Group: ID Data: edsbas.67CC5C0 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.67CC5C0 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: Pattern recognition systems Type: general – SubjectFull: Random access memory Type: general – SubjectFull: Adjacent-pattern interference faults (APIFs) Type: general – SubjectFull: Pattern-sensitive faults Type: general – SubjectFull: Optimal test algorithm Type: general – SubjectFull: Memory operation minimization Type: general – SubjectFull: RAM test sequence model Type: general – SubjectFull: Engineering Type: general Titles: – TitleFull: An Optimal Algorithm for Detecting Pattern Sensitive Faults in Semiconductor Random Access Memories Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Subrin, Richard I. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 1981 Identifiers: – Type: issn-locals Value: edsbas – Type: issn-locals Value: edsbas.oa Titles: – TitleFull: Retrospective Theses and Dissertations Type: main |
| ResultId | 1 |