WEKO3
アイテム
Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems
http://hdl.handle.net/10191/6213
http://hdl.handle.net/10191/6213ba40277c-ab41-4531-8671-4ec3bfa1bee0
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2008-04-08 | |||||
タイトル | ||||||
タイトル | Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems | |||||
言語 | ||||||
言語 | eng | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | multicode SS | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | convolutional codes | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | iterative demodulation and decoding | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Takizawa, Ken-ichi
× Takizawa, Ken-ichi× Sasaki, Shigenobu× Muramatsu, Shogo× Zhou, Jie× Kikuchi, Hisakazu |
|||||
著者別名 | ||||||
識別子 | 6054 | |||||
識別子Scheme | WEKO | |||||
姓名 | 佐々木, 重信 | |||||
著者別名 | ||||||
識別子 | 6055 | |||||
識別子Scheme | WEKO | |||||
姓名 | 村松, 正吾 | |||||
著者別名 | ||||||
識別子 | 6056 | |||||
識別子Scheme | WEKO | |||||
姓名 | 菊池, 久和 | |||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Upper bounds on the bit error rate (BER) for maximum likelihood (ML) decoding are derived in convolutional coded parallel combinatorial spread spectrum (PC/SS) systems over additive white Gaussian noise (AWGN) channels. PC/SS systems can achieve higher data transmission than conventional multicode SS systems. To make the derivation tractable, we put a uniform interleaver between a convolutional encoder and a PC/SS transmitter. Since the PC/SS transmitter is employed as the "inner encoder," the bounds are obtained in a similar manner of the derivation in serially concatenated codes through a uniform interleaver. Two different error patterns in the PC/SS system are considered in the performance analysis. Numerical results show that the derived BER bounds are sufficiently accurate. It is found that the coded PC/SS systems outperform coded all-code-parallel DS/SS systems under the same data rate conditions if the number of pre-assigned PN codes increases. | |||||
書誌情報 |
IEICE transactions on fundamentals of electronics, communications and computer sciences en : IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 E85-A, 号 7, p. 1696-1701, 発行日 2002-07 |
|||||
出版者 | ||||||
出版者 | The Institute of Electronics, Information and Communication Engineers | |||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 09168508 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA10826239 | |||||
権利 | ||||||
権利情報 | copyright©2002 IEICE(許諾番号07RB0183) | |||||
著者版フラグ | ||||||
値 | publisher | |||||
異版である | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | URI | |||||
関連識別子 | http://www.ieice.org/jpn/trans_online/ |