語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Analysis and Design of Staircase Cod...
~
Zhang, Lei.
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication.
紀錄類型:
書目-語言資料,手稿 : Monograph/item
正題名/作者:
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication./
作者:
Zhang, Lei.
面頁冊數:
1 online resource (138 pages)
附註:
Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
標題:
Electrical engineering. -
電子資源:
click for full text (PQDT)
ISBN:
9780355457483
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication.
Zhang, Lei.
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication.
- 1 online resource (138 pages)
Source: Dissertation Abstracts International, Volume: 79-04(E), Section: B.
Thesis (Ph.D.)--University of Toronto (Canada), 2017.
Includes bibliographical references
Low-complexity, iterative hard-decision decoded staircase codes for hard-decision optical transport-networks (OTNs) are designed, with overheads (OH) between 6.25% and 33.3%. Extensive software simulations are performed for all code designs. Net coding gain gaps to hard-decision capacity are found to range from 0.45 dB at 6.25% OH to 1.38 dB at 33.3% OH. All code designs with ≤ 25.0% OH achieved net coding gains within 1.0 dB of hard-decision channel capacity.
Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018
Mode of access: World Wide Web
ISBN: 9780355457483Subjects--Topical Terms:
596380
Electrical engineering.
Index Terms--Genre/Form:
554714
Electronic books.
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication.
LDR
:03110ntm a2200337K 4500
001
913892
005
20180628100930.5
006
m o u
007
cr mn||||a|a||
008
190606s2017 xx obm 000 0 eng d
020
$a
9780355457483
035
$a
(MiAaPQ)AAI10256941
035
$a
(MiAaPQ)toronto:15393
035
$a
AAI10256941
040
$a
MiAaPQ
$b
eng
$c
MiAaPQ
100
1
$a
Zhang, Lei.
$3
1102845
245
1 0
$a
Analysis and Design of Staircase Codes for High Bit-Rate Fibre-Optic Communication.
264
0
$c
2017
300
$a
1 online resource (138 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: 79-04(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
Low-complexity, iterative hard-decision decoded staircase codes for hard-decision optical transport-networks (OTNs) are designed, with overheads (OH) between 6.25% and 33.3%. Extensive software simulations are performed for all code designs. Net coding gain gaps to hard-decision capacity are found to range from 0.45 dB at 6.25% OH to 1.38 dB at 33.3% OH. All code designs with ≤ 25.0% OH achieved net coding gains within 1.0 dB of hard-decision channel capacity.
520
$a
The spatially-coupled split-component (SCSC) ensemble is defined, generalizing the structures of staircase and braided block codes. An analysis of SCSC ensembles is given for the binary erasure channel, using the differential equation method of random graph theory and the potential function analysis of spatially-coupled systems. The erasure channel analysis is used to approximate the binary symmetric channel performance. Simulation results show that the analysis gives an accurate prediction of staircase code performance when the size of a staircase block is large (more than 106 bits). Generalizations such as mixture ensembles containing different component codes and SCSC ensembles decoded by beyond bounded-distance component code decoders are also analyzed.
520
$a
A concatenated coding scheme for soft-decision OTN is proposed, consisting of an inner low-density generator-matrix (LDGM) code and an outer staircase code. The LDGM code is designed while taking into account its decoding complexity, measured as the product of the maximum number of iterations and the number of edges in the code graph. The Pareto frontiers between decoding complexity and net coding gain of the concatenated coding scheme are evaluated for several OTN overheads. Simulations of concatenated coding scheme examples at 20% overhead show the same net coding gains as the best existing soft-decision OTN coding schemes, with up to 68% reduction in decoding complexity.
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=10256941
$z
click for full text (PQDT)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入