Base extension using a convolution sum in residue number systems View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

1993-06

AUTHORS

K. C. Posch, R. Posch

ABSTRACT

Base extension is an important operation in residue number systems. The method for base extension proposed in this paper approaches the solution through an approximation which is correct in nearly all cases. Rare corrences of uncertainties about the correctness of the result are detected and corrected using iterations. The novel method is superior to the method proposed by Shenoy and Kumaresan [5] as it does not need the help of an additional redundant modulus. For a special class of problems the latter method cannot be used at all. The presented base extension provides a unique tool with time complexity of log2n withn denoting the amount of moduli. More... »

PAGES

93-104

References to SciGraph publications

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/bf02238608

DOI

http://dx.doi.org/10.1007/bf02238608

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1054501345


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Graz University of Technology", 
          "id": "https://www.grid.ac/institutes/grid.410413.3", 
          "name": [
            "Institute for Applied Information Processing, Graz University of Technology, Klosterwiesgasse 32/I, A-8010, Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Posch", 
        "givenName": "K. C.", 
        "id": "sg:person.013270133353.59", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013270133353.59"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Graz University of Technology", 
          "id": "https://www.grid.ac/institutes/grid.410413.3", 
          "name": [
            "Institute for Applied Information Processing, Graz University of Technology, Klosterwiesgasse 32/I, A-8010, Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Posch", 
        "givenName": "R.", 
        "id": "sg:person.011236005071.18", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011236005071.18"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1090/s0025-5718-1976-0457374-x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1023988903"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-0348-5330-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034288696", 
          "https://doi.org/10.1007/978-3-0348-5330-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/978-3-0348-5330-9", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1034288696", 
          "https://doi.org/10.1007/978-3-0348-5330-9"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/12.16508", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061087362"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/mc.1984.1659138", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061386053"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.2307/2005976", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1069693080"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1993-06", 
    "datePublishedReg": "1993-06-01", 
    "description": "Base extension is an important operation in residue number systems. The method for base extension proposed in this paper approaches the solution through an approximation which is correct in nearly all cases. Rare corrences of uncertainties about the correctness of the result are detected and corrected using iterations. The novel method is superior to the method proposed by Shenoy and Kumaresan [5] as it does not need the help of an additional redundant modulus. For a special class of problems the latter method cannot be used at all. The presented base extension provides a unique tool with time complexity of log2n withn denoting the amount of moduli.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/bf02238608", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1356894", 
        "issn": [
          "1521-9615", 
          "1436-5057"
        ], 
        "name": "Computing", 
        "type": "Periodical"
      }, 
      {
        "issueNumber": "2", 
        "type": "PublicationIssue"
      }, 
      {
        "type": "PublicationVolume", 
        "volumeNumber": "50"
      }
    ], 
    "name": "Base extension using a convolution sum in residue number systems", 
    "pagination": "93-104", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "fcd886e11237745029446008916058dc643da4bac0f1bffbeed2fa45dc8269a8"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bf02238608"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1054501345"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/bf02238608", 
      "https://app.dimensions.ai/details/publication/pub.1054501345"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-11T12:25", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000362_0000000362/records_87104_00000001.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "http://link.springer.com/10.1007/BF02238608"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/bf02238608'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/bf02238608'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/bf02238608'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/bf02238608'


 

This table displays all metadata directly associated to this object as RDF triples.

