Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks

Compute-and-forward (C&F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2016-05, Vol.20 (5), p.926-929
Main Authors: Molu, Mehdi M., Cumanan, Kanapathippillai, Burr, Alister
Format: Article
Language:English
Subjects:
Algorithms
Computation Rate
Computational modeling
Compute-and-Forward
Decoding
Encoding
Frame relay
Lattices
Mathematical model
Network coding
Physical layer Network Coding
Relays
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683
cites cdi_FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683
container_end_page 929
container_issue 5
container_start_page 926
container_title IEEE communications letters
container_volume 20
creator Molu, Mehdi M.
Cumanan, Kanapathippillai
Burr, Alister
description Compute-and-forward (C&F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes for choosing proper integer vectors in the relay nodes; this method is referred to as "blind C&F" and an algorithm is proposed which guarantees that each relay chooses the best integer vector that contains information from at least m source nodes. In the second algorithm that is described as "partially coordinated C&F," we assume that partial cooperation between the relay nodes and propose to exchange a single variable with which the relays are sorted for transmission. The performance of the proposed algorithm is nearly equivalent with optimal relaying, which requires significant overhead signaling.
doi_str_mv 10.1109/LCOMM.2016.2537810
format article
fullrecord <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_7425210</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7425210</ieee_id><sourcerecordid>4051823111</sourcerecordid><originalsourceid>FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683</originalsourceid><addsrcrecordid>eNo9kNFLwzAQxoMoOKf_gL4UfM68JE2bPEpxKnQOYT6HrEmxs1tm0jL335va4cvdB_d9d8cPoVsCM0JAPpTFcrGYUSDZjHKWCwJnaEI4F5jGch41CInzXIpLdBXCBgAE5WSC3kt3wIXb7lv703THZJB9Z7HeGTx3_qC9SVa2-tw1370NSe18sujbrgmu95UdtbetPiZvtjs4_xWu0UWt22BvTn2KPuZPq-IFl8vn1-KxxBVjssNGZmtt0spKU2VWrGuiueRrwzORgcw0E4wyGk3ADVSa2lQY0ACUMFFDJtgU3Y97994Nv3VqE3_axZOK5EIAE2kG0UVHV-VdCN7Wau-brfZHRUAN6NQfOjWgUyd0MXQ3hhpr7X8gTymncfoLWShrBA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1788038460</pqid></control><display><type>article</type><title>Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Molu, Mehdi M. ; Cumanan, Kanapathippillai ; Burr, Alister</creator><creatorcontrib>Molu, Mehdi M. ; Cumanan, Kanapathippillai ; Burr, Alister</creatorcontrib><description>Compute-and-forward (C&amp;F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes for choosing proper integer vectors in the relay nodes; this method is referred to as "blind C&amp;F" and an algorithm is proposed which guarantees that each relay chooses the best integer vector that contains information from at least m source nodes. In the second algorithm that is described as "partially coordinated C&amp;F," we assume that partial cooperation between the relay nodes and propose to exchange a single variable with which the relays are sorted for transmission. The performance of the proposed algorithm is nearly equivalent with optimal relaying, which requires significant overhead signaling.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2016.2537810</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Computation Rate ; Computational modeling ; Compute-and-Forward ; Decoding ; Encoding ; Frame relay ; Lattices ; Mathematical model ; Network coding ; Physical layer Network Coding ; Relays</subject><ispartof>IEEE communications letters, 2016-05, Vol.20 (5), p.926-929</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683</citedby><cites>FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7425210$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Molu, Mehdi M.</creatorcontrib><creatorcontrib>Cumanan, Kanapathippillai</creatorcontrib><creatorcontrib>Burr, Alister</creatorcontrib><title>Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>Compute-and-forward (C&amp;F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes for choosing proper integer vectors in the relay nodes; this method is referred to as "blind C&amp;F" and an algorithm is proposed which guarantees that each relay chooses the best integer vector that contains information from at least m source nodes. In the second algorithm that is described as "partially coordinated C&amp;F," we assume that partial cooperation between the relay nodes and propose to exchange a single variable with which the relays are sorted for transmission. The performance of the proposed algorithm is nearly equivalent with optimal relaying, which requires significant overhead signaling.</description><subject>Algorithms</subject><subject>Computation Rate</subject><subject>Computational modeling</subject><subject>Compute-and-Forward</subject><subject>Decoding</subject><subject>Encoding</subject><subject>Frame relay</subject><subject>Lattices</subject><subject>Mathematical model</subject><subject>Network coding</subject><subject>Physical layer Network Coding</subject><subject>Relays</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><recordid>eNo9kNFLwzAQxoMoOKf_gL4UfM68JE2bPEpxKnQOYT6HrEmxs1tm0jL335va4cvdB_d9d8cPoVsCM0JAPpTFcrGYUSDZjHKWCwJnaEI4F5jGch41CInzXIpLdBXCBgAE5WSC3kt3wIXb7lv703THZJB9Z7HeGTx3_qC9SVa2-tw1370NSe18sujbrgmu95UdtbetPiZvtjs4_xWu0UWt22BvTn2KPuZPq-IFl8vn1-KxxBVjssNGZmtt0spKU2VWrGuiueRrwzORgcw0E4wyGk3ADVSa2lQY0ACUMFFDJtgU3Y97994Nv3VqE3_axZOK5EIAE2kG0UVHV-VdCN7Wau-brfZHRUAN6NQfOjWgUyd0MXQ3hhpr7X8gTymncfoLWShrBA</recordid><startdate>201605</startdate><enddate>201605</enddate><creator>Molu, Mehdi M.</creator><creator>Cumanan, Kanapathippillai</creator><creator>Burr, Alister</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope></search><sort><creationdate>201605</creationdate><title>Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks</title><author>Molu, Mehdi M. ; Cumanan, Kanapathippillai ; Burr, Alister</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Computation Rate</topic><topic>Computational modeling</topic><topic>Compute-and-Forward</topic><topic>Decoding</topic><topic>Encoding</topic><topic>Frame relay</topic><topic>Lattices</topic><topic>Mathematical model</topic><topic>Network coding</topic><topic>Physical layer Network Coding</topic><topic>Relays</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Molu, Mehdi M.</creatorcontrib><creatorcontrib>Cumanan, Kanapathippillai</creatorcontrib><creatorcontrib>Burr, Alister</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Xplore Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEL</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Molu, Mehdi M.</au><au>Cumanan, Kanapathippillai</au><au>Burr, Alister</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2016-05</date><risdate>2016</risdate><volume>20</volume><issue>5</issue><spage>926</spage><epage>929</epage><pages>926-929</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>Compute-and-forward (C&amp;F) relaying in a multisource multirelay network is studied in this letter and two novel algorithms are proposed, addressing choice of integer matrix, taking into account the effect of singularity. The first algorithm assumes that there is no co-operation between the nodes for choosing proper integer vectors in the relay nodes; this method is referred to as "blind C&amp;F" and an algorithm is proposed which guarantees that each relay chooses the best integer vector that contains information from at least m source nodes. In the second algorithm that is described as "partially coordinated C&amp;F," we assume that partial cooperation between the relay nodes and propose to exchange a single variable with which the relays are sorted for transmission. The performance of the proposed algorithm is nearly equivalent with optimal relaying, which requires significant overhead signaling.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2016.2537810</doi><tpages>4</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1089-7798
ispartof IEEE communications letters, 2016-05, Vol.20 (5), p.926-929
issn 1089-7798
1558-2558
language eng
recordid cdi_ieee_primary_7425210
source IEEE Electronic Library (IEL) Journals
subjects Algorithms
Computation Rate
Computational modeling
Compute-and-Forward
Decoding
Encoding
Frame relay
Lattices
Mathematical model
Network coding
Physical layer Network Coding
Relays
title Low-Complexity Compute-and-Forward Techniques for Multisource Multirelay Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T03%3A36%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Low-Complexity%20Compute-and-Forward%20Techniques%20for%20Multisource%20Multirelay%20Networks&rft.jtitle=IEEE%20communications%20letters&rft.au=Molu,%20Mehdi%20M.&rft.date=2016-05&rft.volume=20&rft.issue=5&rft.spage=926&rft.epage=929&rft.pages=926-929&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2016.2537810&rft_dat=%3Cproquest_ieee_%3E4051823111%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c339t-d96bad4ce9dc6e8bf1a595bd5686096a38323296b05d0ca2e48d0a002138f0683%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1788038460&rft_id=info:pmid/&rft_ieee_id=7425210&rfr_iscdi=true