By Topic

Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on

Date 7-10 Dec. 2008

Filter Results

Displaying Results 1 - 25 of 300
  • [Title page]

    Publication Year: 2008, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (1134 KB)
    Freely Available from IEEE
  • Welcome

    Publication Year: 2008, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (449 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2008, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (444 KB)
    Freely Available from IEEE
  • Technical sessions

    Publication Year: 2008, Page(s):1 - 2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (743 KB)

    First Page of the Article
    View full abstract»

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

    Publication Year: 2008, Page(s):1 - 19
    Request permission for commercial reuse | PDF file iconPDF (1606 KB)
    Freely Available from IEEE
  • Cooperative communication

    Publication Year: 2008, Page(s):1 - 69
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (882 KB)

    First Page of the Article
    View full abstract»

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

    Publication Year: 2008, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (567 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (291 KB)
    Freely Available from IEEE
  • A study on cooperative reception of one segment ISDB-T

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (377 KB) | HTML iconHTML

    Because of its narrow band characteristic, one segment ISDB-T reception is more degraded under multi-path fading environments than 13 segments ISDB-T reception. Moreover, efficient diversity reception is difficult for its physically small size of the receiver. In order to overcome this problem, cooperative diversity reception between several receivers is proposed and its performance is evaluated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel coded cooperation: Concepts and dsign criteria

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (786 KB) | HTML iconHTML

    This paper proposes a new coded cooperation protocol based on multilevel coded modulation for the case when the number of cooperative nodes is arbitrary. If the number of cooperative nodes is N, the proposed system makes a cooperative diversity with the multilevel coded 2N-PAM. Multilevel coded 2N-PAM can be decomposed into N parallel binary channels. Thus, the node can assig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative communications using bit-Interleaved coded DPSK with cyclic delay diversity

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    We propose a new scheme for collaborative (or cooperative) communications using bit-Interleaved coded differential PSK with cyclic delay diversity in orthogonal frequency-division multiplexing (OFDM). bit-interleaved coded DPSK with cyclic delay diversity in OFDM can cope with the increased frequency selectivity, and enable picking up the spatial diversity in frequency-selectivity channels with un... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative diversity enhancements using rate-compatible turbo codes

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

    The use of the spatial diversity is known to greatly improve the performance over the quasi-static wireless channel. In this paper, we propose a new coded cooperation protocol based on rate-compatible turbo codes. We consider the communication scenario to take place between clusters of nearby nodes with single antenna and demonstrate by a simple example that the diversity gain may be realized by u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of a visual secret sharing scheme for plural secret images and its basic properties

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    In this paper we discuss construction of the visual secret sharing scheme for plural secret images. We first consider generation of n shares for given two secret image SI1 and SI2. For i = 1, 2, while no information of SIi is revealed from any less than n - 2 + i shares, SIi is visually recovered by the superimposition of arbitrary n - 2 + i shares. We d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On some properties of the (t, n) threshold secret sharing schemes based on the generalized vector space construction

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    In this paper some of the properties of the (t, n) threshold secret sharing schemes, based on the generalized vector space construction, are discussed. The relations between the size of the shares and the number of the users n in the (t, n) threshold secret sharing schemes are presented. Moreover, it is shown how a qualified set of users can efficiently recover the secret in case of (2, n) and (3,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction method of secret sharing schemes based on authorized subsets

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (694 KB) | HTML iconHTML

    We propose a construction method of secret sharing schemes realizing general access structures. Our proposed construction method is a perfect secret sharing scheme and includes Shamir's (k; n)-threshold schemes as a special case. Furthermore, for any access structure, the proposed construction method is more efficient than Benaloh and Leichter's scheme and Tochikubo, Uyematsu and Mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weakly secure visual secret sharing schemes

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    We introduce a visual secret sharing (VSS) scheme with a new security condition, called a weakly secure VSS scheme, which is not unconditionally secure in general, but is designed to be secure for human eyesight. It is shown in this paper that the weakly secure VSS scheme is equivalent to the unconditional one for black-white binary secret images although they are different for color secret images... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of effect of nonlinear distortion in SC-FDMA system

    Publication Year: 2008, Page(s):1 - 5
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1356 KB) | HTML iconHTML

    In up-link wireless access communication, the transmitter needs good linearity but low power efficiency power amplifier. If the nonlinear power amplifier is used for improving the power usage efficiency, the higher peak-to-average power ratio (PAPR) signal suffers from nonlinear distortion. The effect of nonlinear distortion to Single Carrier-Frequency Division Multiple Access (SC-FDMA) has not be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on energy-efficient protocol based on the CSMA/CA in ad-hoc networks

    Publication Year: 2008, Page(s):1 - 6
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (506 KB) | HTML iconHTML

    This paper discusses a scheme for reducing the power consumption in the CSMA/CA ad hoc networks. We propose a simple CSMA/CA-based MAC protocol with the sleep mode which is applied during the period with and without the communication traffic, and describe the procedure of the proposed protocol. The performance is evaluated through computer simulations together with taking account of optimization f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cluster relay coded cooperative strategy in broadband wireless ad-hoc networks

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB) | HTML iconHTML

    This paper proposes a relay coded cooperative transmission in inter symbol interference (ISI) channels, which aims at self-configuration of multi-hop networks with high cooperative diversity gain even in highly mobile networks. To guarantee a robustness against the high mobility, a flooding protocol is adopted to configure the networks. A primary challenge in this paper is to overcome the penalty ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering and labeling of orthogonal signals for modulation identification

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

    The increased demands for wireless communications lead to the development of cognitive radio, which realizes an effective utilization of channel resources. A modulation identification takes an important role in cognitive radio. In this paper an identification method is discussed for block orthogonal modulations expressed by general orthogonal modulation. The identification requires a reconstructio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate estimation scheme for weighted bit-flipping decoding of rate compatible LDPC codes

    Publication Year: 2008, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1650 KB) | HTML iconHTML

    This paper considers a new rate estimation scheme for rate compatible LDPC (RC-LDPC) codes. We have investigated some estimation schemes for RC-LDPC codes even though there is no side information about code rates used at a transmitter. The previous schemes were based on log-likelihood ratio of sum-product decoders at a receiver. Because of too much computational complexity, simpler estimation sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards universal cover decoding

    Publication Year: 2008, Page(s):1 - 6
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    In this paper, the non-codeword errors was analyzed that occur during parallel, iterative decoding with the min-sum decoder. Recently, work has been done relating the min-sum decoder to the linear programming (LP) decoder via graph covers. The LP decoder recasts the problem of decoding as an optimization problem whose feasible set is a polytope defined by the parity-check matrix of a code. It was ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gradient descent bit flipping algorithms for decoding LDPC codes

    Publication Year: 2008, Page(s):1 - 6
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (433 KB) | HTML iconHTML

    A novel class of bit-flipping (BF) algorithms for decoding low-density parity-check (LDPC) codes is presented. The proposed algorithms, which are called gradient descent bit flipping (GDBF) algorithms, can be regarded as simplified gradient descent algorithms. Based on gradient descent formulation, the proposed algorithms are naturally derived from a simple nonlinear objective function. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LLR metrics for LDPC codes with quadrature differential PSK transmission, and their performances

    Publication Year: 2008, Page(s):1 - 6
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (399 KB) | HTML iconHTML

    Iterative decoding of low-density parity-check codes transmitted over noncoherent channels using quadrature differential phase-shift keying is investigated. The log-likelihood ratio for each of the two code bits sent over one transmission period, based on the joint probability of two consecutive received signal samples pertaining to these code bits, is derived. An approximation of this metric yiel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of flash memories

    Publication Year: 2008, Page(s):1 - 6
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    Flash memories are the most widely used type of non-volatile electronic memories. Compared to magnetic recording and optical recording, flash memories have the unique property that their cell levels, which represent data, are programmed using an iterative procedure that monotonically shifts each cell level upward toward its target value. In this paper, we study the capacity of flash memories to st... View full abstract»

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