Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Juha Yli-Kaakinen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Vesa Lehtinen

> Home > Persons > Juha Yli-Kaakinen

Publications

2020
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/iotj/LoulouYLLSWRV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iotj/LoulouYLLSWRV20
AlaaEddin Loulou, Juha Yli-Kaakinen, Toni Levanen, Vesa Lehtinen, Frank Schaich, Thorsten Wild, Markku Renfors, Mikko Valkama:
Multiplierless Filtered-OFDM Transmitter for Narrowband IoT Devices. IEEE Internet Things J. 7(2): 846-862 (2020)
2019
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/iswcs/LoulouYLLSWRV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iswcs/LoulouYLLSWRV19
AlaaEddin Loulou, Juha Yli-Kaakinen, Toni Levanen, Vesa Lehtinen, Frank Schaich, Thorsten Wild, Markku Renfors, Mikko Valkama:
Look-Up Table Based Implementation of Ultra-Low Complexity Narrowband OFDM Transmitters. ISWCS 2019: 127-132
2015
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/tcas/Yli-KaakinenLR15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcas/Yli-KaakinenLR15
Juha Yli-Kaakinen, Vesa Lehtinen, Markku Renfors:
Multirate Charge-Domain Filter Design for RF-Sampling Multi-Standard Receiver. IEEE Trans. Circuits Syst. I Regul. Pap. 62-I(2): 590-599 (2015)

a service of

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.