Scheduled System Maintenance
IEEE Xplore is currently undergoing scheduled maintenance.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914)

Volume 1 • 27-29 June 2004

Go

Filter Results

Displaying Results 1 - 25 of 172
  • 2004 International Conference on Communications, Circuits and Systems (IEEE Cat. No.04EX914)

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (119 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2004, Page(s): 0_2
    Request permission for commercial reuse | PDF file iconPDF (4 KB)
    Freely Available from IEEE
  • 2004 International Conference on Communications, Circuits and Systems

    Publication Year: 2004, Page(s): 0_3
    Request permission for commercial reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2004, Page(s): 0_4
    Request permission for commercial reuse | PDF file iconPDF (36 KB)
    Freely Available from IEEE
  • ICCCAS2005 Committees

    Publication Year: 2004, Page(s):0_5 - 0_12
    Request permission for commercial reuse | PDF file iconPDF (210 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2004, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (12 KB)
    Freely Available from IEEE
  • Conference program

    Publication Year: 2004, Page(s):ii - iii
    Request permission for commercial reuse | PDF file iconPDF (78 KB) | HTML iconHTML
    Freely Available from IEEE
  • Sessions and technical papers

    Publication Year: 2004, Page(s):iv - xix
    Request permission for commercial reuse | PDF file iconPDF (534 KB)
    Freely Available from IEEE
  • From brain-like computing to artificial life

    Publication Year: 2004, Page(s): xx
    Request permission for commercial reuse | PDF file iconPDF (58 KB) | HTML iconHTML
    Freely Available from IEEE
  • Digital signal processing: road to the future

    Publication Year: 2004, Page(s): xxi
    Request permission for commercial reuse | PDF file iconPDF (74 KB) | HTML iconHTML
    Freely Available from IEEE
  • Modern architectures and ASIC implementations for communications applications

    Publication Year: 2004, Page(s): xxii
    Request permission for commercial reuse | PDF file iconPDF (62 KB) | HTML iconHTML
    Freely Available from IEEE
  • A parallel S-box architecture for AES byte substitution

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

    In this paper, a parallel S-box implementation is proposed. The original one S-box look-up table is separated into 32 small S-box look-up tables in order to parallel substitute the byte. By simulation, the average speed up of the proposed parallel byte substitution is 8 times faster than using the previous one S-box look-up table. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security improvement on Yang-Shieh's authentication scheme

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

    Yang and Shieh (1999) proposed a timestamp-based password authentication scheme using smart cards. However, Chan et al. (2002) and Fan et al. (2002) showed its vulnerability to the forged login attacks, respectively. Also Fan gave a slight modification of the original scheme, which however increases the computation cost of the system. In this paper a more efficient modification of the original sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient construction of secret sharing for generalized adversary structure and its reduction

    Publication Year: 2004, Page(s):6 - 10 Vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    A secret sharing scheme for generalized adversary structure is a method of sharing a secret among a finite set of participants in such a way that only certain pre-specified subsets of participants cannot recover the secret. This paper proposes an efficient secret sharing scheme realizing the generalized adversary structure, and proves that the scheme satisfies both reconstruction and perfect prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Chebyshev chaotic map to construct infinite length hash chains

    Publication Year: 2004, Page(s):11 - 12 Vol.1
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (139 KB) | HTML iconHTML

    Utilizing the semi-group property of the Chebyshev chaotic map, we propose a scheme to construct infinite length hash chains. The scheme is practicable, efficient and reliable, with high potential to be adopted for E-commerce and E-government. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A secure communication scheme based on symbolic dynamics

    Publication Year: 2004, Page(s):13 - 17 Vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    A secure communication scheme based on symbolic dynamics is proposed. With a binary sequence extracted from a chaotic map the message to be transmitted is encrypted by employing the chaotic masking technique. The masked message sequence is tracked with a symbolic sequence generated by another skew tent chaotic map. The theoretic and simulation results state that the proposed algorithm has many pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant and secure multi-conference-key agreement protocol

    Publication Year: 2004, Page(s):18 - 21 Vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (242 KB) | HTML iconHTML

    This paper describes a threshold multi conference-key distribution scheme based on a (t, n) secret sharing scheme. Whenever the number of participants from a. group is larger than or equal to a predetermined threshold value t, the legitimate participants can obtain the conference-keys after the reconstruction stage. In contrast to other conventional schemes such as those presented respectively by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A survey of authorization based Active Networks security

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

    Active Networks (AN) is primarily a DARPA-funded project focusing on mechanisms, applications, and operating systems research to develop a reconfigurable network infrastructure. Active Networks aim to provide a software framework that enables network applications to customize the processing of their communication packets. Security is of critical importance to the success of active networking. Many... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Density evolution method and threshold decision for irregular LDPC codes

    Publication Year: 2004, Page(s):25 - 28 Vol.1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (247 KB) | HTML iconHTML

    Density evolution is a new method for analyzing the asymptotic performance of network capability approaching error-correcting codes. For irregular LDPC codes with message-passing decoding, the density evolution method can track the messages to find out the threshold, enabling optimization of the degree distribution. In this paper, the principle of density evolution combined with the decoding proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The application of LDPC codes in image transmission

    Publication Year: 2004, Page(s):29 - 33 Vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    In this paper, we combine the adaptive modulation and coding (AMC) with LDPC (low-density parity-check) codes and apply it to image transmission under Rayleigh fading channels. The transmitter adjusts the modulation mode according to the channel state information. Through computer simulation, we get the performance of our adaptive LDPC scheme in image transmission under certain demand of BER, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multisource network coding with two sinks

    Publication Year: 2004, Page(s):34 - 37 Vol.1
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (274 KB) | HTML iconHTML

    Network coding shows that the data rate can be increased if information is allowed to be encoded in the network nodes. The recent work of S.-Y.R. Li et al. (see IEEE Trans. Inform. Theory, vol.49, no.2, p.371-81, 2003) and R. Koetter and M. Medard (see Proc. INFOCOM, 2002) shows that linear network coding is sufficient for a single source multicast network. The restrictiveness of the use of linear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A chaotic interleaver used in turbo codes

    Publication Year: 2004, Page(s):38 - 42 Vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (279 KB) | HTML iconHTML

    A chaotic interleaver in turbo codes and a novel method to design the chaotic interleaver called block-random chaotic (BRC) interleaver is proposed. As compared to random interleavers and s-random interleavers, this new BRC interleaver has lower implementation complexity, lower system delay and fewer parameters to be transferred. Simulation results indicate that the novel BRC interleaver is effect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching for the best biphase and quadriphase quasi-Barker sequences

    Publication Year: 2004, Page(s):43 - 47 Vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (355 KB) | HTML iconHTML

    Sequences achieving the minimum peak aperiodic autocorrelation sidelobe level one are called the Barker sequences. Such sequences have been used in numerous real-world channel estimation, radar and spread spectrum communication applications. Unfortunately, the longest known biphase and quadriphase Barker sequences are of lengths 13 and 15 respectively. In this paper, motivated by quasi-synchronous... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Turbo decoding of product code based on SPC component decoding

    Publication Year: 2004, Page(s):48 - 51 Vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB) | HTML iconHTML

    We perform turbo/iterative decoding of linear block codes and product codes based on single-parity-check (SPC) component decoding and investigate their performances in both AWGN and Rayleigh fading channels. We also present two iteration mechanisms for decoding a product code and highlight the importance of using a scaling factor for the extrinsic information. For the Hamming code, the SPC-based t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of turbo-coded MC-CDMA system based on complex wavelet packet in Rayleigh fading channel

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

    In this paper, on the basis of analyzing the principle of multi-carrier code division multiple access (MC-CDMA) technique, by employing the optimized complex wavelet packet as multi-carrier modulation and the turbo codes as channel coding, we propose a novel MC-CDMA system based on complex wavelet packet and turbo coding, and investigate the system bit error rate (BER) performance in Rayleigh fadi... View full abstract»

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