84 TRIPLES      21 PREDICATES      32 URIs      19 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/bf02238608 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author Nfbe7d5387e8b4a45be0682835b6dba52
4 schema:citation sg:pub.10.1007/978-3-0348-5330-9
5 https://doi.org/10.1090/s0025-5718-1976-0457374-x
6 https://doi.org/10.1109/12.16508
7 https://doi.org/10.1109/mc.1984.1659138
8 https://doi.org/10.2307/2005976
9 schema:datePublished 1993-06
10 schema:datePublishedReg 1993-06-01
11 schema:description Base extension is an important operation in residue number systems. The method for base extension proposed in this paper approaches the solution through an approximation which is correct in nearly all cases. Rare corrences of uncertainties about the correctness of the result are detected and corrected using iterations. The novel method is superior to the method proposed by Shenoy and Kumaresan [5] as it does not need the help of an additional redundant modulus. For a special class of problems the latter method cannot be used at all. The presented base extension provides a unique tool with time complexity of log2n withn denoting the amount of moduli.
12 schema:genre research_article
13 schema:inLanguage en
14 schema:isAccessibleForFree false
15 schema:isPartOf N1423da800c504f28bbdfd48c9e5030a2
16 Nb067b8b4560f4348b82a3ba793690743
17 sg:journal.1356894
18 schema:name Base extension using a convolution sum in residue number systems
19 schema:pagination 93-104
20 schema:productId N36fb5ea232f34bb19656ffbdc0da75ed
21 Ncda3f0465d70446eaf0e390293b94b18
22 Ne3f7c0dc082341d3afb2aa18b113efa7
23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1054501345
24 https://doi.org/10.1007/bf02238608
25 schema:sdDatePublished 2019-04-11T12:25
26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
27 schema:sdPublisher N6328bdc0225f42758c66b9c733df6e1e
28 schema:url http://link.springer.com/10.1007/BF02238608
29 sgo:license sg:explorer/license/
30 sgo:sdDataset articles
31 rdf:type schema:ScholarlyArticle
32 N1423da800c504f28bbdfd48c9e5030a2 schema:issueNumber 2
33 rdf:type schema:PublicationIssue
34 N36fb5ea232f34bb19656ffbdc0da75ed schema:name doi
35 schema:value 10.1007/bf02238608
36 rdf:type schema:PropertyValue
37 N417cabef9a7040049a818897a6001688 rdf:first sg:person.011236005071.18
38 rdf:rest rdf:nil
39 N6328bdc0225f42758c66b9c733df6e1e schema:name Springer Nature - SN SciGraph project
40 rdf:type schema:Organization
41 Nb067b8b4560f4348b82a3ba793690743 schema:volumeNumber 50
42 rdf:type schema:PublicationVolume
43 Ncda3f0465d70446eaf0e390293b94b18 schema:name readcube_id
44 schema:value fcd886e11237745029446008916058dc643da4bac0f1bffbeed2fa45dc8269a8
45 rdf:type schema:PropertyValue
46 Ne3f7c0dc082341d3afb2aa18b113efa7 schema:name dimensions_id
47 schema:value pub.1054501345
48 rdf:type schema:PropertyValue
49 Nfbe7d5387e8b4a45be0682835b6dba52 rdf:first sg:person.013270133353.59
50 rdf:rest N417cabef9a7040049a818897a6001688
51 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
52 schema:name Information and Computing Sciences
53 rdf:type schema:DefinedTerm
54 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
55 schema:name Computation Theory and Mathematics
56 rdf:type schema:DefinedTerm
57 sg:journal.1356894 schema:issn 1436-5057
58 1521-9615
59 schema:name Computing
60 rdf:type schema:Periodical
61 sg:person.011236005071.18 schema:affiliation https://www.grid.ac/institutes/grid.410413.3
62 schema:familyName Posch
63 schema:givenName R.
64 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011236005071.18
65 rdf:type schema:Person
66 sg:person.013270133353.59 schema:affiliation https://www.grid.ac/institutes/grid.410413.3
67 schema:familyName Posch
68 schema:givenName K. C.
69 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013270133353.59
70 rdf:type schema:Person
71 sg:pub.10.1007/978-3-0348-5330-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1034288696
72 https://doi.org/10.1007/978-3-0348-5330-9
73 rdf:type schema:CreativeWork
74 https://doi.org/10.1090/s0025-5718-1976-0457374-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1023988903
75 rdf:type schema:CreativeWork
76 https://doi.org/10.1109/12.16508 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061087362
77 rdf:type schema:CreativeWork
78 https://doi.org/10.1109/mc.1984.1659138 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061386053
79 rdf:type schema:CreativeWork
80 https://doi.org/10.2307/2005976 schema:sameAs https://app.dimensions.ai/details/publication/pub.1069693080
81 rdf:type schema:CreativeWork
82 https://www.grid.ac/institutes/grid.410413.3 schema:alternateName Graz University of Technology
83 schema:name Institute for Applied Information Processing, Graz University of Technology, Klosterwiesgasse 32/I, A-8010, Graz, Austria
84 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...