教師資料查詢 | 類別: 會議論文 | 教師: 李揚漢 Lee Yang-han (瀏覽個人網頁)

標題:The Design of New ARQ Techniques in the Turbo Code
學年
學期
發表日期1999/12/20
作品名稱The Design of New ARQ Techniques in the Turbo Code
作品名稱(其他語言)
著者Lee, Yang-Han; Lo, Lun-Chieh; Leu, Chu-Yang; Gong, Pei-Min; Chen, Meng-Hong
作品所屬單位淡江大學電機工程學系
出版者
會議名稱第二屆一九九九無線電科學研討會
會議地點桃園縣, 臺灣
摘要Since the turbo code introduced by Berrou et al.[1], it attracts much attention because it provides very good coding gain in additive white Gaussian noise (AWGN) channel. In [1], the BER performance can be obtained to 10/sup -5/ at an Eb/No of just 0.7 decibels; however, large block sizes of 65,536 bits are required. In our simulations, when the block sizes are 8,192 bits and Eb/No is under 2 decibels, the BER would be worse than 10/sup -2/, no matter what iteration times are. In this environment, the transmitted packet would be in error because the BER is too high, therefore the Automatic Repeat reQuest (ARQ) technique is needed. However, if the channel is still very noisy, the retransmitted data will need to be retransmitted again and again because it is almost impossible that the packet is error free after decoding when the BER is worse than 10/sup -2/. In order to reduce retransmission times, we will propose two ARQ techniques base on the turbo code in this paper which architectures are shown in Fig. 1 and Fig. 2. Although the authors proposed similar technique in [2], our techniques are much simpler.In our architecture of encoder, the data was packed with the cyclic redundancy code (CRC) before feeding into the turbo code encoder. The receiver will request retransmission if the CRC check failed in the hard decision output of the turbo code decoder. In order to reduce the retransmission times, we use all the transmitted signals to decide the output even the signals are decoded failed in its decoding time. Two architectures of decoder are described as follows:In the first method (Fig.1) that we offered, the received data are decoded using the Soft Output Viterbi Algorithm (SOVA) decoding method introduced in [3]. However, in this method, we combined the soft-output of the retransmitted signal with previous decoded signal which was decoded failed and fed to the hard decision. If the CRC check failed, the transmitter will be requested retransmitted until the CRC check successfully. The difference between the first and second methods is that the second method combined the retransmitted data and the previous transmitted signal before feeding to the decoder such as Fig.2 shown and the soft-output of the decoder is directly sending to the hard decision.The simulation results are shown in the Fig.3. In our simulation, the decoder iterates 10 times for each frame.From these simulation results we find that the second method is better than the first method and using the second method the average retransmission times are much fewer. This can make the turbo code more efficient on data transmission in poor transmission environment.
關鍵字渦輪碼;自動重送要求;誤碼率;解碼演算法;架構;維特比演算法;循環冗餘核對碼;Turbo Code;Automatic Repeat Request;Bit Error Rate;Decoding Algorithm;Architecture;Viterbi Algorithm;Cyclic Redundancy Code
語言英文
收錄於
會議性質國內
校內研討會地點
研討會時間19991220~19991221
通訊作者
國別中華民國
公開徵稿Y
出版型式紙本
出處第二屆一九九九無線電科學研討會論文集=Proceedings of the Second (1999) Radio Science Symposium頁110-111
相關連結
SDGs
Google+ 推薦功能,讓全世界都能看到您的推薦!