DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, SH | ko |
dc.contributor.author | Lee, SJ | ko |
dc.contributor.author | Sung, Dan Keun | ko |
dc.date.accessioned | 2016-11-29T04:55:49Z | - |
dc.date.available | 2016-11-29T04:55:49Z | - |
dc.date.created | 2016-08-29 | - |
dc.date.created | 2016-08-29 | - |
dc.date.issued | 2016-10 | - |
dc.identifier.citation | International Conference on ICT Convergence 2016 (ICTC 2016), pp.804 - 809 | - |
dc.identifier.uri | http://hdl.handle.net/10203/214084 | - |
dc.description.abstract | We propose two rate selection methods in wireless multicast systems where an incremental redundancy type hybrid automatic repeat request (HARQ-IR) scheme is employed under Rayleigh block-fading channels. We aim at maximizing the long-term average transmission rate (LATR) while the maximum number of retransmissions is limited to L-1 and the probability that at least one user fails to decode a message within L (re)transmissions is limited to epsilon. This problem is non-convex and involves complicated integral expressions. To reduce the computational load, we formulate a simplified problem with approximated utility and constraint functions by using the Gaussian approximation. | - |
dc.language | English | - |
dc.publisher | KICS/IEEE ComSoC/IEICE ComSoC | - |
dc.title | Rate Selection for Incremental Redundancy Type Hybrid-ARQ in Wireless Multicast | - |
dc.type | Conference | - |
dc.identifier.wosid | 000445267100176 | - |
dc.identifier.scopusid | 2-s2.0-85015742017 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 804 | - |
dc.citation.endingpage | 809 | - |
dc.citation.publicationname | International Conference on ICT Convergence 2016 (ICTC 2016) | - |
dc.identifier.conferencecountry | KO | - |
dc.identifier.conferencelocation | Jeju | - |
dc.identifier.doi | 10.1109/ICTC.2016.7763302 | - |
dc.contributor.localauthor | Sung, Dan Keun | - |
dc.contributor.nonIdAuthor | Kim, SH | - |
dc.contributor.nonIdAuthor | Lee, SJ | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.