default search action
Esa Malkamäki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c11]Elena Virtej, Petteri Lundén, Niko Kolehmainen, Tero Henttonen, Lars Dalsgaard, Esa Malkamäki, Sari Nielsen:
Idle Mode Measurements to Enable Fast Small Cell Access without Compromising Energy Efficiency. VTC Fall 2018: 1-5 - 2016
- [j6]David López-Pérez, Daniela Laselva, Eugen Wallmeier, Päivi Purovesi, Petteri Lundén, Elena Virtej, Piotr Lechowicz, Esa Malkamäki, Ming Ding:
Long Term Evolution-Wireless Local Area Network Aggregation Flow Control. IEEE Access 4: 9860-9869 (2016) - [j5]Claudio Rosa, Klaus I. Pedersen, Hua Wang, Per-Henrik Michaelsen, Simone Barbera, Esa Malkamäki, Tero Henttonen, Benoist Sébire:
Dual connectivity for LTE small cell evolution: functionality and performance aspects. IEEE Commun. Mag. 54(6): 137-143 (2016) - 2012
- [c10]Jani Puttonen, Elena Virtej, Ilkka Keskitalo, Esa Malkamäki:
On LTE performance trade-off between connected and idle states with always-on type applications. PIMRC 2012: 981-985
2000 – 2009
- 2007
- [c9]Tao Chen, Esa Malkamäki, Tapani Ristaniemi:
Uplink DPCCH Gating of Inactive UEs in Continuous Packet Connectivity Mode for HSUPA. WCNC 2007: 1684-1689 - [c8]Oscar Fresan, Tao Chen, Esa Malkamäki, Tapani Ristaniemi:
DPCCH Gating Gain for Voice Over IP on HSUPA. WCNC 2007: 4274-4278 - 2006
- [c7]Harri Holma, Markku Kuusela, Esa Malkamäki, Karri Ranta-aho, Tao Chen:
VOIP over HSPA with 3GPP Release 7. PIMRC 2006: 1-5 - [c6]Tao Chen, Markku Kuusela, Esa Malkamäki:
Uplink Capacity of VoIP on HSUPA. VTC Spring 2006: 451-455 - 2005
- [c5]Massimo Bertinelli, Esa Malkamäki:
WCDMA enhanced uplink: HSUPA link level performance study. PIMRC 2005: 895-899 - 2004
- [c4]Massimo Bertinelli, Esa Malkamäki:
HARQ for WCDMA enhanced uplink: link level performance in SHO. PIMRC 2004: 2856-2860 - 2000
- [j4]Esa Malkamäki, Harry Leib:
Performance of truncated type-II hybrid ARQ schemes with noisy feedback over block fading channels. IEEE Trans. Commun. 48(9): 1477-1487 (2000)
1990 – 1999
- 1999
- [j3]Esa Malkamäki, Harry Leib:
Coded Diversity on Block-Fading Channels. IEEE Trans. Inf. Theory 45(2): 771-781 (1999) - [j2]Esa Malkamäki, Harry Leib:
Coded Diversity on Block-Fading Channels. IEEE Trans. Inf. Theory 45(4): 1228-1229 (1999) - [j1]Esa Malkamäki, Harry Leib:
Evaluating the performance of convolutional codes over block fading channels. IEEE Trans. Inf. Theory 45(5): 1643-1646 (1999) - 1997
- [c3]Esa Malkamäki, Harry Leib:
Type-II hybrid ARQ with convolutional codes over block fading Rayleigh channels. PIMRC 1997: 1191-1195 - 1994
- [c2]Esa Malkamäki, Francois de Ryck, Christophe Mourot, Alistair Urie:
A method for combining radio link simulations and system simulations for a slow frequency hopped cellular system. VTC 1994: 1145-1149 - [c1]Esa Malkamäki:
Performance of the burst-level ARQ error protection scheme in an indoor mobile radio environment. VTC 1994: 1412-1416
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-08-16 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint