By Topic

Proceedings of 1995 IEEE International Symposium on Information Theory

17-22 Sept. 1995

Filter Results

Displaying Results 1 - 25 of 502
  • Proceedings of 1995 IEEE International Symposium on Information Theory

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (1345 KB)
    Freely Available from IEEE
  • Cascaded convolutional codes

    Publication Year: 1995
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (107 KB)

    The construction and performance of cascaded convolutional codes is investigated. An interleaver is used between the inner and outer codes to redistribute errors out of the inner decoder. In addition, the structure of the interleaver is exploited to improve the distance properties of the overall cascaded code. This configuration is shown to have a performance advantage compared to a single complex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of trellis codes at high spectral efficiencies for use with sequential decoding

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (130 KB)

    Sequential decoding of trellis codes at high spectral efficiencies is investigated and large constraint length trellis codes for two dimensional and four dimensional constellations are constructed for use with sequential decoding. It is shown that the channel cut-off rate bound can be achieved using constraint lengths between 16 and 19 with sequential decoding at a bit error rate of 10/sup -5/-10/... View full abstract»

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

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Statistics of error recovery times of decision feedback equalizers

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    New upper and lower bounds to the mean recovery time of decision feedback equalization (DFE) are derived. The recovery time is defined as the time it takes the decision feedback equalizer (DFEQ) to reach the error free state after an error has corrupted an error free DFEQ. The derivations of the bounds assume a causal channel response, independent data symbols, and independent noise samples. The b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel scarce-state-transition syndrome-former error-trellis decoding of (n, n-1) convolutional codes

    Publication Year: 1995
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    A novel maximum-likelihood hard- and 8-level soft-decision scarce-state-transition (SST) type syndrome-former error-trellis decoding system of (n,n-l) convolutional codes with coherent BPSK signals for additive white Gaussian noise channels is proposed. The proposed system retains the same number of binary comparisons as the syndrome-former trellis decoding method of Yamada et al. (1983). Like the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decoding algorithm for linear codes overs Z4

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    A decoding algorithm for linear codes over Z4={0,1,2,3}, the ring of integers module 4, is given which gives the codewords that is closest to the received vector in Lee distance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incoherent diversity detection of fading signals in correlated non-Gaussian noise

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The paper deals with the synthesis of an asymptotically optimum diversity detector for the incoherent detection of a bandpass signal subject to slow and nonselective fading and embedded in correlated spherically invariant noise View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced decoding of interleaved error correcting codes

    Publication Year: 1995
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    A common way to deal with bursts in data storage systems is to interleave byte-error correcting codes. In the decoding of each of these byte-error correcting codes, one normally does not make use of the information obtained from the previous or subsequent code, while the bursty character of the channel indicates a dependency. Berlekamp and Tong (1985) exploited such a dependency to enhance the dec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the diamond code construction

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    We introduce a new error correcting code, which we call the diamond code. Diamond codes combine the error correcting capabilities of product codes and the reduced memory requirements from CIRC, the code applied in the CD system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum likelihood sequence estimation for non-Gaussian band-limited channels

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    The article provides near-optimal and sub-optimal receiver designs for digital communications in the presence of non-Gaussian noise and intersymbol interference (ISI). Potential applications include wireless indoor (office or factory floor) communications which are characterized by ISI due to multipath fading and limited channel bandwidth and by non-Gaussian background noise View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes from iterated maps

    Publication Year: 1995
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (60 KB)

    The authors consider codes of the following type. Let S (the signal set) be a subset of n-dimensional Euclidean space Rn. Let f:S→S be a continuous mapping. The code C(S,f) consists of those bi-infinite sequences x=...x-l,x0,x1 ,x2,...∈S𝒵 that satisfy xt =f(xt-1) for all t∈𝒵. Note that ... View full abstract»

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

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    Sonar as well as other related sequences were introduced by Golomb and Taylor (1982). Following a similar approach, we introduce the concept of an extended sonar sequence. It is similar to that of a sonar sequence but blank columns are permitted. Several constructions of extended sonars are given. Our constructions are very close to ordinary sonar sequences. However they provide good improvements ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On interval linear complexity of binary sequences

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    We consider the problem of partial approximation of binary sequences by the outputs of linear feedback shift registers. A generalization of the linear complexity profiles of binary sequences leads to a sequence that is regarded as the profile of interval linear complexity. Some properties of this sequence are examined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error and erasure decoding of binary cyclic code up to actual minimum distance

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (124 KB)

    A new error-and-erasure decoding procedure that decodes cyclic codes up to the actual minimum distance is presented. This procedure annihilates erasure effects from syndrome matrices and produces modified syndrome matrices that can be used to obtain error locations with an error-only decoding algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing covering codes via noising

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    We show how a combinatorial optimization method, the noising method, can be used for constructing covering codes. The noising method is based on descent. Starting with an initial solution, repeat the following steps: add noise to the data (in order to change the values of the evaluation function); and apply the descent method to the current solution for the noise data. For each iteration, the amou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lossy data compression based on an approximate pattern matching

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    A practical suboptimal (variable source coding) algorithm for lossy data compression is presented. This scheme is based on an approximate string matching, and it extends lossless Wyner-Ziv data compression scheme View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analysis approach for cell loss rate of shared buffer ATM switching

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    A novel approach is presented for analyzing cell loss rate of shared buffer ATM switching. It provides a new means to solve problems in a more complex queueing system. It is an accurate algorithm compared to conventional methods, employing a one-step transition matrix View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance bounds for decorrelator detectors in a QS-CDMA system

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    A linear decorrelator detector is considered for use in a quasi-synchronous code-division multiple access (QS-CDMA) system. A QS-CDMA communication system is considered in which decorrelators are employed for multiuser detection at the base station. For long code lengths, the evaluation of bit-error rate can be computationally expensive, due to the need for exhaustive search to determine the worst... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of trellis coded direct-sequence spread-spectrum with noncoherent reception in a fading environment

    Publication Year: 1995
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    We consider a different coding scheme for direct-sequence spread-spectrum (DSSS). The Nordstrom-Robinson (NR) code, a nonlinear code that has large distance for a given rate, used in conjunction with a trellis-code version is examined. A bound is developed on the error probability for this trellis coded Nordstrom-Robinson (TCNR) code with noncoherent reception over a frequency-nonselective Rayleig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced complexity symbol-by-symbol demodulation

    Publication Year: 1995
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    Reduced complexity symbol-by-symbol demodulation is examined. We examine the performance with standard complexity reduction techniques (e.g., M-algorithm and T-algorithm) and then derive a reduced state symbol-by-symbol demodulation algorithm which makes symbol-by-symbol demodulation performance and complexity competitive with sequence estimation. An overview is also included of optimum recursive ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combined decision feedback equalization and coding for high SNR channels

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Motivated by the desire to transmit the maximum possible data rate through a band-limited additive-noise channel with intersymbol interference (ISI), a considerable research effort has been devoted to equalization techniques for such channels. We present a novel scheme that combines decision feedback equalization (DFE) with high-rate error-detection coding in an efficient manner. The proposed sche... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some remarks on efficient inversion in finite fields

    Publication Year: 1995
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    This article is concerned with bit parallel inverters over finite fields. Two alternative approaches for inversion with low complexity are reviewed. Both methods are based on multiple field extension of GF(2). It is shown that one architecture is a generalization of the other's architecture core algorithm. As an example, the complexity of an inverter in the field GF(28) is computed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal coding of integers and unbounded search trees

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB)

    We study the universal coding problem for the integers, in particular, establish rather sharp lower and upper bounds for the Elias (1975) omega code and other codes. For these bounds, the so-called log-star function plays the central role. Furthermore, we investigate unbounded search trees induced by these codes, including the Bentley-Yao (1976) search tree View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-number DFT codes on a fading channel

    Publication Year: 1995
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    The utilization of real-number DFT codes for a multiplicative channel is introduced. By the proposed encoding procedure, some redundancies can be added into the transmitted data. With these redundancies, syndromes for the parameters of a fading channel can be obtained from the received data. The decoding algorithm for real-number DFT codes can be used to calculate the fading parameters with these ... View full abstract»

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