Graph-based Algorithms for Linear Computation Coding
We revisit existing linear computation coding (LCC) algorithms, and introduce a new framework that measures the computational cost of computing multidimensional linear functions, not only in terms of the number of additions, but also with respect to their suitability for parallel processing. Utilizi...
Saved in:
| Main Authors | , , |
|---|---|
| Format | Journal Article |
| Language | English |
| Published |
16.01.2024
|
| Subjects | |
| Online Access | Get full text |
| DOI | 10.48550/arxiv.2401.08249 |
Cover
| Abstract | We revisit existing linear computation coding (LCC) algorithms, and introduce
a new framework that measures the computational cost of computing
multidimensional linear functions, not only in terms of the number of
additions, but also with respect to their suitability for parallel processing.
Utilizing directed acyclic graphs, which correspond to signal flow graphs in
hardware, we propose a novel LCC algorithm that controls the trade-off between
the total number of operations and their parallel executability. Numerical
evaluations show that the proposed algorithm, constrained to a fully parallel
structure, outperforms existing schemes. |
|---|---|
| AbstractList | We revisit existing linear computation coding (LCC) algorithms, and introduce
a new framework that measures the computational cost of computing
multidimensional linear functions, not only in terms of the number of
additions, but also with respect to their suitability for parallel processing.
Utilizing directed acyclic graphs, which correspond to signal flow graphs in
hardware, we propose a novel LCC algorithm that controls the trade-off between
the total number of operations and their parallel executability. Numerical
evaluations show that the proposed algorithm, constrained to a fully parallel
structure, outperforms existing schemes. |
| Author | Rosenberger, Hans Müller, Ralf R Bereyhi, Ali |
| Author_xml | – sequence: 1 givenname: Hans surname: Rosenberger fullname: Rosenberger, Hans – sequence: 2 givenname: Ali surname: Bereyhi fullname: Bereyhi, Ali – sequence: 3 givenname: Ralf R surname: Müller fullname: Müller, Ralf R |
| BackLink | https://doi.org/10.48550/arXiv.2401.08249$$DView paper in arXiv |
| BookMark | eNrjYmDJy89LZWCQNDTQM7EwNTXQTyyqyCzTMzIxMNQzsDAyseRkMHEvSizI0E1KLE5NUXDMSc8vyizJyC1WSMsvUvDJzEtNLFJwzs8tKC1JLMnMzwOyUzLz0nkYWNMSc4pTeaE0N4O8m2uIs4cu2Pz4gqLM3MSiyniQPfFge4wJqwAAQYMz4Q |
| ContentType | Journal Article |
| Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| DBID | AKY AKZ GOX |
| DOI | 10.48550/arxiv.2401.08249 |
| DatabaseName | arXiv Computer Science arXiv Mathematics arXiv.org |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 2401_08249 |
| GroupedDBID | AKY AKZ GOX |
| ID | FETCH-arxiv_primary_2401_082493 |
| IEDL.DBID | GOX |
| IngestDate | Tue Jul 22 23:32:09 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-arxiv_primary_2401_082493 |
| OpenAccessLink | https://arxiv.org/abs/2401.08249 |
| ParticipantIDs | arxiv_primary_2401_08249 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-01-16 |
| PublicationDateYYYYMMDD | 2024-01-16 |
| PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationYear | 2024 |
| Score | 3.7208922 |
| SecondaryResourceType | preprint |
| Snippet | We revisit existing linear computation coding (LCC) algorithms, and introduce
a new framework that measures the computational cost of computing... |
| SourceID | arxiv |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science - Information Theory Mathematics - Information Theory |
| Title | Graph-based Algorithms for Linear Computation Coding |
| URI | https://arxiv.org/abs/2401.08249 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV29bwIhHP1FnboYGzV-VRlcL1ZBiaMxVeOgi01uuwDHqYltjR9N__w-wKYuThAgQIDw3oPwIOpyrqTKxGsEumsgUNw-KFMeKausERKB8W6fq9HiXSzjYZwj9vcWRp1-9t_BH1ife4Ab57AJiZCnPIiCe8y7jsPlpLfiupX_LweO6ZPuQGJWouKN3bFJmI5nytnPMom5M4WOHF6kbHLYfkGP7z7ODHSRQQpiqbHwt4IfJMQdnFSoM3vbTBeRbyc5BlOIxHUh8V3gVSpAutsaseEY7AOyPtMDJfrZWAstuRKpNAJEw6g61R7V0nic1aSnAaDVHQT0Ry0qXE5X-wJovOi2H59f8fFn2w |
| linkProvider | Cornell University |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Graph-based+Algorithms+for+Linear+Computation+Coding&rft.au=Rosenberger%2C+Hans&rft.au=Bereyhi%2C+Ali&rft.au=M%C3%BCller%2C+Ralf+R&rft.date=2024-01-16&rft_id=info:doi/10.48550%2Farxiv.2401.08249&rft.externalDocID=2401_08249 |