Filters








96,361 Hits in 4.3 sec

Links between complexity theory and constrained block coding

L. Stockmeyer, D.S. Modha
2002 IEEE Transactions on Information Theory  
The goal of this paper is to establish links between computational complexity theory and the theory and practice of constrained block coding.  ...  In particular, the complexities of several fundamental problems in constrained block coding are precisely classified in terms of the existing complexity-theoretic structure.  ...  Section II contains definitions of concepts from constrained coding theory and complexity theory that are used in the paper.  ... 
doi:10.1109/18.971739 fatcat:2c6f3wd7pjbmhjegeqkfpttfhm

Links between complexity theory and constrained block coding

L. Stockmeyer, D.S. Modha
Proceedings 16th Annual IEEE Conference on Computational Complexity  
The goal of this paper is to establish links between computational complexity theory and the theory and practice of constrained block coding.  ...  In particular, the complexities of several fundamental problems in constrained block coding are precisely classified in terms of the existing complexity-theoretic structure.  ...  Section II contains definitions of concepts from constrained coding theory and complexity theory that are used in the paper.  ... 
doi:10.1109/ccc.2001.933890 dblp:conf/coco/StockmeyerM01 fatcat:c4xx3rviubgj3nhv3h5m6lckti

Links between complexity theory and constrained block coding

L. Stockmeyer, D.S. Modha
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)  
The goal of this paper is to establish links between computational complexity theory and the theory and practice of constrained block coding.  ...  In particular, the complexities of several fundamental problems in constrained block coding are precisely classified in terms of the existing complexity-theoretic structure.  ...  Section II contains definitions of concepts from constrained coding theory and complexity theory that are used in the paper.  ... 
doi:10.1109/isit.2001.936114 fatcat:fpxtisrbu5a45nlenjxs2u4ppu

Page 8758 of Mathematical Reviews Vol. , Issue 2002K [page]

2002 Mathematical Reviews  
(1-IBM2; San Jose, CA); Modha, Dharmendra S. (1-1BM2; San Jose, CA) Links between complexity theory and constrained block coding.  ...  Theory 48 (2002), no. 1, 59-88. The complexities of various fundamental problems in con- strained block coding are precisely classified in terms of the existing complexity-theoretic structure.  ... 

Game Theory Based Radio Resource Management Algorithm for Packet Access Cellular Networks

Mihály Varga, Zsolt Alfréd Polgár
2017 Acta Universitatis Sapientiae Electrical and Mechanical Engineering  
These constraints refer to low complexity and power consumption and high spectral efficiency and can be met by multidimensional optimization.  ...  at the expense of somewhat increased complexity.  ...  The scheduling process is executed during each Transmission Time Interval (TTI) and the link adaptation process, i.e. the selection of the modulation and coding scheme for each user, is a preliminary step  ... 
doi:10.1515/auseme-2017-0007 fatcat:lx7ws2rr7rbdthwuchjfv4sf7q

Sliding-Block Decodable Encoders Between$(d,k)$Runlength-Limited Constraints of Equal Capacity

N. Kashyap, P.H. Siegel
2004 IEEE Transactions on Information Theory  
We determine the pairs of ( )-constrained systems, ( ) and (^^), of equal capacity, for which there exists a rate 1:1 sliding-block-decodable encoder from ( ) to (^^).  ...  In all cases where there exists such an encoder, we explicitly describe the encoder and its corresponding sliding-block decoder.  ...  ACKNOWLEDGMENT The authors wish to thank Brian Marcus for an especially thorough review of the correspondence, and for suggesting various changes to the presentation in the interests of simplicity and  ... 
doi:10.1109/tit.2004.828145 fatcat:jwvy7jylh5fqpa4ssazjwg33vy

Study of a new link layer security scheme in a wireless sensor network [article]

Nasrin Sultana, Tanvir Ahmed, A. B. M. Siddique Hossain
2012 arXiv   pre-print
In this paper we have proposed a new technique to provide data authentication and privacy in faster, scalable and cost effective way.  ...  While a variety of security techniques are being developed and lots of researches are going on security fields.  ...  A large number of sensor nodes are deployed and the MAC scheme must establish the communication link between the sensor nodes.  ... 
arXiv:1209.5428v1 fatcat:nknkvgtixnauxidpi2x5dt6fry

Sliding-Window Designs for Vertex-Based Shape Coding

Ferdous A. Sohel, Gour C. Karmakar, Laurence S. Dooley, Mohammed Bennamoun
2012 IEEE transactions on multimedia  
This paper presents a series of new enhancements to existing techniques for determining the best SW-length within a rate-distortion (RD) framework, and analyses the nexus between SW-length and storage  ...  Traditionally the sliding window (SW) has been employed in vertex-based operational rate distortion (ORD) optimal shape coding algorithms to ensure consistent distortion (quality) measurement and improve  ...  The distance between these is then calculated for the RL and coded using FLC, variable length codes (VLC), or the prefix-free logarithmic codes (LC), which have the general form , where is the length of  ... 
doi:10.1109/tmm.2011.2182507 fatcat:z22437xfqberdhqdqtjny7evaa

