Now showing items 533-552 of 1179

    • Joint Distributions of Arbitrary Variables Made Easy 

      Baraniuk, Richard G. (1998-10-01)
      In this paper, we propose a simple framework for studying certain distributions of variables beyond time-frequency and time-scale. When applicable, our results turn the theory of joint distributions of arbitrary variables ...
    • Joint multipath-Doppler diversity in fast fading channels 

      Sayeed, Akbar M.; Aazhang, Behnaam (1998-11-20)
      We present a new framework for code-division multiple access (CDMA) communication over fast fading mobile wireless channels. The performance of the RAKE receiver, which is at the heart of existing CDMA systems, degrades ...
    • Joint Multiuser Channel Estimation and Detection for CDMA Systems 

      Sengupta, Chaitali; Das, Suman; Cavallaro, Joseph R.; Aazhang, Behnaam (1999-02-20)
      We focus on the design of multiuser receiver structures for Code Division Multiple Access (CDMA) communication systems, in the presence of multipath effects and multiple sensors at the base station receiver. The joint ...
    • Joint signaling strategies for approaching the capacity of twisted-pair channels 

      Sendonaris, Andrew; Veeravalli, Venugopal V.; Aazhang, Behnaam (1998-10-20)
      A technique is presented for jointly optimizing the signaling in the two directions of transmission on a twisted-pair communications channel. It is then applied to twisted-pair channel models with monotonic channel response ...
    • Joint signaling techniques and spectral optimization for symmetric bit-rate communication over self-NEXT-dominated channels 

      Gaikwad, Rohit; Baraniuk, Richard G. (2004-07-01)
      We present a framework for maximizing the capacity of symmetric bit-rate communication services dominated by Gaussian crosstalk, in particular, digital subscriber line (DSL) services. We solve for optimal transmit power ...
    • Joint Signaling Techniques for Crosstalk-Dominated Communication Channels 

      Gaikwad, Rohit; Baraniuk, Richard G. (1999-12-01)
      We present a framework for maximizing the capacity (or bit rate) of symmetric bit rate communication services dominated by crosstalk, in particular digital subscriber line (DSL) services. We assume the DSL channel is a ...
    • Joint Source Channel Coding for Discrete Memoryless Channels 

      Bharadwaj, Vinay (2000-05-20)
      The design of optimal joint source/channel coding and decoding is examined for dis­ crete memoryless channels with end­to­end distortion as the criterion for reliable com­ munication. Joint source/channel encoders ...
    • JPEG Compression History Estimation for Color Images 

      Neelamani, Ramesh; de Queiroz, Ricardo; Fan, Zhigang; Baraniuk, Richard G. (2006-06-01)
      We routinely encounter digital color images that were previously compressed using the Joint Photographic Experts Group (JPEG) standard. En route to the image's current representation, the previous JPEG compression's various ...
    • JPEG Compression History Estimation for Color Images 

      Neelamani, Ramesh; de Queiroz, Ricardo; Fan, Zhigang; Dash, Sanjeeb; Baraniuk, Richard G. (2006)
      We routinely encounter digital color images that were previously JPEG-compressed. En route to the image's current representation, the previous JPEG compression's various settings—termed its JPEG compression history ...
    • JPEG Compression History Estimation for Color Images 

      Neelamani, Ramesh; de Queiroz, Ricardo; Fan, Zhigang; Baraniuk, Richard G. (2003-09-01)
      We routinely encounter digital color images that were previously JPEG-compressed. We aim to retrieve the various settings - termed JPEG compression history (CH) - employed during previous JPEG operations. This information ...
    • Keeping the Analog Genie in the Bottle: A Case for Digital Robots 

      Walker, Ian D.; Cavallaro, Joseph R.; Leuschen, Martin L. (1999-05-01)
      In this paper, we consider the case for adopting a truly 'digital' type of robot, which would evolve between a discrete and finite set of states. We adopt the point of view that the advantages of traditional robotic evolution ...
    • Laboratory Workstations in Electrical Engineering 

      Aneshansley, Daniel J.; Pottle, Christopher; Cavallaro, Joseph R. (1985-06-01)
      Computers, configured for data acquisition and control, have been used in undergraduate laboratories at Cornell University's School of Electrical Engineering since the early 1970s. The introduction of personal computers ...
    • Lattice Algorithms for Compression Color Space Estimation in JPEG Images 

      Neelamani, Ramesh; de Queiroz, Ricardo; Baraniuk, Richard G. (2001-08-01)
      JPEG (Joint Photographic Experts Group) is an international standard to compress and store digital color images [5]. Given a color image that was previously JPEG-compressed in some hidden color space, we aim to estimate ...
    • Layered Dynamic Fault Detection and Tolerance for Robots 

      Visinsky, Monica L.; Walker, Ian D.; Cavallaro, Joseph R. (1993-05-01)
      Fault tolerance is increasingly important for space and hazardous environment robotics. Robots need to quickly detect and tolerate internal failures in order to continue performing their tasks without the need for immediate ...
    • 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-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 ...
    • 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 ...
    • 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 ...