Interleaving is a widely used technique to overcome the burst error in systems featuring error correction. In a non-cooperative environment such as satellite signal in which receiver is not aware of the structure of transmitter, interleaver should be identified, otherwise it would be impossible to identify the residual components and completing the hearing process. In satellite systems, it is a common practice to use a combinatory coding block, including reed-solomon codes and an interleaver with convolutional codes. This research presumes that convolutional code is identified and an algorithm is suggested for recognition of interleaver. In this algorithm, based on the presence of reed-solomon code, interleaving period is identified, non-binary field degree is calculated, and a factor meeting the length of reed-solomon code would be the interleaver depth. Comparing with other available methods, in our suggested algorithm, computational complexity are reduced to and simultaneity and accuracy of identification is higher. Additionally, Based on the simulations performed, the in order to identify the depth of Interleaver and have been used in order to synchronization.
Hajimohammadi, M., & Naseri, A. (2019). An Algorithm for Blind Identification of Block Interleaving Parameters in Communication System via Satellite. Journal of Advanced Defense Science & Technology, 6(2), 87-96.
MLA
Morteza Hajimohammadi; ali Naseri. "An Algorithm for Blind Identification of Block Interleaving Parameters in Communication System via Satellite", Journal of Advanced Defense Science & Technology, 6, 2, 2019, 87-96.
HARVARD
Hajimohammadi, M., Naseri, A. (2019). 'An Algorithm for Blind Identification of Block Interleaving Parameters in Communication System via Satellite', Journal of Advanced Defense Science & Technology, 6(2), pp. 87-96.
VANCOUVER
Hajimohammadi, M., Naseri, A. An Algorithm for Blind Identification of Block Interleaving Parameters in Communication System via Satellite. Journal of Advanced Defense Science & Technology, 2019; 6(2): 87-96.
)
