Anders Hansson | Ericsson - Academia.edu (original) (raw)

Papers by Anders Hansson

IEEE Transactions on Intelligent Vehicles, 2020

Lane-level map matching is essential for autonomous driving. In this paper, we propose a Hidden M... more Lane-level map matching is essential for autonomous driving. In this paper, we propose a Hidden Markov Model (HMM) for matching a trajectory of noisy GPS measurements to the road lanes in which the vehicle records its positions. To our knowledge, this is the first time that HMM is used for lanelevel map matching. Apart from GPS values, the model is further assisted by yaw rate data (converted to a lane change indicator signal) and visual cues in the form of the left and right lane marking types (dashed, solid, etc.). Having defined expressions for the HMM emission and transition probabilities, we evaluate our model to demonstrate that it achieves 95.1% recall and 3.3% median path length error for motorway trajectories.

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003

ABSTRACT

IEEE Transactions on Communications, 2003

An antenna array is proposed as a means of achieving a space-diversity effect that partly overcom... more An antenna array is proposed as a means of achieving a space-diversity effect that partly overcomes the severity of continuous-time Rayleigh fading channels. The investigated channel is assumed to be frequency-nonselective with correlated diversity links, where the correlation is related to the array geometry and the spatial and Doppler dispersions. Further, the error performance is improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a practical detector structure it is desirable to perform iterative decoding by applying some a posteriori probability (APP) algorithms. For this purpose, we propose a novel generalization of the well-known Bahl-Cocke-Jelinek-Raviv algorithm that calculates the APPs over channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended. Also, the error performance is significantly improved by introducing multiple antennas. The interleaver gain is, however, seen to be quite moderate, in contrast to additive white Gaussian noise channels.

... Professor Emeritus Irving S. Reed of the Communication Sciences Insti-tute, University of Sou... more ... Professor Emeritus Irving S. Reed of the Communication Sciences Insti-tute, University of Southern California, for memorable chats, ... Kyu-Hyuk Chung, Bob Weaver, Robert Wilson, PhunsakThien-nviboon, Yuankai Wang, Ali Taha, Durai Thirupathi, Jun Heo, Robert Golshan ...

13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05), 2005

This work demonstrates that road traffic simulation of entire metropolitan areas is possible with... more This work demonstrates that road traffic simulation of entire metropolitan areas is possible with reconfigurable supercomputing that combines 64-bit microprocessors and FPGAs in a high bandwidth, low latency interconnect. Previously, traffic simulation on FPGAs was limited to very short road segments or required a very large number of FP-GAs. Our data streaming approach overcomes scaling issues associated with direct implementations and still allows for high-level parallelism by dividing the data sets between hardware and software across the reconfigurable supercomputer. Using one FPGA on the Cray XD1 supercomputer, we are able to achieve a 34.4× speed up over the AMD microprocessor. System integration issues must be optimized to exploit this speedup in the overall simulation.

