Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005.

Volume 1 • 27-30 May 2005

Go

Filter Results

Displaying Results 1 - 25 of 161
  • 2005 International Conference on Communications, Circuits and Systems Proceedings- Volume 1

    Publication Year: 2005, Page(s): 0_1
    Request permission for commercial reuse | PDF file iconPDF (159 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2005, Page(s): 0_2
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2005, Page(s): 0_3
    Request permission for commercial reuse | PDF file iconPDF (12 KB)
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2005, Page(s): 0_4
    Request permission for commercial reuse | PDF file iconPDF (12 KB)
    Freely Available from IEEE
  • 2005 International Conference on Communications, Circuits and Systems. Volume I. Communication Theory and Systems (IEEE Cat. No. 05EX1034)

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Copyright

    Publication Year: 2005, Page(s): 0_6
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • Welcome to ICCCAS2005

    Publication Year: 2005, Page(s): 0_7
    Request permission for commercial reuse | PDF file iconPDF (106 KB) | HTML iconHTML
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2005, Page(s): 0_8
    Request permission for commercial reuse | PDF file iconPDF (12 KB)
    Freely Available from IEEE
  • ICCCAS2005 Steering Committee

    Publication Year: 2005, Page(s):0_9 - 0_18
    Request permission for commercial reuse | PDF file iconPDF (988 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2005, Page(s):0_19 - xv
    Request permission for commercial reuse | PDF file iconPDF (1698 KB)
    Freely Available from IEEE
  • Keynote speech abstracts

    Publication Year: 2005, Page(s):xvi - xvii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Presents abstracts of the keynote speeches presented at the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple ARQ mapping diversity and sphere decoding in MIMO wireless communications

    Publication Year: 2005, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (182 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance comparison between non-binary LDPC codes and Reed-Solomon codes over noise bursts channels

    Publication Year: 2005, Page(s):1 - 4 Vol. 1
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (609 KB) | HTML iconHTML

    In this paper, the performance of non-binary low-density parity-check (LDPC) codes is investigated with high rates (R > 2/3), and small block lengths (N < 5000 bits) over noise bursts channels, and is compared with that of Reed-Solomon (RS) codes. Meanwhile, a new optimized encoding scheme of non-binary LDPC codes is presented, and a new decoding algorithm with reduced-complexity is introduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure protection for improving performance of low-density parity-check codes

    Publication Year: 2005, Page(s):5 - 8 Vol. 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (626 KB) | HTML iconHTML

    As Tanner graphs (TG) of LDPC codes and channel noise distributions have some relationship, codes have considerable variation in performance even if they have a given code, given iterative decoding algorithm and given channel model. We present a new structure protection algorithm based on what we define as the noise sensitive nodes of TG. The structure protection algorithm can reduce the probabili... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semi-random construction of quasi-cyclic LDPC codes

    Publication Year: 2005, Page(s):9 - 13 Vol. 1
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    This paper presents a semi-random construction of quasi-cyclic LDPC codes, namely, the base incidence vectors are generated by computer search, and then the remainder incidence vectors are obtained by cyclically shifting these base incidence vectors. It is more flexible to construct QC-LDPC than pure geometric or algebraic methods. The simulation results demonstrate that QC-LDPC codes based on thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient frequency domain decoding of binary BCH codes based on prime-factor FFT

    Publication Year: 2005, Page(s):14 - 17 Vol. 1
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB) | HTML iconHTML

    By introducing the ideas of reducing computation complexity in the fast Fourier transform (FFT) to decoding, a low complexity decoding of binary BCH codes is derived which transforms the determination of one-dimensional error word into two-dimensional matrix. For the case of double-error-correcting binary BCH codes, the frequency domain decoding based on prime-factor FFT (in short, PF-FDD) was des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On importance sampling for iteratively decoded linear block codes

    Publication Year: 2005, Page(s):18 - 23 Vol. 1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB) | HTML iconHTML

    We introduce an importance sampling (IS) scheme for fast performance evaluation of the linear block codes with message-passing decoding. This novel scheme overcomes the existing difficulties in IS to some extent when code length is large and requires codebook information. Experiments show very high IS gains for iteratively decoded linear block codes such as single parity-check (SPC) codes and bloc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using the convolutional codes with maximum slope to optimize performance of woven convolutional codes

    Publication Year: 2005, Page(s):24 - 27 Vol. 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB) | HTML iconHTML

    Woven convolutional code (WCC) introduced in recent years is a new efficient error-correcting code. In this paper, we present a novel optimizing design method where the convolutional codes with maximum slope are used as the component codes of woven convolutional codes. The system simulation results show that the error-correcting performance of WCC is improved greatly. It is of great theoretical an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An effective stopping scheme for reduced-complexity iterative decoding of short-frame turbo codes

    Publication Year: 2005, Page(s):28 - 30 Vol. 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    In this paper, an effective stopping scheme for reduced-complexity iterative decoding of short-frame turbo codes with no performance degradation is proposed. The results show that, compared with the existing scheme, the new scheme can offer better BER performance, and at the same time, achieve about 30% more complexity reduction for short-frame turbo codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Study on turbo-DFH technique

    Publication Year: 2005, Page(s):31 - 34 Vol. 1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (562 KB) | HTML iconHTML

    In this paper, we combine the turbo codes with differential frequency hopping (DFH) technique and propose a new turbo-DFH technique. The structure of the turbo-DFH encoder and decoder is given. The modified log-MAP algorithm is addressed, which is used by the turbo-DFH decoder in the iterative decoding process. Simulation results show that the bit error rate (BER) performance of the turbo-DFH syst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantization issues in turbo decoding

    Publication Year: 2005, Page(s):35 - 39 Vol. 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (877 KB) | HTML iconHTML

    It is necessary to quantize the variables in VLSI implementation of a turbo decoder. When the quantile interval of received symbol sequence (RSS) is fixed, the required precision of state metrics, log-likelihood ratio, etc are limited by the RSS quantizing error propagation. By the analysis of error propagation, two different quantization schemes are presented for different performance demand with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New research of UEP using source-optimized channel coding or power allocation schemes

    Publication Year: 2005, Page(s):40 - 44 Vol. 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB) | HTML iconHTML

    Two novel kinds of unequal error protection (UEP) schemes using turbo codes combined with embedded zerotree wavelet (EZW) coded image transmission are proposed. According to the characteristics of the EZW coded bit stream, substreams are obtained by dividing the EZW coded bit stream into several segments. Then, the substreams with more importance are better protected using greater transmission pow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Existence of quantum event-error detecting code

    Publication Year: 2005, Page(s):45 - 50 Vol. 1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1022 KB) | HTML iconHTML

    A novel quantum detection code is first proposed, analogous to the classic event-error detection code, which can detect simultaneously random and burst quantum errors. The proposed code, called quantum event-error detection code, can detect the length, number and location of the quantum errors in every listed quantum error event. Especially, two kinds of quantum event-error detection codes are con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space time variable length coding for wireless multimedia communications

    Publication Year: 2005, Page(s):51 - 55 Vol. 1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (926 KB) | HTML iconHTML

    A binary space time variable length coding (STVLC) scheme is proposed for transmission of digital signals with non-uniform occurrence probability distributions in delay-sensitive wireless systems. The proposed STVLC scheme is a unified source coding, channel coding, and spatial diversity/multiplexing design. Specifically, two-dimensional variable length binary codewords in the space time domain ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimized process and property test for Lorenz chaotic sequences

    Publication Year: 2005, Page(s):56 - 60 Vol. 1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB) | HTML iconHTML

    The Lorenz system is applied to a class of pseudorandom number generators based on the higher secrecy of a high-dimension chaotic system. Firstly, the time-frequency characteristic of Lorenz chaotic sequences is analyzed thoroughly. Secondly, it is realized that the optimized disposal can roundly improve on their inherent limitations in the time and frequency domains. Finally, the randomness of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.