Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Philip Schniter

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 Maxime Guillaud

> Home > Persons > Philip Schniter

Publications

2020
[j64]
- view
  authority control:
- export record
  dblp key:
  - journals/twc/NgoGDYS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/twc/NgoGDYS20
Khac-Hoang Ngo, Maxime Guillaud, Alexis Decurninge, Sheng Yang, Philip Schniter:
Multi-User Detection Based on Expectation Propagation for the Non-Coherent SIMO Multiple Access Channel. IEEE Trans. Wirel. Commun. 19(9): 6145-6161 (2020)
2019
[c57]
- view
  authority control:
- export record
  dblp key:
  - conf/acssc/NgoGDYSS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acssc/NgoGDYSS19
Khac-Hoang Ngo, Maxime Guillaud, Alexis Decurninge, Sheng Yang, Subrata Sarkar, Philip Schniter:
Non-Coherent Multi-User Detection Based on Expectation Propagation. ACSSC 2019: 2092-2096
[i57]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1905-11152
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1905-11152
Khac-Hoang Ngo, Maxime Guillaud, Alexis Decurninge, Sheng Yang, Subrata Sarkar, Philip Schniter:
Multi-User Detection Based on Expectation Propagation for the Non-Coherent SIMO Multiple Access Channel. CoRR abs/1905.11152 (2019)

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.