Erik G. Ström

Prof. Erik G. Ström

orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 December 2012 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
RVReza Monir Vaghefi
Reza Monir Vaghefi
MGMohammad Reza Gholami
Mohammad Reza Gholami
RBR. Michael Buehrer
R. Michael Buehrer
ESErik G. Ström
Erik G. Ström
Cooperative localization (also known as sensor network localization) using received signal strength (RSS) measurements when the source transmit powers are different and unknown is investigated. Previous studies were based on the assumption that the transmit powers of source nodes are the same and perfectly known which is not practical. In this paper, the source transmit powers are considered as nuisance parameters and estimated along with the source locations. The corresponding Cramér-Rao lower bound (CRLB) of the problem is derived. To find the maximum likelihood (ML) estimator, it is necessary to solve a nonlinear and nonconvex optimization problem, which is computationally complex. To avoid the difficulty in solving the ML estimator, we derive a novel semidefinite programming (SDP) relaxation technique by converting the ML minimization problem into a convex problem which can be solved efficiently. The algorithm requires only an estimate of the path loss exponent (PLE). We initially assume that perfect knowledge of the PLE is available, but we then examine the effect of imperfect knowledge of the PLE on the proposed SDP algorithm. The complexity analyses of the proposed algorithms are also studied in detail. Computer simulations showing the remarkable performance of the proposed SDP algorithm are presented.

1 September 2008
Verified
Conference Paper
Closed access
KBKatrin Bilstrup
Katrin Bilstrup
EUElisabeth Uhlemann
Elisabeth Uhlemann
ESErik G. Ström
Erik G. Ström
UBUrban Bilstrup
Urban Bilstrup
In this paper the medium access control (MAC) method of the upcoming vehicular communication standard IEEE 802.11p has been simulated in a highway scenario with periodic broadcast of time-critical packets (so-called heartbeat messages) in a vehicle-to-vehicle situation. The 802.11p MAC method is based on carrier sense multiple access (CSMA) where nodes listen to the wireless channel before sending. If the channel is busy, the node must defer its access and during high utilization periods this could lead to unbounded delays. This well-known property of CSMA is undesirable for time-critical communications. The simulation results reveal that a specific node/vehicle is forced to drop over 80% of its heartbeat messages because no channel access was possible before the next message was generated. To overcome this problem, we propose to use self-organizing time division multiple access (STDMA) for real-time data traffic between vehicles. This MAC method is already successfully applied in commercial surveillance applications for ships (AIS) and airplanes (VDL mode 4). Our initial results indicate that STDMA outperforms CSMA for time-critical traffic safety applications in ad hoc vehicular networks.

9 October 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JOJohan Ostman
Johan Ostman
GDGiuseppe Durisi
Giuseppe Durisi
ESErik G. Ström
Erik G. Ström
MCMustafa C. Coskun
Mustafa C. Coskun
GLGianluigi Liva
Gianluigi Liva
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability.We focus on the practically relevant scenario in which there is no a priori channel state information available at the transmitter and at the receiver. An upper bound built upon the min-max converse is compared to two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver; the second one employs pilot-assisted transmission (PAT) followed by maximum-likelihood channel estimation and scaled mismatched nearest-neighbor decoding at the receiver. Our bounds are tight enough to unveil the optimum number of diversity branches that a packet should span so that the energy per bit required to achieve a target packet error probability is minimized, for a given constraint on the code rate and the packet size. Furthermore, the bounds reveal that noncoherent transmission is more energy efficient than PAT, even when the number of pilot symbols and their power is optimized. For example, in Rayleigh fading, for the case when a coded packet of 168 symbols is transmitted using a channel code of rate 0.48 bits/channel use, over a block-fading channel with block size equal to 8 symbols, PAT requires an additional 1.2 dB of energy per information bit to achieve a packet error probability of 10–3 compared to a suitably designed noncoherent transmission scheme. Finally, we devise a PAT scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics decoding, whose performance is close (1 dB gap at 10–3 packet error probability) to the ones predicted by our PAT lower bound. This shows that the PAT lower bound provides useful guidelines on the design of actual PAT schemes.

29 April 2013 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MGMohammad Reza Gholami
Mohammad Reza Gholami
RVReza Monir Vaghefi
Reza Monir Vaghefi
ESErik G. Ström
Erik G. Ström
This correspondence studies the received signal strength-based localization problem when the transmit power or path-loss exponent is unknown. The corresponding maximum-likelihood estimator (MLE) poses a difficult nonconvex optimization problem. To avoid the difficulty in solving the MLE, we use suitable approximations and formulate the localization problem as a general trust region subproblem, which can be solved exactly under mild conditions. Simulation results show a promising performance for the proposed methods, which also have reasonable complexities compared to existing approaches.

17 November 2003 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JLJ. Lassing
J. Lassing
ESErik G. Ström
Erik G. Ström
EAE. Agrell
E. Agrell
TOT. Ottosson
T. Ottosson
The problem of calculating the average bit-error probability (BEP) of coherent M-ary phase-shift keying (PSK) over a Gaussian channel has been studied previously in the literature. A solution to the problem for systems using a binary reflected Gray code (BRGC) to map bits to symbols was first presented by P.J. Lee (see ibid., vol.COM-34, p.488-91, 1986). We show that the results obtained by Lee are incorrect for M/spl ges/16. We show that the reason for this is an invalid assumption that the bit-error rate (BER) is independent of the transmitted symbols, an assumption which has also propagated to textbooks. We give a new expression for the BER of M-PSK systems using the BRGC and compare this with Lee's results.

1 July 2011 in Proceedings of the IEEE
Verified
Journal Article
Closed access
ESErik G. Ström
Erik G. Ström
In this paper, we will outline the current European development of wireless communications to support cooperative Intelligent Transport Systems (ITS). The focus will be on spectrum allocation and the physical and medium access control layers of the ITS-G5 access technology, which is under specification by the European Telecommunications Standards Institute (ETSI). The European ITS architecture and European standardization will also be briefly discussed.