Sequential decoding of GMSK in a Rayleigh fading channel | |
| Author | Kritsada Chongcharoensrisiri |
| Call Number | AIT RSPR no.TC-97-19 |
| Subject(s) | Digital communications Mobile communication systems |
| Note | A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. TC-97-19 |
| Abstract | Continuous phase modulation (CPM) plays an important role in the mobile communications. The CPM receiver often requires a maximum likelihood sequence detector using the Viterbi algorithm (VA). The conventional VA was prop.osed for convolutional decoding and the sequential algorithm was proposed for convolutional decoding also. The operation of sequential algorithm required a small computational complexity with respect to conventional VA By using sequential decoding techniques to detect the binary CPM signals, we develop a single stack algorithm detector when perfect channel estimation and coherent demodulation are assumed. The performance of sequential decoding of Gaussian minimum shift keying (GMSK) is evaluated in a frequency selective fading channel. The fading channel is modeled as a two-ray Rayleigh fading channel. The performance is evaluated by computer simulation. The bit-error rate (BER) performance and computation complexity are compared with the conventional Viterbi algorithm. The results of bit-error rate show that Viterbi algorithm is slightly better than sequential algorithm when the detector employs a single stack algorithm. However, the Viterbi algorithm is an inefficient method, in terms of average number of paths searched with respect to the sequential algorithm when noise level is low. The simulation results of computational complexity show that the sequential (single stack) algorithm allows the significant reduction of the computational complexity with respect to the conventional Viterbi algorithm. Therefore, the sequential algorithm is a good candidate for future mobile communications and real time applications. |
| Year | 1997 |
| Corresponding Series Added Entry | Asian Institute of Technology. Research studies project report ; no. TC-97-19 |
| Type | Research Study Project Report (RSPR) |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Telecommunications (TC) |
| Chairperson(s) | Rajatheva, Premanandana |
| Examination Committee(s) | Makelainen, Kimmo;Zhang, Jian-Guo |
| Scholarship Donor(s) | The Communications Authority of'Thailand (CAT) |
| Degree | Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1997 |