Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 30526


Select areas to restrict search in scientific publication database:
140
Matrix-Interleaved Serially Concatenated Block Codes for Speech Transmission in Fixed Wireless Communication Systems
Authors:
Abstract:
In this paper, we study a class of serially concatenated block codes (SCBC) based on matrix interleavers, to be employed in fixed wireless communication systems. The performances of SCBC¬coded systems are investigated under various interleaver dimensions. Numerical results reveal that the matrix interleaver could be a competitive candidate over conventional block interleaver for frame lengths of 200 bits; hence, the SCBC coding based on matrix interleaver is a promising technique to be employed for speech transmission applications in many international standards such as pan-European Global System for Mobile communications (GSM), Digital Cellular Systems (DCS) 1800, and Joint Detection Code Division Multiple Access (JD-CDMA) mobile radio systems, where the speech frame contains around 200 bits.
Digital Object Identifier (DOI):

References:

[1] C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding: Turbo Codes," in Proc. IEEE ICC '93, Geneva Switzerland, June 1993, pp. 1064-1070.
[2] S. Benedetto and G: Montorsi, "Serial concatenation of block and convolutional codes," Elctron. Lett., vol. 32, pp. 887-888, May 1996.
[3] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol.IT-20, pp. 284-287, Mar. 1974.
[4] L. C. Perez, J. Seghers, and D. J. Costello, "A distance spectrum interpretation of turbo codes," IEEE Trans. Inform. Theory, vol.42, pp. 1698-1709, Nov. 1996.
[5] M. Arif, N. M. Sheikh, and A. U. H. Sheikh, "A new deterministic interleaver for turbo codes," International Symposium on Wireless Communications (ISWSN'05), 2005.
[6] P. Jung and M. Nasshan, "Dependence of the error performance of turbo-codes on the interleaver structure in short frame transmission systems," Electron. Lett., vol. 30, no. 4, pp. 287-288, Feb. 1994.
[7] J. Y. Kim, and H. V. Poor, "Turbo-coded optical direct-detection CDMA system with PPM modulation," J. Lightw. Technol. vol. 19, no. 3, pp. 312-322, Mar. 2001.
[8] Rose Y. Shao, Shu Lin, and Marc P. C. Fossorier, "Two simple stopping criteria for turbo decoding," IEEE Trans. Commun., vol. 47, no. 8, Aug. 1999, pp. 1117-1120.
[9] Y. Wu, B. Woemer, and J. Ebel, "A simple stopping criterion for turbo decoding," IEEE Commun. Lett., vol. 4, no. 8, Aug. 2000, pp. 258-260.
[10] T. M. N. Ngatched and F. Takawira, "Simple stopping criterion for turbo decoding," Electronics Lett, vol. 37, no. 22, Oct. 2001, pp. 1350-1351.
[11] M. M. Salah, "Turbo codes for wireless mobile communication systems applications", PhD Dissertation, Air Force Institute of Technology, June 2000.
[12] P. A. Ramsdale, "Personal Communications in the UK-Implementation of PCN using DCS 1800", Int. J. on Wireless Information Networks, vol. 1, pp. 29-36, 1994.
[13] P. Jung, and M. Nabhan, "Applying turbo-codes to the up link in a JD-CDMA mobile radio system using coherent receiver antenna diversity," in proc. ITG conf., Munich, 1994, vol. 130, pp. 49-56.
[14] R. L. Peterson, R. E. Zeimer, and D. E. Borth, Introduction to Spread Spectrum Communications, Prentice-Hall, Inc, 1995.
[15] A. F. Molisch, Wireless Communications, Uk: Wiley and IEEE, 2005.
[16] IEEE 802.16 Broadband Wireless Access Working Group, "Channel models for fixed wireless applications", IEEE 802.16a-03/01, 2003.
[17] M. Cherniacov, "Modern Communication Systems" Lecture notes, Chapter: Digital Modulations, 2008.
[18] P. Robertson, E. Villebrun, P. Hoeher, "A comparison of optimal and sub-optimal MAP decoding algorithms operating in teh log domain", IEEE int. conf. on commun. (ICC'95), seattle, 1995. vol. 2, pp. 1009-1013.
Vol:14 No:07 2020Vol:14 No:06 2020Vol:14 No:05 2020Vol:14 No:04 2020Vol:14 No:03 2020Vol:14 No:02 2020Vol:14 No:01 2020
Vol:13 No:12 2019Vol:13 No:11 2019Vol:13 No:10 2019Vol:13 No:09 2019Vol:13 No:08 2019Vol:13 No:07 2019Vol:13 No:06 2019Vol:13 No:05 2019Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007