Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andreas Bury

dblp:48/8189 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › spread spectrum › multicarrier CDMA
multicarrier spread spectrum
0.012003
Diversity comparison of spreading transforms for multicarrier spread spectrum transmission · IEEE Trans. Commun. 2003
Physical-layer communications › fading channels
rayleigh fading
0.012003
Diversity comparison of spreading transforms for multicarrier spread spectrum transmission · IEEE Trans. Commun. 2003
Coding theory › error-correcting codes › combinatorial coding theory › finite geometry codes
euclidean geometry code
0.012003
Diversity comparison of spreading transforms for multicarrier spread spectrum transmission · IEEE Trans. Commun. 2003

Methods — techniques the papers use, named apart from their topics

hadamard transform · 0.1bit-error probability bounds · 0.0bit error probability bounds · 0.0
YearPublicationVenuePosition
2010 A low cost multi-standard near-optimal soft-output sphere decoder: Algorithm and architecture
abstract
We present an algorithm and architecture of a soft-output sphere decoder with an optimized hardware implementation for 2×2 MIMO-OFDM reception. We introduce a novel table look-up approach for symbol enumeration that simplifies the implementation of soft-output decoders. The HW implementation is targeted towards WLAN (IEEE 802.11n) with stringent latency and throughput requirements. The current implementation supports all modulation schemes (BPSK,QPSK,16-QAM, 64-QAM) and shows near-optimal real-time performance. To achieve this, the sphere decoder computes in the worst-case Euclidean distances of 4.1 Giga QAM symbols per second. This challenging requirement is met by a scalable, multi-standard HW architecture which can be tuned to other applications such as LTE, WiMax with no re-design effort. The current instance for WLAN occupies an area of only 0.17 mm2in 45 nm CMOS technology while providing a guaranteed throughput of 374 Msoftbits/s at 312 MHz clock rate (i.e. outputting 2×6 softbits worst-case every 10 clock cycles).
Özgün Paker, Sebastian Eckert, Andreas Bury
DATE3
2003 Diversity comparison of spreading transforms for multicarrier spread spectrum transmission
abstract
Multicarrier spread spectrum transmission methods based on orthogonal frequency division multiplexing employ a linear transform to spread energy of transmitted symbols over statistically independent Rayleigh fading subcarriers, in order to enable a diversity gain at the receiver. We jointly treat the mapping from bits into transmit symbols and the spreading transform as a code in Euclidean space. We describe criteria to identify good and bad spreading transforms, in terms of the asymptotic bit-error probability (BEP) at high signal-to-noise ratio. Upper and lower bounds on the BEP are derived. It is shown that the BEP performance of the commonly used Hadamard transform is asymptotically bad. Alternative orthogonal transforms with better asymptotic performance are proposed. Simulation results are given for the example of 2-phase-shift keying, block length 8.
Andreas Bury, Jochem Egle, Jürgen Lindner
IEEE Trans. Commun.1
2000 Comparison of amplitude distributions for Hadamard spreading and Fourier spreading in multi-carrier code division multiplexing
abstract
We investigate amplitude distributions of transmit signals for multi-carrier spread spectrum (MCSS) transmission methods based on orthogonal frequency division multiplexing (OFDM), also called multi-carrier code division multiplexing (MC-CDM). In particular we compare Fourier spreading with the commonly used Walsh-Hadamard spreading. As a basis for the comparison we describe a general model. Both up- and downlink of multiple access transmission schemes employing either multi-carrier code division multiple access (MC-CDMA) or multi-carrier frequency division multiple access (MC-FDMA) are compared.
Andreas Bury, Jürgen Lindner
GLOBECOM1