Notice
There is currently an issue with the citation download feature. Learn more

2007 10th Canadian Workshop on Information Theory (CWIT)

6-8 June 2007

Filter Results

Displaying Results 1 - 25 of 56
  • Foreword

    Publication Year: 2007, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (109 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organizing Committee

    Publication Year: 2007, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Technical Program Committee

    Publication Year: 2007, Page(s): nil2
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Keynote speakers

    Publication Year: 2007, Page(s): nil3
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (74 KB) | HTML iconHTML

    Provides an abstract for each of the keynote presentations and a brief professional biography of each presenter. The complete presentations were not made available for publication as part of the conference proceedings. View full abstract»

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

    Publication Year: 2007, Page(s): nil4
    Request permission for commercial reuse | PDF file iconPDF (234 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007, Page(s):nil5 - nil7
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2007, Page(s):nil8 - nil11
    Request permission for commercial reuse | PDF file iconPDF (102 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2007, Page(s): nil12
    Request permission for commercial reuse | PDF file iconPDF (431 KB)
    Freely Available from IEEE
  • Cycle and Distance Properties of Structured LDPC Codes Based on Circulant Permutation Matrices

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

    This paper investigates cycle and distance properties of structured Low Density Parity Check (LDPC) codes based on circulant permutation matrices. A very simple algorithm to detect and construct codes with good cycle properties is proposed. A geometrical approach to design codes with good girth properties is then presented and illustrated, through the definition of rules for the design of parity c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Turbo Frequency Domain Equalization and Carrier Synchronization

    Publication Year: 2007, Page(s):5 - 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (283 KB) | HTML iconHTML

    In this paper we investigate the effect of frequency offset and phase noise on a turbo frequency domain equalization system. We propose a joint synchronization and equalization method which is based on maximum a priori estimation of the phase error caused by frequency offset and phase noise. This estimation is generated using the log likelihood ratios of the bits provided by the decoder during ite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient User Removal Algorithm for Limited-Power Interference Channels

    Publication Year: 2007, Page(s):9 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB) | HTML iconHTML

    In this paper, the problem of maximizing the number of active users satisfying a required quality of service (QoS) in n-user interference channels is investigated. This problem is known as an NP-complete problem. We introduce an efficient suboptimal algorithm, relying on the results for the boundary of the rate region we derived in [1]. The algorithm is developed for different sorts of constraints... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Diversity over Log-Normal Fading Channels

    Publication Year: 2007, Page(s):13 - 16
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    In this paper, we investigate the performance of cooperative diversity schemes over log-normal fading channels which provide an accurate channel model for indoor wireless environments. We focus on single-relay cooperative networks with amplify-and-forward relaying and consider three TDMA-based cooperation protocols which correspond to distributed implementations of MIMO (multi-input multi-output),... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-Time Coded Cooperative Diversity with Multiple-Antenna Nodes

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

    In this paper, we investigate the performance of a single-relay cooperative scenario where the source, relay and destination terminals are equipped with multiple transmit/receive antennas. We assume conventional space-time block codes are employed in the underlying source-to-destination (S rarr D), source-to-relay (S rarr R) and relay-to-destination (R rarr D) links and consider both decode-and-fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity-Multiplexing Trade-off in Z-channel

    Publication Year: 2007, Page(s):21 - 24
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    We consider a simple structure of Z-Channel and derive the diversity-multiplexing trade-off assuming different scenarios for the signal-to-noise ratio of the links. The diversity-multiplexing trade-off is determined assuming having known/unknown interference channel at the receiver. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Partial Phase Combining, Hybrid and Transmit Antenna Selection Schemes under Channel Estimation Errors and Feedback Delay

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

    In this paper we investigate the impact of channel estimation errors and feedback delay on the performance of partial phase combining (PPC), hybrid and transmit antenna selection and schemes. We derive the average signal-to-noise ratio (SNR) in these schemes in the presence of channel estimation errors and feedback delay. We also derive the exact closed form average bit error rate (BER) of the tra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Computational Complexity of MSE-OFDM System using Pseudo Random Cyclic Prefix

    Publication Year: 2007, Page(s):29 - 32
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    A new multicarrier system, termed multi-symbol encapsulated orthogonal frequency division multiplexing (MSE-OFDM), was proposed earlier, in which one cyclic prefix (CP) is used for multiple OFDM symbols. The motivation of this proposal is to address the disadvantages of OFDM system, i.e., the high peak to average power ratio and sensitivity to carrier frequency offset at the same time. Although mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On PAR Reduction of Bit-Interleaved Coded OFDM with Iterative Decoding

    Publication Year: 2007, Page(s):33 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB) | HTML iconHTML

    Bit-interleaved coded orthogonal frequency division multiplexing (OFDM) with iterative decoding (BI-COFDM-ID) is an attractive method to achieve diversity in multipath fading channels due to its spectral efficiency, superior error performance and low receiver complexity. A limitation of OFDM systems is the high peak-to-average ratio (PAR) of the transmitted signal, which reduces the efficiency of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Optimal Period Interleaver in Turbo Codes

    Publication Year: 2007, Page(s):37 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (275 KB) | HTML iconHTML

    Interleaver plays a key role in the structure of turbo codes. The appropriate design of that, leads to achieve the good performance in a turbo code. Base on this fact, many researches have been done in order to design of best interleaver. Up to now, there are a variety of algorithms for design of interleaver such as Wang's algorithm. This algorithm is based on divisibility at which optimal period ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive and Cognitive UWB Radio and a Vision for Flexible Future Spectrum Management

    Publication Year: 2007, Page(s):41 - 44
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (193 KB) | HTML iconHTML

    The continuing intense debate on introduction of ultra wideband (UWB) communications has focused on concerns about interference into and by other communication systems, and resulted in much research into how to mitigate it. Adaptive techniques to mitigate interference are summarized. The definition and use of "cognitive" and other hyperbolic and anthropomorphic terms are discussed. Developments in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection Bound of an UWB Data Packet in the Presence of Clock Offset

    Publication Year: 2007, Page(s):45 - 48
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    Autonomous sensors that transmit small packets of telemetry data based on UWB modulation are being considered for indoor short range applications. An issue is the detection of these packets at the access node receiver due to channel noise and multipath. Detection is further compromised by the likely clock offset of the sensor transmitter. In this paper the detectability of such a packet is analyze... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Degradation of UWB Data Packet Detectability with Finite Clock Uncertainty Range

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

    In this paper the degradation in the detectability of an isolated UWB data packet due to an unknown clock offset of the transmitter is quantified based on the uncertainty range of the clock frequency. Receiver operating curves (ROC) of the receiver packet detection performance are presented for the ideal detection as well as practical implementations of the generalized likelihood ratio test (GLRT)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Variable Rate Slepian-Wolf Code Construction Using Concatenated Convolutional Codes

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

    A variable rate Slepian-Wolf (SW) code is constructed which is vital for wireless sensor network applications. A practical scheme to construct SW codes is to use the syndrome of a channel code as a compressed representation of a codeword in presence of a side information (Pradhan and Ramchandran, 2003). The proposed solution is based on an efficient and practical algorithm to compute the syndrome ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Slepian-Wolf Coding for General Sources and Its Duality with Channel Coding

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

    We study the problem of Slepian-Wolf coding for general sources (not necessarily stationary) with finite alphabet. A linear codebook-level duality between Slepian-Wolf coding for general sources and channel coding for a class of cyclic-symmetric channels is established under optimal decoding, through which the general formula for the Slepian-Wolf limit can be reinterpreted using Verdu and Han's ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exit Chart Analysis for Slepian-Wolf Turbo Compression

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

    The main objective of this paper is to extend EXIT charts performance analysis technique from turbo channel codes to compressive turbo codes used for the Slepian-Wolf problem. We present the methodology on using EXIT charts in this problem and illustrate its results for several pairs of correlated memoryless sources and turbo compression schemes, observing a good match between numerical EXIT resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EXIT Charts of LDPC Codes over BIAWGN Channels with Imperfect Channel Estimation

    Publication Year: 2007, Page(s):65 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    To efficiently design LDPC code ensembles that perform well in the presence of channel estimation error (also referred to as "SNR mismatch"), it is necessary to generate extrinsic information transfer (EXIT) charts. We have previously observed that the variable node (check node) EXIT curve in the presence of mismatch lies below (above) the original variable node curve in the absence of mismatch in... View full abstract»

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