1,041 research outputs found

    Sequential decoding on intersymbol interference channels with application to magnetic recording

    Get PDF
    Ankara : Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent University, 1990.Thesis (Master's) -- Bilkent University, 1990.Includes bibliographical references leaves 27-28In this work we treat sequential decoding in the problem of sequence estimation on intersymbol interference ( ISI ) channels. We consider the magnetic recording channel as the particular ISI channel and investigate the coding gains that can be achieved with sequential decoding for different information densities. Since the cutoff rate determines this quantity , we find lower bounds to the cutoff rate. The symmetric cutoff rate is computed as a theoretical lower bound and practical lower bounds are found through simulations. Since the optimum decoding metric is impractical, a sub-optimum metric has been used in the simulations. The results show that this metric can not achieve the cutoff rate in general, but still its performance is not far from that of the optimum metric. We compare the results to those of Immink[9] and see that one can achieve positive coding gains at information densities of practical interest where other practical codes used in magnetic recording show coding loss.Alanyalı, MuratM.S

    A Unified Framework for Linear-Programming Based Communication Receivers

    Full text link
    It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local structure of the underlying graphical model, and are inhibited by the same phenomenon, which we call 'pseudoconfigurations'. This concept is a generalization of the concept of 'pseudocodewords' for linear codes. It is proved that the LP receiver has the 'maximum likelihood certificate' property, and that the receiver output is the lowest cost pseudoconfiguration. Equivalence of graph-cover pseudoconfigurations and linear-programming pseudoconfigurations is also proved. A concept of 'system pseudodistance' is defined which generalizes the existing concept of pseudodistance for binary and nonbinary linear codes. It is demonstrated how the LP design technique may be applied to the problem of joint equalization and decoding of coded transmissions over a frequency selective channel, and a simulation-based analysis of the error events of the resulting LP receiver is also provided. For this particular application, the proposed LP receiver is shown to be competitive with other receivers, and to be capable of outperforming turbo equalization in bit and frame error rate performance.Comment: 13 pages, 6 figures. To appear in the IEEE Transactions on Communication

    Novel reduced-state BCJR algorithms

    Get PDF

    EXIT Chart Based Joint Code-Rate and Spreading-Factor Optimisation of Single-Carrier Interleave Division Multiple Access

    No full text
    Abstract—In this paper, we consider the joint code-rate and spreading-factor optimisation of turbo-style iterative joint detection and decoding assisted single-carrier interleave division multiple access (SC-IDMA) systems using different-rate convolutional codes and Extrinsic Information Transfer (EXIT) charts, when communicating over Additive White Gaussian Noise (AWGN) channels. More explicitly, we study the extrinsic information exchange between two serial concatenated components and maximise the number of users supported by the SC-IDMA system under the constraint of a fixed bandwidth expansion factor, while maintaining a predefined Bit Error Ratio (BER) versus Eb/N0 performance. We found that an optimum coderate and spreading-factor combination can be found for the SC-IDMA system at low Eb/N0 values, where maintaining a low BER inevitably requires the employment of channel coding. By contrast, at high Eb/N0 the system performs best, when no channel coding is used, i.e. DS-spreading is the only means of bandwidth expansion

    An implementation of a reference symbol approach to generic modulation in fading channels

    Get PDF
    As mobile satellite communications systems evolve over the next decade, they will have to adapt to a changing tradeoff between bandwidth and power. This paper presents a flexible approach to digital modulation and coding that will accommodate both wideband and narrowband schemes. This architecture could be the basis for a family of modems, each satisfying a specific power and bandwidth constraint, yet all having a large number of common signal processing blocks. The implementation of this generic approach, with general purpose digital processors for transmission of 4.8 kilobits per sec. digitally encoded speech, is described

    Hardware simulation of Ku-band spacecraft receiver and bit synchronizer, volume 1

    Get PDF
    A hardware simulation which emulates an automatically acquiring transmit receive spread spectrum communication and tracking system and developed for use in future NASA programs involving digital communications is considered. The system architecture and tradeoff analysis that led to the selection of the system to be simulated is presented
    corecore