Improved Orthogonal Code Hoppong Multiplexing using Both Division and Hopping

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 381
  • Download : 0
We 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.
Publisher
한국통신학회
Issue Date
2008-03
Language
English
Citation

한국통신학회논문지, v.33, no.3, pp.277 - 285

ISSN
1226-4717
URI
http://hdl.handle.net/10203/87756
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