2017
DOI: 10.1016/j.nancom.2016.09.003
|View full text |Cite
|
Sign up to set email alerts
|

Energy requirements of error correction codes in diffusion-based molecular communication systems

Abstract: Permanent WRAP URL:http://wrap.warwick.ac.uk/81742 Copyright and reuse:The Warwick Research Archive Portal (WRAP) makes this work by researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP has been checked for eligibility before being made available.Copies … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 38 publications
(55 reference statements)
0
13
0
Order By: Relevance
“…Hence, the channel memory is infinite, stating the need to have infinitely many h[n]'s to perfectly model the channel. However, for all practical purposes, the channel can be modeled with an FIR model, by considering only the first L memory elements [22]. For an accurate representation of the channel, this paper considers channel memory L = 30.…”
Section: B the Mcvd Channel And The Channel Coefficientsmentioning
confidence: 99%
“…Hence, the channel memory is infinite, stating the need to have infinitely many h[n]'s to perfectly model the channel. However, for all practical purposes, the channel can be modeled with an FIR model, by considering only the first L memory elements [22]. For an accurate representation of the channel, this paper considers channel memory L = 30.…”
Section: B the Mcvd Channel And The Channel Coefficientsmentioning
confidence: 99%
“…In a tradeoff of having larger codeword lengths against generating codewords with lower average weights by using more 0bits, the authors trade between the rate and the energy efficiency of communication. In subsequent works [221], [222], again, over the same channel except with an absorbing receiver in [222], self-orthogonal convolutional codes (SOCCs) are proposed, and their performances against Hamming MECs and uncoded transmissions are investigated with respect to both BER and energy efficiency. Both works conclude that in nanoscale, MC SOCCs have higher coding gains, i.e., they are more energy efficient, compared to the uncoded transmission and to the Hamming MECs for the low BER (10 −5 -10 −9 ) region.…”
Section: (A) Employed Codewords For Two States Eg Starting Withmentioning
confidence: 99%
“…Moreover, SOCCs are also reported to have shorter critical distances than the Hamming MECs, where the critical distance is defined as the distance, at which extra energy requirements of employing coding are compensated by the coding gain. Lu et al [222] additionally explore the energy budget of nano-to-macro and macro-to-nanomachine MCs and arrive at the conclusion that in MC involving macromachines, the critical distance of the codes decreases. Yet, in another work [223], the Hamming codes are evaluated against cyclic 2-D Euclidean geometry low-density parity-check (EG-LDPC) and cyclic Reed-Muller codes by considering the same channel model, as in [222].…”
Section: (A) Employed Codewords For Two States Eg Starting Withmentioning
confidence: 99%
See 1 more Smart Citation
“…Here, L denotes the ISI window (channel memory) of the MCvD system at hand. Even though the heavy right tail of (1) causes the actual channel memory to be infinite, a finite but large L is chosen for practical purposes [19]. Mathematically, the k th channel coefficient of an MCvD system with symbol duration t s can be expressed as…”
Section: System Modelmentioning
confidence: 99%