Sciweavers

1147 search results - page 54 / 230
» Termination in language-based systems
Sort
View
RTCSA
2005
IEEE
14 years 2 months ago
FPGA-Based Content Protection System for Embedded Consumer Electronics
We propose a new architecture for a content protection system that conceals confidential data and algorithms in an FPGA as electrical circuits. This architecture is designed for a...
Hiroyuki Yokoyama, Kenji Toda
JSAC
2007
103views more  JSAC 2007»
13 years 8 months ago
Impact of Pilot Design on Achievable Data Rates in Multiple Antenna Multiuser TDD Systems
Abstract— In this paper we study the effects of practical pilotassisted channel state estimation on the achievable information theoretic data rates (uplink and downlink) in a mul...
Dragan Samardzija, Narayan B. Mandayam
APAL
2008
111views more  APAL 2008»
13 years 9 months ago
Cut elimination for a simple formulation of epsilon calculus
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...
Grigori Mints
AML
2005
69views more  AML 2005»
13 years 8 months ago
Epsilon substitution for transfinite induction
We apply Mints' technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction give...
Henry Towsner
GI
2005
Springer
14 years 2 months ago
On the Signaling Overhead in Dynamic OFDMA Wireless Systems
: It is well known that dynamic OFDMA systems potentially increase the spectral efficiency of wireless systems. They exploit diversity effects in time, space, and frequency by ass...
James Gross, Adam Wolisz, Hans-Florian Geerdes