Rigid body dynamics of mechanisms 1. Theoretical basis

2003 Computers and Mathematics with Applications  
Building blocks of joint models. 5.2.1.1. Common-point constraint (BBl; three constrained translational DOFs). 5.2.1.2.  ...  Position constraints between a body and the base. 5.1.1.1.1. Partial-position constraint (massless revolute-translational link). 5.1.1.1.2.  ... 
doi:10.1016/s0898-1221(03)90072-1 fatcat:6clbn7ylq5huljyip2ihgqdnfi

Joint Source-Channel Coding for Video Communications [chapter]

Fan Zhai, Yiftach Eisenberg, Aggelos K. Katsaggelos
2005 Handbook of Image and Video Processing  
Rate-distortion theory A high level block diagram of a video transmission system is shown in Fig. 1.2 .  ...  In it, X andX represent respectively the source and reconstructed video, X s andX s the source encoder output and the source decoder input, and X c and X c the channel encoder output and the channel decoder  ...  However, the assumptions on which separation theory is based (infinite length codes, delay, and complexity) may not hold in a practical system.  ... 
doi:10.1016/b978-012119792-6/50124-8 fatcat:b5bdcwxezbekxayxjxemqgavbu

Coded Modulation With Mismatched CSIT Over MIMO Block-Fading Channels

Tùng T. Kim, Khoa D. Nguyen, Albert Guillen i Fabregas
2010 IEEE Transactions on Information Theory  
Reliable communication over delay-constrained multiple-input multiple-output (MIMO) block-fading channels with discrete inputs and mismatched (imperfect) channel state information at the transmitter (CSIT  ...  Index Terms-Coded modulation, discrete input, diversity methods, large-deviation analysis, MIMO systems, singleton bound.  ...  Let and , respectively, denote the fading power gain and phase corresponding to the link between transmit antenna , receive antenna at block . Then define and .  ... 
doi:10.1109/tit.2010.2070250 fatcat:w5xe543j5bbwbk3xwkb6f4xrwm

Outage Behavior of MIMO Channels with Partial Feedback and Minimum Multiplexing Gains

Thanh Kim, Mikael Skoglund
2006 2006 IEEE International Symposium on Information Theory  
The concept of minimum guaranteed multiplexing gain in the forward link is introduced and shown to significantly influence the optimal D-M tradeoff.  ...  With codes from this class, the optimal D-M tradeoff is achievable by the combination of a feedback-dependent power controller and only two codebooks.  ...  i.i.d. complex Gaussian with zero mean and unit variance.  ... 
doi:10.1109/isit.2006.262143 dblp:conf/isit/KimS06 fatcat:cptdgn4byrhsznpc4e5snwnzma

Queuing with Adaptive Modulation over MIMO Wireless Links for Deadline Constrained Traffic: Cross-Layer Analysis and Design

J. S. Harsini, F. Lahouti
2007 2007 IEEE International Conference on Communications  
space time block coding (STBC) over Nakagami fading channels.  ...  In the proposed analytical procedure, we use statistical delay-bound for deadline constrained traffic based on the effective bandwidth theory.  ...  space time block coding (STBC) over MIMO Nakagami fading channels.  ... 
doi:10.1109/icc.2007.47 dblp:conf/icc/HarsiniL07 fatcat:2nmyc5uo6vfxffczoimmje4wgm

Constrained Tensor Modeling Approach to Blind Multiple-Antenna CDMA Schemes

AndrÉ L. F. de Almeida, GÉrard Favier, JoÃo Cesar M. Mota
2008 IEEE Transactions on Signal Processing  
In this paper, we consider an uplink multiple-antenna code-division multiple-access (CDMA) system linking several multiple-antenna mobile users to one multiple-antenna base station.  ...  The distinguishing features of the proposed tensor modeling with respect to the already existing tensor-based CDMA models are: i) it copes with multiple transmit antennas and spreading codes per user and  ...  The link between this decomposition and the physical parameters of our system model is established in Section IV.  ... 
doi:10.1109/tsp.2008.917028 fatcat:m5rjmjgszvgdrkjdord7rfzvpa

A Survey of Image Compression Algorithms for Visual Sensor Networks

Abdelhamid Mammeri, Brahim Hadjou, Ahmed Khoumsi
2012 ISRN Sensor Networks  
That is, new strategies and mechanisms for power-efficient image compression algorithms are developed, since the application of the conventional methods is not always energy beneficial.  ...  In this paper, we provide a survey of image compression algorithms for visual sensor networks, ranging from the conventional standards such as JPEG and JPEG2000 to a new compression method, for example  ...  Despite the aforementioned CS benefits, there still exists a huge gap between theory and imaging applications.  ... 
doi:10.5402/2012/760320 fatcat:ksg76nsh4vc5fdvfwxujzhh5ra
« Previous Showing results 1 — 15 out of 96,361 results