ACM/IEEE SC 2005 Conference (SC'05), 2005

A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes th... more A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes the severity of continuous-time frequency-flat Rayleigh fading channels, and fast fading channels in particular. The error performance is further improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code (CC) constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a feasible detector structure, it is desirable to perform iterative decoding, which implies the need for an APP (a posteriori probability) algorithm that can operate over fading channels. For this purpose, the well-known BCJR algorithm (due to Bahl, Cocke, Jelinek, Raviv [1]) is generalized to handle channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended, but the chief performance gain is due to space diversity provided by the multiple antennas.

Optimal (in the sense of minimum error probability) diversity reception of single symbols for fad... more Optimal (in the sense of minimum error probability) diversity reception of single symbols for fading, noisy channels is too complex for practical implementation. In this paper, a simplified, near-optimum receiver is proposed, which is based on the statistics of the fading channel. This receiver is then analyzed by exact error probability calculations.

Proceedings IEEE International Symposium on Information Theory,, 2002

An optimality criterion based on the notion of a sufficient statistic leads to detection breakdow... more An optimality criterion based on the notion of a sufficient statistic leads to detection breakdown when applied to unknown time-dispersive channels. We discuss an alternative optimality criterion.

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2000

Scientific application kernels mapped to reconfigurable hardware have been reported to have 10× t... more Scientific application kernels mapped to reconfigurable hardware have been reported to have 10× to 100× speedup over equivalent software. These promising results suggest that reconfigurable logic might offer significant speedup on applications in science and engineering. To accurately assess the benefit of hardware acceleration on scientific applications, however, it is necessary to consider the entire application including software components as well as the accelerated kernels. Aspects to be considered include alternative methods of hardware/software partitioning, communications costs, and opportunities for concurrent computation between software and hardware. Analysis of these factors is beyond the scope of current automatic parallelizing compilers.

IEEE Transactions on Communications, 2000

Optimum (in the sense of minimum-error probability) single-symbol diversity detection for fading,... more Optimum (in the sense of minimum-error probability) single-symbol diversity detection for fading, noisy channels is too complex for practical implementation. A simplified, near-optimum array receiver is proposed, which is based on the statistics (i.e., the covariance-function matrix) of the fading channel. This detector is then analyzed by calculating the exact error probability.

IEEE Transactions on Communications, 2003

An antenna array is proposed as a means of achieving a space-diversity effect that partly overcom... more An antenna array is proposed as a means of achieving a space-diversity effect that partly overcomes the severity of continuous-time Rayleigh fading channels. The investigated channel is assumed to be frequency-nonselective with correlated diversity links, where the correlation is related to the array geometry and the spatial and Doppler dispersions. Further, the error performance is improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a practical detector structure it is desirable to perform iterative decoding by applying some a posteriori probability (APP) algorithms. For this purpose, we propose a novel generalization of the well-known Bahl-Cocke-Jelinek-Raviv algorithm that calculates the APPs over channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended. Also, the error performance is significantly improved by introducing multiple antennas. The interleaver gain is, however, seen to be quite moderate, in contrast to additive white Gaussian noise channels.

IEEE Communications Letters, 2000

Two types of soft-input soft-output (SISO) algorithms have recently been proposed for iterative d... more Two types of soft-input soft-output (SISO) algorithms have recently been proposed for iterative decoding of concatenated codes applied over fading channels; forward-adaptive algorithms exploit the dependency between the present symbol interval and past symbol intervals, while forward/backward-adaptive algorithms take both the past and the future into account. Numerical results presented for interleaved serially concatenated continuous phase modulation (CPM) over the Rayleigh fading channel indicate that the performance of forward-adaptive algorithms approaches the performance of forward/backward-adaptive algorithms when a long channel-memory depth is exploited.

Communications, 2001. ICC 2001. …, 2001

Abstrctct-A multiple-antenna receiver is proposed for achieving a diversity effect that partly ov... more Abstrctct-A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes the severity of continuous-time frequencyflat Rayleigh fading channels, and fast fading channels in particular. The error performance is also improved by bit interleaving and channel coding, where the encoderdchannel is viewed as a serially concatenated system: a convolutional code constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a feasible detector structure it is desirable to perform iterative decoding by applying some U posteriori probability (APP) algorithms. For this purpose, we derive a novel generalization of the wellknown BCJR (due to Bahl, Cocke, Jelinek, and Raviv [l]) algorithm that calculates the APPs for fading channels-or for channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended, hut the chief performance gain is achieved by introducing multiple antennas.

Advances in Complex Systems, 2005

We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions . These syst... more We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions . These systems can be considered as sequential dynamical systems (SDS) over words, a class of dynamical systems that consists of (a) a finite, labeled graph Y with vertex set {v 1 , . . . , vn} and where each vertex v i has a state xv i in a finite field K,

IEEE Transactions on Intelligent Vehicles, 2020

Lane-level map matching is essential for autonomous driving. In this paper, we propose a Hidden M... more Lane-level map matching is essential for autonomous driving. In this paper, we propose a Hidden Markov Model (HMM) for matching a trajectory of noisy GPS measurements to the road lanes in which the vehicle records its positions. To our knowledge, this is the first time that HMM is used for lanelevel map matching. Apart from GPS values, the model is further assisted by yaw rate data (converted to a lane change indicator signal) and visual cues in the form of the left and right lane marking types (dashed, solid, etc.). Having defined expressions for the HMM emission and transition probabilities, we evaluate our model to demonstrate that it achieves 95.1% recall and 3.3% median path length error for motorway trajectories.

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003

ABSTRACT

IEEE Transactions on Communications, 2003

An antenna array is proposed as a means of achieving a space-diversity effect that partly overcom... more An antenna array is proposed as a means of achieving a space-diversity effect that partly overcomes the severity of continuous-time Rayleigh fading channels. The investigated channel is assumed to be frequency-nonselective with correlated diversity links, where the correlation is related to the array geometry and the spatial and Doppler dispersions. Further, the error performance is improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a practical detector structure it is desirable to perform iterative decoding by applying some a posteriori probability (APP) algorithms. For this purpose, we propose a novel generalization of the well-known Bahl-Cocke-Jelinek-Raviv algorithm that calculates the APPs over channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended. Also, the error performance is significantly improved by introducing multiple antennas. The interleaver gain is, however, seen to be quite moderate, in contrast to additive white Gaussian noise channels.

... Professor Emeritus Irving S. Reed of the Communication Sciences Insti-tute, University of Sou... more ... Professor Emeritus Irving S. Reed of the Communication Sciences Insti-tute, University of Southern California, for memorable chats, ... Kyu-Hyuk Chung, Bob Weaver, Robert Wilson, PhunsakThien-nviboon, Yuankai Wang, Ali Taha, Durai Thirupathi, Jun Heo, Robert Golshan ...

13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'05), 2005

This work demonstrates that road traffic simulation of entire metropolitan areas is possible with... more This work demonstrates that road traffic simulation of entire metropolitan areas is possible with reconfigurable supercomputing that combines 64-bit microprocessors and FPGAs in a high bandwidth, low latency interconnect. Previously, traffic simulation on FPGAs was limited to very short road segments or required a very large number of FP-GAs. Our data streaming approach overcomes scaling issues associated with direct implementations and still allows for high-level parallelism by dividing the data sets between hardware and software across the reconfigurable supercomputer. Using one FPGA on the Cray XD1 supercomputer, we are able to achieve a 34.4× speed up over the AMD microprocessor. System integration issues must be optimized to exploit this speedup in the overall simulation.

ACM/IEEE SC 2005 Conference (SC'05), 2005

A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes th... more A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes the severity of continuous-time frequency-flat Rayleigh fading channels, and fast fading channels in particular. The error performance is further improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code (CC) constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a feasible detector structure, it is desirable to perform iterative decoding, which implies the need for an APP (a posteriori probability) algorithm that can operate over fading channels. For this purpose, the well-known BCJR algorithm (due to Bahl, Cocke, Jelinek, Raviv [1]) is generalized to handle channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended, but the chief performance gain is due to space diversity provided by the multiple antennas.

Optimal (in the sense of minimum error probability) diversity reception of single symbols for fad... more Optimal (in the sense of minimum error probability) diversity reception of single symbols for fading, noisy channels is too complex for practical implementation. In this paper, a simplified, near-optimum receiver is proposed, which is based on the statistics of the fading channel. This receiver is then analyzed by exact error probability calculations.

Proceedings IEEE International Symposium on Information Theory,, 2002

An optimality criterion based on the notion of a sufficient statistic leads to detection breakdow... more An optimality criterion based on the notion of a sufficient statistic leads to detection breakdown when applied to unknown time-dispersive channels. We discuss an alternative optimality criterion.

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2000

Scientific application kernels mapped to reconfigurable hardware have been reported to have 10× t... more Scientific application kernels mapped to reconfigurable hardware have been reported to have 10× to 100× speedup over equivalent software. These promising results suggest that reconfigurable logic might offer significant speedup on applications in science and engineering. To accurately assess the benefit of hardware acceleration on scientific applications, however, it is necessary to consider the entire application including software components as well as the accelerated kernels. Aspects to be considered include alternative methods of hardware/software partitioning, communications costs, and opportunities for concurrent computation between software and hardware. Analysis of these factors is beyond the scope of current automatic parallelizing compilers.

IEEE Transactions on Communications, 2000

Optimum (in the sense of minimum-error probability) single-symbol diversity detection for fading,... more Optimum (in the sense of minimum-error probability) single-symbol diversity detection for fading, noisy channels is too complex for practical implementation. A simplified, near-optimum array receiver is proposed, which is based on the statistics (i.e., the covariance-function matrix) of the fading channel. This detector is then analyzed by calculating the exact error probability.

IEEE Transactions on Communications, 2003

An antenna array is proposed as a means of achieving a space-diversity effect that partly overcom... more An antenna array is proposed as a means of achieving a space-diversity effect that partly overcomes the severity of continuous-time Rayleigh fading channels. The investigated channel is assumed to be frequency-nonselective with correlated diversity links, where the correlation is related to the array geometry and the spatial and Doppler dispersions. Further, the error performance is improved by bit interleaving and channel coding, where the encoders/channel is viewed as a serially concatenated system: a convolutional code constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a practical detector structure it is desirable to perform iterative decoding by applying some a posteriori probability (APP) algorithms. For this purpose, we propose a novel generalization of the well-known Bahl-Cocke-Jelinek-Raviv algorithm that calculates the APPs over channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended. Also, the error performance is significantly improved by introducing multiple antennas. The interleaver gain is, however, seen to be quite moderate, in contrast to additive white Gaussian noise channels.

IEEE Communications Letters, 2000

Two types of soft-input soft-output (SISO) algorithms have recently been proposed for iterative d... more Two types of soft-input soft-output (SISO) algorithms have recently been proposed for iterative decoding of concatenated codes applied over fading channels; forward-adaptive algorithms exploit the dependency between the present symbol interval and past symbol intervals, while forward/backward-adaptive algorithms take both the past and the future into account. Numerical results presented for interleaved serially concatenated continuous phase modulation (CPM) over the Rayleigh fading channel indicate that the performance of forward-adaptive algorithms approaches the performance of forward/backward-adaptive algorithms when a long channel-memory depth is exploited.

Communications, 2001. ICC 2001. …, 2001

Abstrctct-A multiple-antenna receiver is proposed for achieving a diversity effect that partly ov... more Abstrctct-A multiple-antenna receiver is proposed for achieving a diversity effect that partly overcomes the severity of continuous-time frequencyflat Rayleigh fading channels, and fast fading channels in particular. The error performance is also improved by bit interleaving and channel coding, where the encoderdchannel is viewed as a serially concatenated system: a convolutional code constitutes the outer code, whereas a differential encoder and the fading channel (having truncated memory) form a joint inner code. In order to obtain a feasible detector structure it is desirable to perform iterative decoding by applying some U posteriori probability (APP) algorithms. For this purpose, we derive a novel generalization of the wellknown BCJR (due to Bahl, Cocke, Jelinek, and Raviv [l]) algorithm that calculates the APPs for fading channels-or for channels having memory. Numerical results indicate that iterative decoding becomes more powerful when the exploited channel memory depth is extended, hut the chief performance gain is achieved by introducing multiple antennas.

Advances in Complex Systems, 2005

We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions . These syst... more We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions . These systems can be considered as sequential dynamical systems (SDS) over words, a class of dynamical systems that consists of (a) a finite, labeled graph Y with vertex set {v 1 , . . . , vn} and where each vertex v i has a state xv i in a finite field K,