default search action
Andrei Alexandru Enescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j3]Camelia Elisei-Iliescu, Laura-Maria Dogariu, Constantin Paleologu
, Jacob Benesty
A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms. Algorithms 13(6): 135 (2020)
2010 – 2019
- 2019
- [j2]Razvan-Florentin Trifan, Andrei Alexandru Enescu, Constantin Paleologu
Hybrid MU-MIMO Precoding Based on K-Means User Clustering. Algorithms 12(7): 146 (2019) - 2017
- [c13]Victor-Florin Crasmariu, Marius-Octavian Arvinte, Andrei Alexandru Enescu, Silviu Ciochina:
Optimized block-diagonalization precoding technique using givens rotations QR decomposition. EUSIPCO 2017: 853-857 - [c12]Razvan-Florentin Trifan, Andrei Alexandru Enescu, Constantin Paleologu:
A Preview on MIMO Systems in 5G New Radio. FABULOUS 2017: 32-38 - [c11]Victor-Florin Crasmariu, Marius-Octavian Arvinte, Andrei Alexandru Enescu, Silviu Ciochina:
A reduced complexity multi-user massive MIMO precoding method. TSP 2017: 178-181 - 2016
- [c10]Victor-Florin Crasmariu, Marius-Octavian Arvinte, Andrei Alexandru Enescu, Silviu Ciochina:
Block-Diagonalization applied in multi-user Massive MIMO. COMM 2016: 205-208 - 2014
- [c9]Andrei Alexandru Enescu, Bogdan-Mihai Sandoi, Cosmin-Gabriel Dinu:
A low-complexity bit error rate estimation algorithm for wireless digital receivers. COMM 2014: 1-4 - [c8]Bogdan-Mihai Sandoi, Andrei Alexandru Enescu, Antal Anton, Andrei Gansari:
Discontinuous Transmission detection of signals carrying unknown data. COMM 2014: 1-4 - 2012
- [c7]Corneliu Eugen D. Sterian, Andrei Alexandru Enescu:
Extending Constellation Shaping by Shell Mapping Method to Reduce the Peak and Average Power of Space-Time Block Coded OFDM Systems. EW 2012
2000 – 2009
- 2009
- [c6]Constantin Paleologu, Andrei Alexandru Enescu, Silviu Ciochina, Felix Albu
QRD-LSL Adaptive Alogrithms Suitable for Fixed-Point Implementation. AICT 2009: 163-167 - 2008
- [c5]Andrei Alexandru Enescu, Silviu Ciochina, Constantin Paleologu:
Efficient ML Decoder for Quasi-orthogonal Space-Time Codes When Using QAM Constellation. AICT 2008: 346-349 - [c4]Andrei Alexandru Enescu, Silviu Ciochina, Constantin Paleologu:
Reduced Complexity Decoder for Orthogonal Space-Time Codes When Using QAM Constellations. ICDS 2008: 190-194 - [c3]Constantin Paleologu, Felix Albu
Square-Root-Free QRD-LSL Adaptive Algorithm with Improved Numerical Robustness. ICN 2008: 572-577 - 2007
- [j1]Corneliu Eugen D. Sterian, Andrei Alexandru Enescu, Ion Banica:
Super-orthogonal space-time trellis codes with eight dimensional phase-shift keying signal constellations. Ann. des Télécommunications 62(3-4): 486-512 (2007) - 2006
- [c2]Constantin Paleologu, Andrei Alexandru Enescu, Silviu Ciochina:
Recursive Least-Squares Lattice Adaptive Algorithm Suitable for Fixed-Point Implementation. ICECS 2006: 1105-1108 - 2004
- [c1]Constantin Paleologu, Andrei Alexandru Enescu, Silviu Ciochina:
A Network Echo Canceler Based on a SRF QRD-LSL Adaptive Algorithm Implemented on Motorola StarCore SC140 DSP. ICT 2004: 560-567
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-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: