default search action
Erik Lindskog
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j3]Erik Lindskog, Johan Vallhagen, Björn Johansson:
Production system redesign using realistic visualisation. Int. J. Prod. Res. 55(3): 858-869 (2017) - [c15]Daniel Nafors, Erik Lindskog, Jonatan Berglund, Liang Gong, Björn Johansson, Johan Vallhagen:
Realistic virtual models for factory layout planning. WSC 2017: 3976-3987 - 2014
- [c14]Jonatan Berglund, Erik Lindskog, Björn Johansson, Johan Vallhagen:
Using 3D laser scanning to support discrete event simulation of production systems: lessons learned. WSC 2014: 2990-2999 - 2013
- [c13]Sanjay Jain, Sigríður Sigurðardóttir, Erik Lindskog, Jon Andersson, Anders Skoogh, Björn Johansson:
Multi-resolution modeling for supply chain sustainability analysis. WSC 2013: 1996-2007 - 2012
- [c12]Björn Johansson, Jon Andersson, Erik Lindskog, Jonatan Berglund, Anders Skoogh:
Evaluation and Calculation of Dynamics in Environmental Impact Assessment. APMS (1) 2012: 135-141 - [c11]Sanjay Jain, Erik Lindskog, Björn Johansson:
Supply chain carbon footprint tradeoffs using simulation. WSC 2012: 279:1-279:12 - [c10]Erik Lindskog, Jonatan Berglund, Johan Vallhagen, Rolf Berlin, Björn Johansson:
Combining point cloud technologies with discrete event simulation. WSC 2012: 281:1-281:10 - 2011
- [c9]Erik Lindskog, Linus Lundh, Jonatan Berglund, Y. Tina Lee, Anders Skoogh, Björn Johansson:
A method for determining the environmental footprint of industrial products using simulation. WSC 2011: 2136-2147
2000 – 2009
- 2002
- [j2]Petre Stoica, Erik Lindskog:
Space-Time Block Coding for Channels with Intersymbol Interference. Digit. Signal Process. 12(4): 616-627 (2002) - [c8]Erik G. Larsson, Petre Stoica, Erik Lindskog, Jian Li:
Space-time block coding for frequency-selective channels. ICASSP 2002: 2405-2408 - 2000
- [j1]Mattias Wennström, Jonas Strandell, Tommy Öberg, Erik Lindskog, Anders Rydberg:
Auto-calibrating adaptive array for mobile telecommunications. IEEE Trans. Aerosp. Electron. Syst. 36(2): 729-736 (2000) - [c7]Erik Lindskog, Arogyaswami Paulraj:
A Transmit Diversity Scheme for Channels with Intersymbol Interference. ICC (1) 2000: 307-311
1990 – 1999
- 1998
- [c6]Erik Lindskog, Jonas Strandell:
Multi-user channel estimation exploiting pulse shaping information. EUSIPCO 1998: 1-4 - [c5]Jonas Strandell, Erik Lindskog:
Separate temporal and spatial parametric channel estimation. EUSIPCO 1998: 1-4 - [c4]Erik Lindskog, Claes Tidestav:
Reduced rank space-time equalization. PIMRC 1998: 1081-1085 - 1995
- [c3]Erik Lindskog, Anders Ahlén, Mikael Sternad:
Combined spatial and temporal equalization using an adaptive antenna array and a decision feedback equalization scheme. ICASSP 1995: 1189-1192 - [c2]Erik Lindskog:
Making SMI-beamforming insensitive to the sampling timing for GSM signals. PIMRC 1995: 664-668 - 1993
- [c1]Mikael Sternad, Anders Ahlén, Erik Lindskog:
Robust decision feedback equalizers. ICASSP (3) 1993: 555-558
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint