Sciweavers

28 search results - page 4 / 6
» cpm 2008
Sort
View
TWC
2008
101views more  TWC 2008»
13 years 4 months ago
Simplified receiver design for STBC binary continuous phase modulation
Abstract-- Existing space-time codes have focused on multipleantenna systems with linear modulation schemes such as phaseshift keying and quadrature amplitude modulation. Continuou...
L. Xian, R. Punnoose, H. Liu
WALCOM
2008
IEEE
95views Algorithms» more  WALCOM 2008»
13 years 6 months ago
Indexing Circular Patterns
This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern...
Costas S. Iliopoulos, M. Sohel Rahman
CPM
2008
Springer
154views Combinatorics» more  CPM 2008»
13 years 6 months ago
Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
Mathias Möhl, Sebastian Will, Rolf Backofen
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 5 months ago
L2 Orthogonal Space Time Code for Continuous Phase Modulation
To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some auth...
Matthias Hesse, Jérôme Lebrun, Luc De...
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 6 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha