國立虎尾科技大學 |

Energy Consumption of Error Control Coding Circuits.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Energy Consumption of Error Control Coding Circuits./
作者:	Blake, Christopher Graham.
面頁冊數:	1 online resource (161 pages)
附註:	Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
標題:	Electrical engineering. -
電子資源:	click for full text (PQDT)
ISBN:	9780355127461

Energy Consumption of Error Control Coding Circuits.
Blake, Christopher Graham.

Energy Consumption of Error Control Coding Circuits. - 1 online resource (161 pages)

Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.

Thesis (Ph.D.)--University of Toronto (Canada), 2017.

Includes bibliographical references

The energy complexity of error control coding circuits is analyzed within the Thompson VLSI model. It is shown that fully-parallel encoding and decoding schemes with asymptotic block error probability that scales as O (f (N)) where N is block length (called f(N)-coding schemes) have energy that scales as O(√ln f (N)N. As well, it is shown that the number of clock cycles (denoted T (N)) required for any encoding or decoding scheme that reaches this bound must scale as T (n) ≥ √ln f (N). Similar scaling results are extended to serialized computation.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780355127461Subjects--Topical Terms:

596380
Electrical engineering.
Index Terms--Genre/Form:

554714
Electronic books.

Energy Consumption of Error Control Coding Circuits.
LDR:03825ntm a2200361K 4500 001 913885
005 20180628100930.5
006 m o u
007 cr mn||||a|a||
008 190606s2017 xx obm 000 0 eng d
020 $a 9780355127461
035 $a (MiAaPQ)AAI10253092
035 $a (MiAaPQ)toronto:15214
035 $a AAI10253092
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Blake, Christopher Graham. $3 1186902
245 1 0 $a Energy Consumption of Error Control Coding Circuits.
264 0 $c 2017
300 $a 1 online resource (161 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 78-12(E), Section: B.
500 $a Adviser: Frank R. Kschischang.
502 $a Thesis (Ph.D.)--University of Toronto (Canada), 2017.
504 $a Includes bibliographical references
520 $a The energy complexity of error control coding circuits is analyzed within the Thompson VLSI model. It is shown that fully-parallel encoding and decoding schemes with asymptotic block error probability that scales as O (f (N)) where N is block length (called f(N)-coding schemes) have energy that scales as O(√ln f (N)N. As well, it is shown that the number of clock cycles (denoted T (N)) required for any encoding or decoding scheme that reaches this bound must scale as T (n) ≥ √ln f (N). Similar scaling results are extended to serialized computation.
520 $a Sequences of randomly generated bipartite configurations are analyzed; under mild conditions almost surely such configurations have minimum bisection width proportional to the number of vertices. This implies an almost sure O(N2/d 2max scaling rule for the energy of directly-implemented LDPC decoder circuits for codes with maximum node degree d max. It also implies an O(N3/2}/ dmax lower bound for serialized LDPC decoders. It is also shown that all (as opposed to almost all) capacity-approaching, directly-implemented non-split-node LDPC decoding circuits, have energy, per iteration, that scales as O(chi2ln3chi), where chi=(1-R/C)-1 is the reciprocal gap to capacity, R is code rate and C is channel capacity.
520 $a It is shown that all polar encoding schemes of rate R>½ of block length N implemented according to the Thompson VLSI model must take energy E≥O(N 3/2. This lower bound is achievable up to polylogarithmic factors using a mesh network topology defined by Thompson and the encoding algorithm defined by Ariotakan. A general class of circuits that compute successive cancellation decoding adapted from Ariotakan's butterfly network algorithm is defined. It is shown that such decoders implemented on a rectangle grid for codes of rate R>2/3 must take energy E≥O( N3/2, and this can also be reached up to polylogarithmic factors using a mesh network. Capacity approaching sequences of energy optimal polar encoders and decoders, as a function of reciprocal gap to capacity chi = (1-R/C)-1, have energy that scales as O(chi 5.3685)≤ E ≤ O(chi 7.071log4(chi)).
520 $a It is shown that all sufficiently large communication graphs of algorithms of bounded degree can be implemented on a mesh network with routing conflicts of size at most log(N). This implies, conditioned on an assumption, that for all f(N) < e---O(N).
520 $a The Grover information-friction energy model is generalized to three dimensions and the optimal energy of encoding or decoding schemes with probability of block error Pe is shown to be at least O( N(ln Pe(N))1/3 ).
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Electrical engineering. $3 596380
655 7 $a Electronic books. $2 local $3 554714
690 $a 0544
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of Toronto (Canada). $b Electrical and Computer Engineering. $3 1148628
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10253092 $z click for full text (PQDT)