Results 261 to 270 of about 9,369 (286)
Some of the next articles are maybe not open access.
Cooperative Transmission Through Incremental Redundancy
2006Rapid development of wireless networks leads to unceasing appearance of new techniques and methods. Recently cooperative relaying emerged as viable and tempting option for future wireless networks. Cooperative transmission attempts to provide spatial diversity for hardware devices that have only one antenna through the joint use of antennas that belong
Vladimir Bashun, Konstantin Dubkov
openaire +1 more source
Incremental-redundancy transmission for meteor-burst communications
IEEE Transactions on Communications, 1991The performance of type-II hybrid automatic repeat request (ARQ) is compared to that of fixed-rate type-I hybrid ARQ for meteor-burst communications. Maximum throughput is obtained for meteor-burst communications by using a transmission scheme for which the information rate of the code, varies in response to the fluctuations in the power received from ...
Michael B. Pursley, Stuart D. Sandberg
openaire +1 more source
Incremental redundancy for evolutions of 3G CDMA systems
Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367), 2003An overview of the hybrid ARQ used by the 3G CDMA evolutions (1xEV-DV for cdma2000 and HSDPA for WCDMA) is provided, along with simulation data supporting several of the key design decisions. Enhancements to AMC and hybrid ARQ operation are also discussed.
Robert Love +3 more
openaire +1 more source
Incremental Calculation of Minimum-Redundancy Length-Restricted Codes
IEEE Transactions on Communications, 2003The prefix-free code construction problem is to take a message containing n unique symbols and produce a set of n codewords which can be used to create a reversible encoding of the message. The minimum-redundancy code construction problem adds the requirement that the code produced must minimise the cost of transmission (or storage) of the message ...
Mike Liddell, Alistair Moffat
openaire +2 more sources
On the optimality of incremental redundancy LAST coding
2005 International Conference on Wireless Networks, Communications and Mobile Computing, 2005In this paper, we establish the optimality of incremental redundancy lattice space-time (IR-LAST) coding scheme in terms of achieving the optimal tradeoff of the MIMO ARQ channel. An integral component of the optimal IR-LAST coding scheme is a list decoder, based on the MMSE lattice decoding principle, for joint error detection and correction ...
H. El Gamal, G. Caire, M.O. Damen
openaire +1 more source
Adaptive incremental redundancy [WCDMA systems]
2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484), 2003We develop an information-theoretic model to explain and predict the coding gains of the incremental redundancy over the Chase combining scheme. From this analysis, we identify a new approach to improve the spectral efficiency of the conventional incremental redundancy scheme, which uses the same modulation and coding formats and, most notably, the ...
J.-F. Cheng, Y.-P.E. Wang, S. Parkvall
openaire +1 more source
Incremental Redundancy via Check Splitting
23rd Biennial Symposium on Communications, 2006, 2006A new method of creating rateless codes for noisy channels is presented. Unlike puncturing, where every punctured variable disables several checks, or extending, which creates many cycles in the code graph or creates parity checks with insufficient weight, the proposed method uses check splitting to lower the rate of the code.
M. Good, F.R. Kschischang
openaire +1 more source
Resolving Collisions Via Incremental Redundancy: ARQ Diversity
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007A cross-layer approach is adopted for the design of finite-user symmetric random access wireless systems. Instead of the traditional collision model, a more realistic physical layer model is adopted. An incremental redundancy automatic repeat request (IR-ARQ) scheme, tailored to jointly combat the effects of user collisions, multi-path fading, and ...
Young-Han Nam +2 more
openaire +1 more source
Analysis of reliability-based incremental redundancy with convolutional codes
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004Incremental redundancy, or hybrid type-II ARQ (HARQ), algorithms use a combination of forward error correction and retransmissions to guarantee reliable packet data communication. In our previous work (V. Tripathi et al. 2003), we have proposed an adaptive HARQ algorithm that exploits received codeword reliability for optimizing the size of the ...
Eugene Visotsky +3 more
openaire +1 more source
A redundant incremental learning algorithm for SVM
2008 International Conference on Machine Learning and Cybernetics, 2008This paper presents an improved incremental learning technique for SVM, namely redundant incremental SVM (RISVM), for pattern classification problems. Through adding some non-support vectors (say, redundant vectors in the sense of contribution to the final solution) at each incremental step, the RISVM algorithm can achieve similar performance to the ...
openaire +1 more source