IEICE TRANSACTIONS on Fundamentals
Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.7 pp.1696-1701
- Publication Date
- 2002/07/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Multi-dimensional Mobile Information Networks)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Ken-ichi TAKIZAWA, Shigenobu SASAKI, Shogo MURAMATSU, Jie ZHOU, Hisakazu KIKUCHI, "Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 7, pp. 1696-1701, July 2002, doi: .
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_7_1696/_p
Copy
@ARTICLE{e85-a_7_1696,
author={Ken-ichi TAKIZAWA, Shigenobu SASAKI, Shogo MURAMATSU, Jie ZHOU, Hisakazu KIKUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems},
year={2002},
volume={E85-A},
number={7},
pages={1696-1701},
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.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Performance Bounds in Convolutional Coded Parallel Combinatorial SS Systems
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1696
EP - 1701
AU - Ken-ichi TAKIZAWA
AU - Shigenobu SASAKI
AU - Shogo MURAMATSU
AU - Jie ZHOU
AU - Hisakazu KIKUCHI
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2002
AB - 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.
ER -
English
