Title | Performance of chip coding in FFH SSMA systems |
Publication Type | Journal Article |
Year of Publication | 1996 |
Authors | Yashima, H., Q. Wang, and V. K. Bhargava |
Journal | Selected Areas in Communications, IEEE Journal on |
Volume | 14 |
Pagination | 1841 -1851 |
Date Published | dec. |
ISSN | 0733-8716 |
Keywords | asynchronous hopping system, channel capacity, chip coding, code rate, convolutional code, convolutional codes, convolutional coding, decoding, FFH SSMA systems, FFH systems, fixed total bandwidth, frequency hop communication, frequency hopper, frequency hopping spread spectrum multiple access, information bit rate, information symbol, multi-access systems, no side information, perfect side information, performance evaluation, probability, probability density functions, ratio threshold test, received signal, repetition codes, repetition coding, spread spectrum communication, threshold decoding, Viterbi decoding |
Abstract | This paper proposes chip coding using convolutional codes for fast frequency-hopping spread-spectrum multiple-access (FFH-SSMA) systems. Its performance is evaluated and compared with that of repetition coding which is most commonly used in FFH systems. In our proposal, an information symbol is encoded by a convolutional code of rate 1/n and n chips are transmitted through a frequency hopper. We consider three models when perfect side information (PSI) is available, no side information (NSI) is available, and the ratio threshold test (RTT) is used. The probability density functions (PDFs) of the received signal are derived for asynchronous hopping systems. The performances of convolutional coding with threshold decoding and Viterbi decoding are presented under the constraint of fixed total bandwidth and information bit rate. In comparison with repetition codes, it is found that convolutional codes drastically enhance the system performance. It is identified that Viterbi decoding with RTT offers the most significant performance improvement |
URL | http://dx.doi.org/10.1109/49.545706 |
DOI | 10.1109/49.545706 |