193 research outputs found
Conjugate-Root Offset-QAM for Orthogonal Multicarrier Transmission
Current implementations of OFDM/OQAM are restricted to band-limited symmetric
filters. To circumvent this, non-symmetric conjugate root (CR) filters are
proposed for OQAM modulation. The system is applied to Generalized Frequency
Division Multiplexing (GFDM) and a method for achieving transmit diversity with
OQAM modulation is presented. The proposal reduces implementation complexity
compared to existing works and provides a more regular phase space.
GFDM/CR-OQAM outperforms conventional GFDM in terms of symbol error rate in
fading multipath channels and provides a more localized spectrum compared to
conventional OQAM.Comment: 4pages, revised version submitted to IEEE WC
Reduced Complexity Calculation of LMMSE Filter Coefficients for GFDM
A low-complexity algorithm for calculation of the LMMSE filter coefficients
for GFDM in a block-fading multipath environment is derived in this letter. The
simplification is based on the block circularity of the involved matrices. The
proposal reduces complexity from cubic to squared order. The proposed approach
can be generalized to other waveforms with circular pulse shaping.Comment: Submitted to IEEE Electronics Letter
Constraint-wish and satisfied-dissatisfied: an overview of two approaches for dealing with bipolar querying
In recent years, there has been an increasing interest in dealing with user preferences in flexible database querying, expressing both positive and negative information in a heterogeneous way. This is what is usually referred to as bipolar database querying. Different frameworks have been introduced to deal with such bipolarity. In this chapter, an overview of two approaches is given. The first approach is based on mandatory and desired requirements. Hereby the complement of a mandatory requirement can be considered as a specification of what is not desired at all. So, mandatory requirements indirectly contribute to negative information (expressing what the user does not want to retrieve), whereas desired requirements can be seen as positive information (expressing what the user prefers to retrieve). The second approach is directly based on positive requirements (expressing what the user wants to retrieve), and negative requirements (expressing what the user does not want to retrieve). Both approaches use pairs of satisfaction degrees as the underlying framework but have different semantics, and thus also different operators for criteria evaluation, ranking, aggregation, etc
Bipolarity in ear biometrics
Identifying people using their biometric data is a problem that is getting increasingly more attention. This paper investigates a method that allows the matching of people in the context of victim identification by using their ear biometric data. A high quality picture (taken professionally) is matched against a set of low quality pictures (family albums). In this paper soft computing methods are used to model different kinds of uncertainty that arise when manually annotating the pictures. More specifically, we study the use of bipolar satisfaction degrees to explicitly handle the bipolar information about the available ear biometrics
Absolute integral closures of commutative rings
Absolute integral closures of general commutative unital rings are explored.
All rings admit absolute integral closures, but in general they are not unique.
In fact, among the reduced rings with finitely many minimal prime ideals,
finite products of domains are the only rings for which they are unique. And
arguments using model theory suggest that the same holds for all infinite rings
that are finite products of connected rings. Universal absolute integral
closures, which contain every absolute integral closure of a given ring, are
shown to exist for certain subrings of products of domains
Finite local principal ideal rings
Every finite local principal ideal ring is the homomorphic image of a
discrete valuation ring of a number field, and is determined by five
invariants. We present an action of a group, non-commutative in general, on the
set of Eisenstein polynomials, of degree matching the ramification index of the
ring, over the coefficient ring. The action is defined by taking resultants.Comment: The present edition is a substantial revision of version
Performance Analysis of a 5G Transceiver Implementation for Remote Areas Scenarios
The fifth generation of mobile communication networks will support a large
set of new services and applications. One important use case is the remote area
coverage for broadband Internet access. This use case ha significant social and
economic impact, since a considerable percentage of the global population
living in low populated area does not have Internet access and the
communication infrastructure in rural areas can be used to improve agribusiness
productivity. The aim of this paper is to analyze the performance of a 5G for
Remote Areas transceiver, implemented on field programmable gate array based
hardware for real-time processing. This transceiver employs the latest digital
communication techniques, such as generalized frequency division multiplexing
waveform combined with 2 by 2 multiple-input multiple-output diversity scheme
and polar channel coding. The performance of the prototype is evaluated
regarding its out-of-band emissions and bit error rate under AWGN channel.Comment: Presented in 2018 European Conference on Networks and Communications
(EuCNC),18-21 June, 2018, Ljubljana, Sloveni
- …