Publications
Detailed Information
Design of Protograph LDPC Codes Using Resolvable Block Designs for Block Fading Channel
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaewha | - |
dc.contributor.author | Kim, Chanki | - |
dc.contributor.author | Park, Hosung | - |
dc.contributor.author | No, Jong-Seon | - |
dc.date.accessioned | 2022-10-07T06:19:33Z | - |
dc.date.available | 2022-10-07T06:19:33Z | - |
dc.date.created | 2022-09-20 | - |
dc.date.issued | 2022-09 | - |
dc.identifier.citation | IEEE Wireless Communications Letters, Vol.11 No.9, pp.1970-1974 | - |
dc.identifier.issn | 2162-2337 | - |
dc.identifier.uri | https://hdl.handle.net/10371/185622 | - |
dc.description.abstract | In this letter, we propose new protograph low-density parity-check (LDPC) codes of high code rates using resolvable block designs (RBDs) for block fading (BF) channels. To analyze the performance of the proposed LDPC codes, we derive an upper bound on bit error rate (BER) using the novel method, called the gamma evolution. Finally, we numerically show that the frame error rate (FER) of the proposed LDPC codes has a slope approaching the channel outage probability. | - |
dc.language | 영어 | - |
dc.publisher | IEEE Communications Society | - |
dc.title | Design of Protograph LDPC Codes Using Resolvable Block Designs for Block Fading Channel | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/LWC.2022.3190026 | - |
dc.citation.journaltitle | IEEE Wireless Communications Letters | - |
dc.identifier.wosid | 000852215400044 | - |
dc.identifier.scopusid | 2-s2.0-85134292909 | - |
dc.citation.endpage | 1974 | - |
dc.citation.number | 9 | - |
dc.citation.startpage | 1970 | - |
dc.citation.volume | 11 | - |
dc.description.isOpenAccess | N | - |
dc.contributor.affiliatedAuthor | No, Jong-Seon | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
- Appears in Collections:
- Files in This Item:
- There are no files associated with this item.
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.