Orthogonal code hopping multiplexing
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Park, S | ko |
| dc.contributor.author | Sung, Dan Keun | ko |
| dc.date.accessioned | 2013-03-03T14:40:31Z | - |
| dc.date.available | 2013-03-03T14:40:31Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2002-12 | - |
| dc.identifier.citation | IEEE COMMUNICATIONS LETTERS, v.6, no.12, pp.529 - 531 | - |
| dc.identifier.issn | 1089-7798 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/79112 | - |
| dc.description.abstract | An orthogonal code, hopping multiplexing scheme is proposed as a statistical multiplexing scheme for orthogonal downlink in order to accommodate more orthogonal downlink channels than orthogonal codewords for mobile stations, and its performance is evaluated. | - |
| dc.language | English | - |
| dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
| dc.title | Orthogonal code hopping multiplexing | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000179897700005 | - |
| dc.identifier.scopusid | 2-s2.0-0036950594 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 6 | - |
| dc.citation.issue | 12 | - |
| dc.citation.beginningpage | 529 | - |
| dc.citation.endingpage | 531 | - |
| dc.citation.publicationname | IEEE COMMUNICATIONS LETTERS | - |
| dc.contributor.localauthor | Sung, Dan Keun | - |
| dc.contributor.nonIdAuthor | Park, S | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | orthogonal code division multiplexing (OCDM) | - |
| dc.subject.keywordAuthor | orthogonal code hopping multiplexing (OCHM) | - |
| dc.subject.keywordAuthor | perforation | - |
| dc.subject.keywordAuthor | synergy | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 29 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.