10.46243/jst.2023.v8.i01.pp06-18 registered
AN STRATEGY OF POWER AND AREA COMPETENT APPROXIMATE MULTIPLIERS
Resolves to https://www.jst.org.in/index.php/pub/article/view/676
Held by Longman Publishers (India) · prefix 10.46243 live · DOI address https://doi.org/10.46243/jst.2023.v8.i01.pp06-18
Registered 29 Sep 2026 via crossref · record version 2 · last change 29 Sep 2026, 11:59 PM · record sha256 42720942c3abc607…
Resolve ⬇ Record (JSON) ⬇ Kernel Metadata Declaration (XML) Compare with Crossref Cite (APA · BibTeX · RIS · CSL)
Also as schema.org JSON-LD · Turtle · RDF/XML · DataCite XML · Crossref UNIXREF · Crossref UNIXSD — the formats of the DOI content-negotiation service, from this record (which carries what).
What the DOI identifies
JournalArticle — an article in a journal · Digital · Visual · en
AN STRATEGY OF POWER AND AREA COMPETENT APPROXIMATE MULTIPLIERS (PrincipalTitle · en)
Published 2023-03-02
Part of Journal of Science & Technology · ISSN 2456-5660 · volume 8 · issue 1 · pages 6–18
Agents
- CHINTHALA KAVYA CHINTHALA KAVYA (author) · DEPARTMENT OF ECE, AVN INSTITUTE OF ENGINEERING AND TECHNOLOGY, M
- Longman Publishers (publisher)
Identifiers DOI 10.46243/jst.2023.v8.i01.pp06-18
Abstract · en
In this paper, the area of efficiency multiplier put a sign suggests a fixed width through a replica redundancy through adoption My tolerance for noise (ANT) architecture with a multiplier of fixed width to build a redundancy version precision cutting Masa (RPR). ANT proposed architecture can meet the demand for high precision, low power consumption, and region Efficiency. RPR fixed-width design with error compensation through the circles of the possibilities and statistical analysis. use the When a partial product of the correct input vectors and vectors fixed in the palace and put in place to reduce truncation errors, hardware Failure holding circuit can be simplified compensation. The multiplier ANT 16 × 16 bits, the circuit area in our RPR fixed width It may be less, energy consumption in the design of ants can be saved as compared with the ANT state of the art design
System metadata — ISO 26324:2025, Annex B · DOI Handbook 10.1
Each element by the standard's name (Annex B: reference elements, then administrative) and the Handbook's (in grey), read off the record above.
| Element | Value | In the record |
|---|---|---|
| DOI Name DOI name | 10.46243/jst.2023.v8.i01.pp06-18 | doi |
| Referent Type referentType | Creation | referent |
| Referent Sub-Type referentSubType | JournalArticle — an article in a journal | type |
| Referent Name(s) referentName(s) | AN STRATEGY OF POWER AND AREA COMPETENT APPROXIMATE MULTIPLIERS (PrincipalTitle, en) | titles |
| Basic Metadata basicMetadata | author: CHINTHALA KAVYA CHINTHALA KAVYA publisher: Longman Publishers published: 2023-03-02 part of: Journal of Science & Technology · ISSN 2456-5660 · vol. 8 · no. 1 · pp. 6–18 language: en form: Digital · Visual · Language | agents, dates, container, language, structural_type, modes, characters |
| Referent Identifier(s) alternateIdentifier(s) | none besides the DOI | identifiers, relations (IsSameAs) |
| Registration Authority registrationAuthorityCode | Crossref — issued by Crossref (member 25296); held here as a copy | record.source_agency (our code, ra_doi_name, for names issued here once appointed) |
| Created Date issueDate | 2024-02-16 | record.registered (when the DOI name was first registered) |
| relatedIdentifiers | none needed — the descriptive metadata is in this record | container, relations (only where the descriptive metadata lives at another identifier) |
complete Every System Metadata element is here, with the basic metadata a journal article needs.
The System Metadata Declaration (JSON) · the Kernel Metadata Declaration (XML) · what each sub-type needs
Cited by — in this registry
No record held in this registry cites this DOI.
Counts only records held in this registry; a citation from a work held elsewhere is not seen here. The list as JSON
References with DOIs
The record lists 19 references; 15 carry a DOI.
| # | Reference | DOI | Held here |
|---|---|---|---|
| 3 | ref3 B. Melvin and Z. Haiyang, “Error-tolerance and multimedia,”in Proc. 2006 Int. Conf. Intell. Inf. Hiding and Multimedia SignalProcess., 2006, pp. 521–524 | 10.1109/iih-msp.2006.265055 | not held here |
| 4 | ref4 M. A. Breuer, S. K. Gupta, and T. M. Mak, “Design and error tolerancein the presence of massive numbers of defects,” IEEE Des. TestComput., vol. 24, no. 3, pp. 216– 227, May-Jun. … | 10.1109/mdt.2004.8 | not held here |
| 5 | ref5 M. A. Breuer, “Intelligible test techniques to sup-port error-tolerance,”in Proc. Asian Test Symp., Nov. 2004, pp. 386–393 | 10.1109/ats.2004.51 | not held here |
| 6 | ref6 K. J. Lee, T. Y. Hsieh, and M. A. Breuer, “A novel testing methodologybased on error-rate to support errortolerance,” in Proc. Int. Test Conf.,2005, pp. 1136–1144 | 10.1109/test.2005.1584081 | not held here |
| 7 | ref7 S. Chong and A. Ortega, “Hardware testing for error tolerant multimediacompression based on linear transforms,” in Proc. Defect andFault Tolerance in VLSI Syst. Symp., 2005, pp. 5… | 10.1109/dftvs.2005.38 | not held here |
| 8 | ref8 H. Chung and A. Ortega, “Analysis and testing for error tolerant motionestimation,” in Proc. Defect and Fault Tolerance in VLSI Syst. Symp.,2005, pp. 514–522 | 10.1109/dftvs.2005.19 | not held here |
| 10 | ref10 T. Y. Hsieh, K. J. Lee, and M. A. Breuer, “Reduction of detected acceptablefaults for yield improvement via errortolerance,” in Proc.Des., Automation and Test Eur. Conf. Exhib., 2… | 10.1109/date.2007.364530 | not held here |
| 11 | ref11 V. Palem, “Energy aware computing through probabilisticswitching: A study of limits,” IEEE Trans. Comput., vol. 54, no. 9, pp.1123–1137, Sep. 2005 | 10.1109/tc.2005.145 | not held here |
| 12 | ref12 S. Cheemalavagu, P. Korkmaz, and K. V. Palem“Ultra low energycomputing via probabilistic algorithms and devices: CMOS deviceprimitives and the energy-probability relationship,” in… | 10.7567/ssdm.2004.p1-8l | not held here |
| 13 | ref13 P. Korkmaz, B. E. S. Akgul, K. V. Palem, and L. N. Chakrapani, “Advocatingnoise as an agent forultra-low energy computing: Probabilisticcomplementary metal-oxidesemiconductor devi… | 10.1143/jjap.45.3307 | not held here |
| 14 | ref14 E. Stine, C. R. Babb, and V. B. Dave, “Constant addition utilizingflagged prefix structures,” in Proc.IEEE Int. Symp. Circuits and Systems(ISCAS), 2005 | 10.1109/iscas.2005.1464676 | not held here |
| 15 | ref15 L.-D. Van and C.-C. Yang, “Generalized low-error areaefficient fixedwidthmultipliers,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 25,no. 8, pp. 1608–1619, Aug. 2005 | 10.1109/tcsi.2005.851675 | not held here |
| 16 | ref16 Lehman and N. Burla, “Skip techniques for high-speed carry propagationin binary arithmetic units,” IRE Trans. Electron. Comput., vol.EC-10, pp. 691–698, Dec. 1962 | 10.1109/tec.1961.5219274 | not held here |
| 17 | ref17 O. Bedrij, “Carry select adder,” IRE Trans. Electron. Comput., vol.EC-11, pp. 340–346, 1962 | 10.1109/iretelc.1962.5407919 | not held here |
| 18 | ref18 O. MacSorley, “High speed arithmetic in binary computers,” IRE Proc.,vol. 49, pp. 67–91, 1961 | 10.1109/jrproc.1961.287779 | not held here |
Relations
The record states no relation, and no record held here states one with this DOI.
Funding
The record names no funder.
Each funder's page lists every work held here that names it. ROR IDs open at ror.org; Funder Registry IDs resolve at doi.org.
History — the ledger
Every change to this DOI, in order, as it was recorded. Entries are only ever added, never changed or removed.
| # | When | What | By | Changes |
|---|---|---|---|---|
| 1 | 29 Sep 2026, 10:00 PM | register registered at Crossref; record read from api.crossref.org | Administrator (admin) | 110 fields set · sha256 f1a497db8788… |
| 2 | 29 Sep 2026, 11:59 PM | update record re-read from api.crossref.org | Administrator (admin) | container.titles.0.value: |
Machine-readable: the history as JSON, with the full record after each change.
Changes made at Crossref through DOI Doctor
Every deposit Smart Scholars' DOI Doctor made for this DOI, oldest first, with Crossref's own answer. Each fingerprint is the SHA-256 of its entry and of the fingerprint before it, so a change to any earlier entry changes every fingerprint after it.
| When | What changed | Crossref | Fingerprint |
|---|---|---|---|
| 13 Sep 2026, 01:41 | Read back: the DOI resolves to the new address | ● confirmed | e47e22a2a074… |
| 28 Sep 2026, 01:46 | Address updated from https://www.jst.org.in/index.php/pub/article/view/685 to https://www.jst.org.in/index.php/pub/article/view/676 | ● accepted by Crossref | 290de6a76b47… |
| 07 Oct 2026, 07:37 | Metadata completed abstract (142 words) · licence | ● accepted by Crossref | ec509d117f9f… |
| 07 Oct 2026, 08:49 | Read back: Crossref's record shows it | ● confirmed | d8a1a2ef469b… |
4 entries · the last fingerprint d8a1a2ef469b724aaeefa9b4ef7f2df2927cbc067c64f3f5c6c15a970232a333 · the history as JSON, each entry with the fingerprint before it, to check them yourself.



