By Topic

Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on

Date 25-27 May 2008

Filter Results

Displaying Results 1 - 25 of 327
  • Table of content

    Publication Year: 2008 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (277 KB)  
    Freely Available from IEEE
  • 2008 international conference on communications, circuits and systems proceedings

    Publication Year: 2008 , Page(s): ii - iv
    Save to Project icon | Request Permissions | PDF file iconPDF (308 KB)  
    Freely Available from IEEE
  • ICCCAS 2008 Steering Committee

    Publication Year: 2008 , Page(s): v - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (755 KB)  
    Freely Available from IEEE
  • Advanced program

    Publication Year: 2008 , Page(s): 1
    Save to Project icon | Request Permissions | PDF file iconPDF (122 KB)  
    Freely Available from IEEE
  • ICCCAS 2008 Steering Committee

    Publication Year: 2008 , Page(s): 2 - 3
    Save to Project icon | Request Permissions | PDF file iconPDF (193 KB)  
    Freely Available from IEEE
  • ICCCAS 2008 track TPC member list

    Publication Year: 2008 , Page(s): 4 - 10
    Save to Project icon | Request Permissions | PDF file iconPDF (408 KB)  
    Freely Available from IEEE
  • Sessions overview

    Publication Year: 2008 , Page(s): 11 - 12
    Save to Project icon | Request Permissions | PDF file iconPDF (196 KB)  
    Freely Available from IEEE
  • CNN: Twenty years later

    Publication Year: 2008 , Page(s): 13 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (637 KB)  

    This speech will present the state-of-the-art of the CNN (Cellular Neural Network) universal chip and its future applications. The speech will last two hours without coffee break. After the speech, a 20 minutes interactive talk among the speaker and audience will be held on the great event: Experiment Verification of Memristor by HP researchers has been done last month. As is well known that the Memristor is predicted by Prof. Chua 37 years ago as the fourth basic circuit element besides the other three elements: resistor, capacitor and inductor.Thus this event is recognized as the basic natural science discovery besides those made by Ohm, Maxwell and Faraday in the 19th century. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensor networks: Motivations, implementations and applications

    Publication Year: 2008 , Page(s): 15
    Save to Project icon | Request Permissions | PDF file iconPDF (328 KB)  
    Freely Available from IEEE
  • Technical program of 2008 ICCCAS

    Publication Year: 2008 , Page(s): 17 - 48
    Save to Project icon | Request Permissions | PDF file iconPDF (2420 KB)  
    Freely Available from IEEE
  • Contents of proceedings of ICCCAS 2008

    Publication Year: 2008 , Page(s): 1 - 15
    Save to Project icon | Request Permissions | PDF file iconPDF (1756 KB)  
    Freely Available from IEEE
  • Author index (I)

    Publication Year: 2008 , Page(s): I - VIII
    Save to Project icon | Request Permissions | PDF file iconPDF (656 KB)  
    Freely Available from IEEE
  • Contents of proceedings of ICCCAS 2008

    Publication Year: 2008 , Page(s): 1 - 16
    Save to Project icon | Request Permissions | PDF file iconPDF (1785 KB)  
    Freely Available from IEEE
  • A weight method of decoding the (23, 12, 7) Golay code using reduced table lookup

    Publication Year: 2008 , Page(s): 1 - 5
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (910 KB) |  | HTML iconHTML  

    In this paper, a weight method with using a reduced lookup table is developed to decode the three possible errors in (23, 12, 7) Golay code. The reduced lookup table consists of syndrome patterns and corresponding error patterns which only have one and two errors occurred in the message block of the received codeword. The useful proposed algorithm makes use of the properties of cyclic codes, weight of syndrome, and reduced lookup table. It often results in a significant reduction in the memory requirements comparing to the traditional lookup table. This weight algorithm together with a reduced table lookup makes a fast and low complexity of the table lookup decoding algorithm. Moreover, a computer simulation shows that such a novel method is a much faster algorithm in software than the traditional full lookup table searching algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On efficient and reliable network coding in practical environment

    Publication Year: 2008 , Page(s): 6 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1204 KB) |  | HTML iconHTML  

    Network coding can facilitate the communications from a sender to a set of receivers in a network by enlarging the multicast throughput. However, when applying network coding in practical network, problems such as link delay, delay jitter, and random link loss may seriously impair the network coding based multicast communications. In this paper, we carefully analyze the insufficiencies of the existing design for practical network coding in dealing with the above problems, and propose a series of approaches that may successfully solve those drawbacks. Our design involves an inter-node information exchange technique to reduce the waste of transmission resource, a new approach to deal with throughput lose caused by link delay, and a redundant information modulating technique to adapt the multicasting system to random changes of the max-flow in a network. Those mechanisms can make the network coding based multicasting system to become much more applicable and effective. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient encoding of cycle codes on graphs with large girths

    Publication Year: 2008 , Page(s): 11 - 15
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1301 KB) |  | HTML iconHTML  

    Low-density parity-check (LDPC) codes of column weight two, also called cycle codes, can be constructed based on connected simple graphs. In this paper, efficiently encodable cycle codes and modified Repeat-Accumulate codes based on Hamiltonian graphs with large girths are devised. Specifically, the Hamiltonian property of the graphs is exploited to obtain efficient encoder structures and a concise description for the Hamiltonian graph named LCF (Lederberg-Coxeter-Frucht) notation is used to reduce the complexity of the encoders, especially the storage requirement. Then, using the Hamiltonian property and the LCF notation, structured cycle codes with large girths and low encoding complexity are devised. Simulation results also reveal that the proposed structured codes exhibit better performance compared with other structured cycle codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast and efficient encoding structure for QC-LDPC codes

    Publication Year: 2008 , Page(s): 16 - 20
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1001 KB) |  | HTML iconHTML  

    Parallel-input parallel-output (PIPO) structure for quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed in this paper to implement a faster and more efficient QC-LDPC encoder than that based on conventional serial-input parallel-output (SIPO) or parallel-input serial-output (PISO) structure. An encoding architecture based on the proposed PIPO structure for multi-rate QC-LDPC codes employed by the Chinese Digital Television Terrestrial Broadcasting (DTTB) standard is also presented and discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved digital image transmission with turbo product codes

    Publication Year: 2008 , Page(s): 21 - 25
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1831 KB) |  | HTML iconHTML  

    Digital image transmission without channel coding and with turbo product codes (TPCs) as channel coding scheme over AWGN channel is studied. We propose an improved decoding algorithm for TPCs based on computing extrinsic information for partial bits. In the proposed decoding algorithm, we neglect computing extrinsic information for those bits that are reliable enough for making decoding decisions. Simulation results indicate that the proposed algorithm can reduce the computational complexity and improve the decoding speed without performance degradation. In addition, we apply TPCs to digital image transmission system and study the effect of the reconstructed images. The results show that the TPCs have powerful error correction capability while greatly saving the system transmission power, which is an evidence of TPCs being suitable for digital image transmission. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of quasi-cyclic LDPC codes from one-coincidence sequences

    Publication Year: 2008 , Page(s): 26 - 30
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1326 KB) |  | HTML iconHTML  

    In this paper, we proposed a new method for constructing quasi-cyclic low-density parity-check (QC-LDPC) codes based on circulant permutation matrices via the one-coincidence sequences. The main advantage is that QC-LDPC codes with a variety of block lengths and rates can be easily constructed with no cycles of length four or less. Simulation results show that the proposed QC-LDPC codes perform slight better than the random regular LDPC codes for short to moderate block lengths and have almost the same performance as Sridara- Fuja-Tanner codes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of signal space diversity based on non-binary LDPC code

    Publication Year: 2008 , Page(s): 31 - 34
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (733 KB) |  | HTML iconHTML  

    In this paper, a scheme of signal space diversity based on non-binary LDPC codes is presented. Signal space diversity can provide good performance gains over fading channels with multi-dimension rotated constellation. This paper studies the extension of such schemes with a non-binary code. It is shown that non-binary LDPC-coded modulation with signal space diversity over a fading channel may lead to a significant gain over the convolutional code or conventional unrotated constellation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On decoding of quadratic residue codes with irreducible generator polynomials

    Publication Year: 2008 , Page(s): 35 - 37
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (774 KB) |  | HTML iconHTML  

    In this paper, a simple decoding scheme for the quadratic residue codes that utilize extended Euclidpsilas algorithm is proposed. This decoding method is based on the property of the syndrome polynomial to obtain the error-locator polynomial. Moreover, the simulation results for comparing the new decoding method with a proposed method are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient scheme to determine the weight distribution of binary (138, 69, 22) extended quadratic residue code

    Publication Year: 2008 , Page(s): 38 - 40
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (784 KB) |  | HTML iconHTML  

    This paper utilizes an efficient scheme which consists of a weight-counting algorithm, the combinatorial designs of the Assmus-Mattson theorem, and the weight polynomial of Gleasonpsilas theorem to determine the weight distributions of binary extended quadratic residue codes. As a consequence, the weight distribution of binary (138, 69, 22) extended quadratic residue code is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decoding of the (48, 24, 12) extended quadratic residue code up to six errors

    Publication Year: 2008 , Page(s): 41 - 43
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (693 KB) |  | HTML iconHTML  

    This paper is to develop a modified algorithm for decoding the (48, 24, 12) binary quadratic residue code up to six errors. The technique in this paper uses the algebraic decoding algorithm for the (47, 24, 11) quadratic residue code offered by Truong et al. to correct up to five errors. Then, the technique of detecting a six-error is utilized. Finally, the reliability-search algorithm, proposed by Dubney et al., is applied for correcting the six-error. The computer simulation of the new scheme shows that at least 86% and 96% of weight-6 error patterns occurred are corrected if the Eb/N0 ratios are greater than 3 dB and 6 dB, respectively. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of STBC-IDMA system over quasi-static Rayleigh fading channel

    Publication Year: 2008 , Page(s): 44 - 47
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (889 KB) |  | HTML iconHTML  

    In this paper STBC is applied to IDMA systems (called STBC-IDMA systems). Performance comparison between STBC-IDMA and uncoded IDMA systems with different number of users, and performances of STBC-IDMA systems with different transmit antennas are investigated over quasi-static Rayleigh fading channel. Simulation results show that the system proposed in this paper owns the same throughput and acquires greater diversity gain contrast to the uncoded IDMA system at the bit error rate (BER) level of 10-3 and 10-5 with different number of users. Furthermore, it is found that the more transmit antennas, the more diversity gain in proposed systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Volterra-TLS method for chaotic time series prediction

    Publication Year: 2008 , Page(s): 48 - 51
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (689 KB) |  | HTML iconHTML  

    A new Volterra-TLS method for chaotic time series prediction is proposed, which is based on Volterra series model, TLS criterion and iterative TLS algorithm. According to study results, the prediction precision of Volterra-TLS method is not inferior to that of Volterra-NLMS method, while Volterra-TLS method has higher training convergence speed and is more robust against noise. View full abstract»

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