Presentation | 2011-08-25 Investigation on Channel Coding for Data Transmission in Mobile Communications Nobuhiko MIKI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Channel coding is inevitable for mobile communications for the receiver to compensate for the degradation of the channel quality due to severe multipath fading. This paper investigates the channel coding scheme especially focusing on data transmission in mobile communications. After describing requirements for channel coding for data transmission such as affinity to adaptive modulation and coding (AMC) and hybrid automatic repeat request with packet combining, high speed transmission, e.g., 100 Mbps, and low processing delay, detailed structure for turbo and low density parity check (LDPC) codes to achieve these requirements are presented. Finally, this paper presents the performance of turbo and LDPC codes. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Mobile communications / turbo code / LDPC code |
Paper # | SAT2011-23,RCS2011-118 |
Date of Issue |
Conference Information | |
Committee | SAT |
---|---|
Conference Date | 2011/8/18(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Satellite Telecommunications (SAT) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Investigation on Channel Coding for Data Transmission in Mobile Communications |
Sub Title (in English) | |
Keyword(1) | Mobile communications |
Keyword(2) | turbo code |
Keyword(3) | LDPC code |
1st Author's Name | Nobuhiko MIKI |
1st Author's Affiliation | NTT DOCOMO, INC.() |
Date | 2011-08-25 |
Paper # | SAT2011-23,RCS2011-118 |
Volume (vol) | vol.111 |
Number (no) | 179 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |