Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Communication Engineering / 電信工程學研究所
  4. On LDPC Convolutional Codes with Tight Free Distance Bound
 
  • Details

On LDPC Convolutional Codes with Tight Free Distance Bound

Date Issued
2015
Date
2015
Author(s)
Chen, Tien-Hui
URI
http://ntur.lib.ntu.edu.tw//handle/246246/276646
Abstract
A trellis code, which is constructed by using the encoder of a basic convolutional code with a short constraint length followed by a delay processor and a signal mapper, is equivalent to a trellis code with a large constraint length. In addition, for such a code, tight lower and upper bounds on the free distance can be obtained. In this thesis, we use this code structure to construct low density parity check convolutional codes (LDPC-CCs). The undesired 4-cycles that exist in the Tanner graph for the proposed LDPC convolutional codes are as a result of the inherited properties of the code structure. To remove these undesired cycles, two unique schemes are employed. For the first scheme, denoted as auxiliary-nodes construction (ANC), we employ additional auxiliary nodes to remove 4-cycles. For the second, denoted as the protograph based construction (PGC), we use the concept of protograph to obtain a derived code which extends the size of parity-check matrix so as to increase the girth. Both schemes can be efficiently decoded by the iterative message-passing algorithm which is also called the pipeline decoder. Simulation results show that the newly constructed codes can obtain satisfactory error performances as compared to code that has 4-cycles. We also propose two additional iterative decoding algorithms, denoted as IDEC 1 and IDEC 2 respectively for the ANC construction. For IDEC 1, a loop of the iteration between the trellis of the basic convolutional code and the signal mapper is employed. For IDEC 2, a two-stage decoding is employed, where in the first stage IDEC 1 is implemented, and the derived soft information for auxiliary nodes is sent to the pipeline decoder of the ANC to enable the second-stage decoding to be performed.
Subjects
LDPC-CC
LDPC
Protograph
Trellis code
iterative decoding
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-104-D95942018-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):932b8b884a601a1020bc03d2f7b77f3f

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science