Now showing items 573-592 of 1225

    • LDPC Code Design for Half-Duplex Decode-and-Forward Relaying 

      Chakrabarti, Arnab; de Baynast, Alexandre; Sabharwal, Ashutosh; Aazhang, Behnaam (2005-09-01)
      We propose LDPC code designs for the half-duplex relay channel. Our designs mimic the information theoretic random coding scheme for decode-and-forward relaying. An important advantage of our scheme is that it is built ...
    • LDPC Code Design for OFDM Channel: Graph Connectivity and Information Bits Positioning 

      de Baynast, Alexandre; Sabharwal, Ashutosh; Aazhang, Behnaam (2005-07-01)
      We present an optimized channel coding scheme for OFDM transmission. In the future wireless standards such IEEE 802.11n, frame error rates (FER) as low as 0.0001 are targeting. Irregular LDPC codes have excellent performance ...
    • LDPC Code Design for Relay Channel in Time-Division mode 

      de Baynast, Alexandre; Chakrabarti, Arnab; Sabharwal, Ashutosh; Aazhang, Behnaam (2006-06-01)
      We address the problem of LDPC code design for relay channel in time-division mode based on a distributed strategy: In the first time slot, the source transmits part of the codeword. The relay and the destination receive ...
    • LDPC Code-Design for the Relay Channel 

      Chakrabarti, Arnab; de Baynast, Alexandre; Sabharwal, Ashutosh; Aazhang, Behnaam (2006-06-01)
      We propose LDPC code designs for the half-duplex relay channel. Our designs are derived from the information theoretic random coding scheme for decode-and-forward relaying. An important advantage of our scheme is that it ...
    • LDPC Code-Design for the Relay Channel 

      Chakrabarti, Arnab; de Baynast, Alexandre; Sabharwal, Ashutosh; Aazhang, Behnaam (2006-02-01)
      We propose LDPC code designs for the half-duplex relay channel. Our designs are derived from the information theoretic random coding scheme for decode-and-forward relaying. An important advantage of our scheme is that it ...
    • Learning minimum volume sets with support vector machines 

      Davenport, Mark A.; Baraniuk, Richard G.; Scott, Clayton D. (2006-09-01)
      Given a probability law P on d-dimensional Euclidean space, the minimum volume set (MV-set) with mass beta , 0 < beta < 1, is the set with smallest volume enclosing a probability mass of at least beta. We examine the use ...
    • Lenslet array tunable snapshot imaging spectrometer (LATIS) for hyperspectral fluorescence microscopy 

      Dwight, Jason G.; Tkaczyk, Tomasz S. (2017)
      Snapshot hyperspectral imaging augments pixel dwell time and acquisition speeds over existing scanning systems, making it a powerful tool for fluorescence microscopy. While most snapshot systems contain fixed datacube ...
    • Lifting Construction of Non-Linear Wavelet Transforms 

      Claypoole, Roger L.; Baraniuk, Richard G.; Nowak, Robert David (1998-10-01)
      This paper analyzes non-linear wavelet transforms using the lifting construction. The lifting construction exploits a spatial-domain, prediction-error interpretation of the wavelet transform and provides a powerful framework ...
    • A Limitation of the Kernel Method for Joint Distributions of Arbitrary Variables 

      Baraniuk, Richard G. (1996-02-01)
      Recently, Cohen has proposed a construction for joint distributions of arbitrary physical quantities, in direct generalization of joint time-frequency representations. Actually this method encompasses two approaches, one ...
    • The Limiting Density of a Nonlinear System 

      Papantoni-Kazakos, P.; Kazakos, D. (1974-10-20)
      The RC filter-hard limiter-RC filter nonlinear system shown in Fig. 1 is the subject of this paper. Because of computational difficulties implicated in the analysis of the above system, only its response to the zero mean ...
    • Limits of population coding 

      Johnson, Don (2003-07-20)
      To understand whether the population response expresses information better than the aggregate of the individual responses, the sum of the individual contributions is frequently used as a baseline against which to assess ...
    • Linear finite memory-length multiuser detectors 

      Juntti, Markku J.; Aazhang, Behnaam (1995-10-20)
      Decorrelating, LMMSE, and the noise-whitening multiuser detectors for code division multiple access (CDMA) are ideally infinite memory length (IIR) detectors. To obtain more practical and robust systems linear finite ...
    • LM-g SPLINES 

      de Figueiredo, Rui J.P. (1975-07-20)
      As an extension of the notion of an <em>L-g</em> spline, three mathematical structures called <em>LM-g</em> splines of types, I, II and II are introduced. (partial abstract)
    • Locating Available Bandwidth Bottlenecks 

      Ribeiro, Vinay Joseph; Riedi, Rudolf H.; Baraniuk, Richard G. (2004-09-01)
      The Spatio-temporal Available Bandwidth estimator (STAB), a new edge-based probing tool, locates thin links --- those links with less available bandwidth than all links preceeding them --- on end-to-end network paths. By ...
    • Long-Range Dependence: Now you see it now you don't! 

      Karagiannis , Thomas; Faloutsos , Michalis; Riedi, Rudolf H. (2002-11-20)
      Over the last few years, the network community has started to rely heavily on the use of novel concepts such as self-similarity and Long-Range Dependence (LRD). Despite their wide use, there is still much confusion regarding ...
    • A low complexity and low power SoC design architecture for adaptive MAI suppression in CDMA systems 

      Guo, Yuanbin; Cavallaro, Joseph R. (2005-05-01)
      In this paper, we propose a reduced complexity and power efficient System-on-Chip (SoC) architecture for adaptive interference suppression in CDMA systems. The adaptive Parallel-Residue-Compensation architecture leads to ...
    • Low Complexity Iterative Multiuser Detection and Decoding for Real-Time Applications 

      Das, Suman; Erkip, Elza; Cavallaro, Joseph R.; Aazhang, Behnaam (2005-07-01)
      This paper presents a low-complexity multiuser decoding technique that can be implemented in real time for a convolutionally coded direct sequence code division multiple access (DS-CDMA) system. The main contribution, ...
    • Low complexity MMSE based interference cancellation for LTE uplink MIMO receiver 

      Yin, Bei; Cavallaro, Joseph R. (2011-12-01)
      In this paper, we propose a novel low complexity minimum mean square error (MMSE) interference cancellation (IC) to minimize the residual inter-symbol and inter-antenna interference in LTE/LTE-Advanced uplink. In the ...
    • Low Complexity Opportunistic Decoder for Network Coding 

      Yin, Bei; Wu, Michael; Wang, Guohui; Cavallaro, Joseph R. (2012-12-01)
      In this paper, we propose a novel opportunistic decoding scheme for network coding decoder which significantly reduces the decoder complexity and increases the throughput. Network coding was proposed to improve the ...
    • Low complexity scalable MIMO sphere detection through antenna detection reordering 

      Wu, Michael; Dick, Chris; Sun, Yang; Cavallaro, Joseph R. (2012-07-01)
      This paper describes a novel low complexity scalable multiple-input multiple-output (MIMO) detector that does not require preprocessing and the optimal squared l2-norm computations to achieve good bit error (BER) performance. ...