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

Lukasz Krzymien

dblp:00/2410 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Computer networks · 3 · 1 first-authorTheory of computation · 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
2 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 67% Coding theory · 33%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
0.222013
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers · IEEE Trans. Commun. 2013
A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels · IEEE Trans. Inf. Theory 2009
Physical-layer communications
log likelihood ratio
0.212013
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers · IEEE Trans. Commun. 2013
Physical-layer communications › signal detection
MIMO detection
0.212013
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers · IEEE Trans. Commun. 2013
Physical-layer communications › error probability analysis
saddlepoint approximation
0.212013
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers · IEEE Trans. Commun. 2013
Physical-layer communications
signal processing for communications
0.212013
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers · IEEE Trans. Commun. 2013
Information theory › network information theory › multiuser communication
code-division multiple access
0.112009
A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels · IEEE Trans. Inf. Theory 2009
Information theory › network information theory
multiple-access channel
0.112009
A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels · IEEE Trans. Inf. Theory 2009
Coding theory › error-correcting codes › decoding › iterative decoding › iterative detection and decoding
turbo equalization
0.112009
A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels · IEEE Trans. Inf. Theory 2009
Physical-layer communications
modulation
0.012013
Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers · IEEE Trans. Commun. 2013

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

iterative cancellation demodulation · 0.2error control decoding · 0.2saddlepoint approximation · 0.2complexity analysis · 0.2
YearPublicationVenuePosition
2013 Calculating LLRs via saddlepoint approximation in front-end MIMO receivers
abstract
In this work we consider the front-end receivers for flat fading MIMO transmission, whose essential feature is the calculation of the log-likelihood ratios (LLRs) for the transmitted bits. When the number of transmit antennas and the modulation size grow, the exact calculation of the LLRs is most often unfeasible due to the necessity to enumerate the symbols affecting the output. In this work, to avoid the burden of explicit enumeration, instead of calculating the likelihoods exactly, we explore the possibilities offered by the saddlepoint approximation of the likelihood functions. The resulting fixed-complexity approach significantly outperforms the well known linear-filter based minimum mean square error detection.
Martin Senst, Lukasz Krzymien, Leszek Szczecinski, Fabrice Labeau
ICC2
2013 Calculating LLRs via Saddlepoint Approximation in Front-End MIMO Receivers
abstract
In this work, we consider the front-end receivers for flat fading MIMO transmission, whose essential feature is the calculation of the log-likelihood ratios (LLRs) for the transmitted bits. When the number of transmit antennas and the modulation size grow, the exact calculation of the LLRs becomes unfeasible due to the necessity to enumerate the symbols affecting the output. In this work, to avoid the burden of explicit enumeration, instead of calculating the likelihoods exactly, we explore the possibilities offered by the saddlepoint approximation of the likelihood functions. The resulting fixed-complexity approach significantly outperforms the well known linear-filter based minimum mean square error detection. A complexity analysis identifies the main computational bottleneck of the proposed detection algorithm.
Martin Senst, Lukasz Krzymien, Leszek Szczecinski, Fabrice Labeau
IEEE Trans. Commun.2
2011 Near-Far Resistant MIMO Iterative Receiver for Uplink LTE
abstract
Equalization for uplink MIMO SC-FDMA LTE multi-stream transmission is considered utilizing linear filtering methods and redundancy in the form of channel coding. The equalizer jointly removes inter-symbol (ISI) as well as spatial (MIMO) interference. It is observed that in an unequal received power situation, gains over traditional MMSE frequency equalization can be obtained via group-based cancellation with turbo equalization. It is shown that signal co-existence is possible with this methodology and therefore QoS for cell-edge users can be maintained at considerably higher noise levels as compared to a baseline receiver.
Lukasz Krzymien, Christian Schlegel
ICC1
2009 A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels
abstract
Iterative processing for linear matrix channels, aka turbo equalization, turbo demodulation, or turbo code-division multiple access (CDMA), has traditionally been addressed as the concatenation of conventional error control codes with the linear (matrix) channel. However, in several situations, such as CDMA, multiple-input-multiple-output (MIMO) channels, orthogonal frequency-division multiplexing (OFDM), and intersymbol-interference (ISI) channels, the channel itself either contains inherent signal redundancy or such redundancy can readily be introduced at the transmitter. For such systems, iterative demodulation of the linear channel exploiting this redundancy using simple iterative cancellation demodulators, followed by conventional feedforward error control decoding, provides a low-complexity, but extremely efficient decoding alternative. This two-stage demodulator/decoder outperforms more complex turbo CDMA methods for equal power modes (users). Furthermore, it is shown that arbitrary numbers of modes can be supported if an unequal power distribution is adopted. These power distributions are nested, which means that additional modes can be added without disturbing an existing mode population. The main result shows that these nested power distributions enable the two-stage receiver to approach the Shannon capacity of the channel to within less than one bit for any signal-to-noise ratio (SNR).
Dmitri V. Truhachev, Christian Schlegel, Lukasz Krzymien
IEEE Trans. Inf. Theory3