Improved Orthogonal Code Hoppong Multiplexing using Both Division and Hopping

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 382
  • Download : 0
DC FieldValueLanguage
dc.contributor.author박수원ko
dc.contributor.author성단근ko
dc.contributor.author권재균ko
dc.date.accessioned2013-03-06T17:20:11Z-
dc.date.available2013-03-06T17:20:11Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2008-03-
dc.identifier.citation한국통신학회논문지, v.33, no.3, pp.277 - 285-
dc.identifier.issn1226-4717-
dc.identifier.urihttp://hdl.handle.net/10203/87756-
dc.description.abstractWe previously proposed an Orthogonal Code Hopping Multiplexing (OCHM) scheme for statistical multiplexing on a synchronous downlink. OCHM enables a large number of users to share a limited number of code channels through statistical multiplexing. We here improve the performance of OCHM by prioritizing encoded symbols according to their importance using both the conventional code division and the previously proposed code hopping multiplexing schemes. Prioritization is useful for channel coding schemes with different levels of importance for encoded symbols such as turbo-codes. Scheme performance is evaluated by simulation in terms of the required Eb/N0 for a 1% block error rate.-
dc.languageEnglish-
dc.publisher한국통신학회-
dc.titleImproved Orthogonal Code Hoppong Multiplexing using Both Division and Hopping-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume33-
dc.citation.issue3-
dc.citation.beginningpage277-
dc.citation.endingpage285-
dc.citation.publicationname한국통신학회논문지-
dc.identifier.kciidART001236281-
dc.contributor.localauthor성단근-
dc.contributor.nonIdAuthor박수원-
dc.contributor.nonIdAuthor권재균-
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0