• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 515
Next 10 →

Linear-time Encodable and Decodable Error-Correcting Codes

by Daniel A. Spielman , 1996
"... We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-depth circuits of linear size and decoded by logarithmic depth circuits of size 0 (n log n). We present both randomized an ..."
Abstract - Cited by 145 (5 self) - Add to MetaCart
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-depth circuits of linear size and decoded by logarithmic depth circuits of size 0 (n log n). We present both randomized

The Volcano optimizer generator: Extensibility and efficient search

by Goetz Graefe - ICDE , 1993
"... Emerging database application domains demand not only new functionality but also high performance. To satisfy these two requirements, the Volcano project provides efficient, extensible tools for query and request processing, particularly for object-oriented and scientific database systems. One of th ..."
Abstract - Cited by 200 (1 self) - Add to MetaCart
of these tools is a new optimizer generator. Data model, logical algebra, physical algebra, and optimi-zation rules are translated by the optimizer generalor into optimizer source code. Compared with our earlier EX-ODUS optimizer generator prototype, the search engine is more extensible and powerful; it provides

1List Decoding of Polar Codes

by Ido Tal, Alexander Vardy
"... Abstract—We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arıkan. In the proposed list decoder, up to L decoding paths are considered concurrently at each decoding stage. Simulation results show that the r ..."
Abstract - Add to MetaCart
still requires O(L · n2) time, which is in stark contrast with the O(n logn) complexity of the original successive-cancellation decoder. We utilize the structure of polar codes to overcome this problem. Specifically, we devise an efficient, numerically stable, implementation taking only O(L · n logn

An Efficient List Decoder Architecture for Polar Codes

by Jun Lin, Zhiyuan Yan , 2014
"... Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length, the decoding performance of the SC algorithm is inferior. Th ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
reformulations and architectural techniques. In particular, an area efficient message memory architecture is proposed to reduce the area of the proposed decoder architecture. An efficient path pruning unit suitable for large list size is also proposed. For a polar code of length 1024 and rate 1 2, when list size

A Code-Motion Pruning Technique for Global Scheduling

by Luiz C. V. Dos Santos, M.J.M. Heijligers, C.A.J. van Eijk, J.T.J. van Eijndhoven, J.A.G. Jess - ACM Transactions on Design Automation of Electronic Systems (TODAES , 2000
"... In the high--level synthesis of ASICs or in the code generation for ASIPs, the presence of conditionals in the behavioral description represents an obstacle to exploit parallelism. Most existing methods use greedy choices in such a way that the search space is limited by the applied heuristics. For ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
In the high--level synthesis of ASICs or in the code generation for ASIPs, the presence of conditionals in the behavioral description represents an obstacle to exploit parallelism. Most existing methods use greedy choices in such a way that the search space is limited by the applied heuristics

Space-Time Polar Coded Modulation

by Kai Chen, Kai Niu, Jiaru Lin , 2014
"... The polar codes are proven to be capacity-achieving and are shown to have equivalent or even better finite-length performance than the turbo/LDPC codes under some improved decoding algorithms over the additive white Gaussian noise (AWGN) channels. Polar coding is based on the so-called channel polar ..."
Abstract - Add to MetaCart
, the proposed space-time polar coded modulation (STPCM) scheme allows a joint optimization of the binary polar coding, modulation and MIMO transmission. In addition, a practical solution of polar code construction over the fading channels is also provided, where the fading channels are approximated by an AWGN

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
, as experience becomes practice by its rooting in cultural codes. Networks and Cultural Transformation Culture was historically produced by symbolic interaction in a given space/time

Demand-driven type inference with subgoal pruning

by S Alexander Spoon , Olin Shivers , 2005
"... Abstract. After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, this paper proposes using a kind of demand-driven analysis where the number of active goals is carefully restric ..."
Abstract - Cited by 17 (2 self) - Add to MetaCart
of the algorithm. The time required varies from an average of one-tenth of one second per variable to an unknown maximum, again depending on the pruning threshold. These data suggest that 50 and 2000 are both good choices of pruning threshold, depending on whether speed or precision is more important.

On an Orthogonal Space-Time-Polarization Block Code

by Beata J. Wysocki, Tadeusz A. Wysocki, Sarah Spence Adams
"... Abstract Over the past several years, diversity methods such as space, time, and polarization diversity have been successfully implemented in wireless communications systems. Orthogonal space-time block codes efficiently combine space and time diversity, and they have been studied in detail. Polari ..."
Abstract - Add to MetaCart
Abstract Over the past several years, diversity methods such as space, time, and polarization diversity have been successfully implemented in wireless communications systems. Orthogonal space-time block codes efficiently combine space and time diversity, and they have been studied in detail

Motion Estimation And Dct Pruning: A Combined Approach To Video Coding

by D. Kalles, A. N. Skodras
"... : In the present communication an approach to the performance optimization of an H.261 implementation is described. Discrete Cosine Transform (DCT) coefficient pruning is employed and its effect on motion estimation strategies is studied. This interplay produces some very interesting experimental re ..."
Abstract - Add to MetaCart
-compensated coding, the performance and efficiency of a real-time system is highly dependent on the accura...
Next 10 →
Results 1 - 10 of 515
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University