default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge N. Karystinos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j24]Hossein Kamrani, Alireza Zolghadr-E-Asli, Panos P. Markopoulos
, Michael Langberg, Dimitris A. Pados, George N. Karystinos:
Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees. IEEE Trans. Signal Process. 69: 240-255 (2021)- [j23]Michail Ouroutzoglou, Georgios Vougioukas, George N. Karystinos, Aggelos Bletsas:
Multistatic Noncoherent Linear Complexity Miller Sequence Detection For Gen2 RFID/IoT. IEEE Trans. Wirel. Commun. 20(12): 8067-8080 (2021) - 2019
- [j22]Panos P. Markopoulos, Nicholas Tsagkarakis, Dimitris A. Pados, George N. Karystinos:
Realified L1-PCA for direction-of-arrival estimation: theory and algorithms. EURASIP J. Adv. Signal Process. 2019: 30 (2019) - 2017
- [j21]Panos N. Alevizos, Aggelos Bletsas, George N. Karystinos:
Noncoherent Short Packet Detection and Decoding for Scatter Radio Sensor Networking. IEEE Trans. Commun. 65(5): 2128-2140 (2017) - [j20]Panos P. Markopoulos, George N. Karystinos:
Noncoherent Alamouti Phase-Shift Keying With Full-Rate Encoding and Polynomial-Complexity Maximum-Likelihood Decoding. IEEE Trans. Wirel. Commun. 16(10): 6688-6697 (2017) - 2016
- [j19]Panos N. Alevizos, Yannis Fountzoulas, George N. Karystinos, Aggelos Bletsas:
Log-Linear-Complexity GLRT-Optimal Noncoherent Sequence Detection for Orthogonal and RFID-Oriented Modulations. IEEE Trans. Commun. 64(4): 1600-1612 (2016) - 2014
- [j18]Maria Gkizeli, George N. Karystinos:
Maximum-SNR Antenna Selection Among a Large Number of Transmit Antennas. IEEE J. Sel. Top. Signal Process. 8(5): 891-901 (2014) - [j17]Anastasios Kyrillidis, George N. Karystinos:
Fixed-Rank Rayleigh Quotient Maximization by an MPSK Sequence. IEEE Trans. Commun. 62(3): 961-975 (2014) - [j16]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
The Sparse Principal Component of a Constant-Rank Matrix. IEEE Trans. Inf. Theory 60(4): 2281-2290 (2014) - [j15]Panos P. Markopoulos, George N. Karystinos, Dimitrios A. Pados:
Optimal Algorithms for L1-subspace Signal Processing. IEEE Trans. Signal Process. 62(19): 5046-5058 (2014) - 2013
- [j14]Dimitris S. Papailiopoulos, Georgina Abou Elkheir, George N. Karystinos:
Maximum-Likelihood Noncoherent PAM Detection. IEEE Trans. Commun. 61(3): 1152-1159 (2013) - 2012
- [j13]Aggelos Bletsas, John Kimionis, Antonis G. Dimitriou, George N. Karystinos:
Single-Antenna Coherent Detection of Collided FM0 RFID Signals. IEEE Trans. Commun. 60(3): 756-766 (2012) - 2011
- [j12]Harish Ganapathy, Dimitrios A. Pados, George N. Karystinos:
New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation. IEEE Trans. Commun. 59(4): 1123-1132 (2011) - [j11]Harish Ganapathy, Dimitrios A. Pados, George N. Karystinos:
New Bounds and Optimal Binary Signature Sets - Part II: Aperiodic Total Squared Correlation. IEEE Trans. Commun. 59(5): 1411-1420 (2011) - 2010
- [j10]George N. Karystinos, Athanasios P. Liavas:
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form. IEEE Trans. Inf. Theory 56(7): 3581-3593 (2010) - [j9]Dimitris S. Papailiopoulos, George N. Karystinos:
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity. IEEE Trans. Wirel. Commun. 9(6): 1935-1945 (2010) - 2007
- [j8]George N. Karystinos, Dimitrios A. Pados:
Supervised Phase Correction of Blind Space-Time DS-CDMA Channel Estimates. IEEE Trans. Commun. 55(3): 584-592 (2007) - [j7]George N. Karystinos, Dimitrios A. Pados:
Rank-2-Optimal Adaptive Design of Binary Spreading Codes. IEEE Trans. Inf. Theory 53(9): 3075-3080 (2007) - 2005
- [j6]George N. Karystinos, Dimitrios A. Pados:
The maximum squared correlation, sum capacity, and total asymptotic efficiency of minimum total-squared-correlation binary signature sets. IEEE Trans. Inf. Theory 51(1): 348-355 (2005) - [j5]S. Gopalan, George N. Karystinos, Dimitrios A. Pados:
Capacity, throughput, and delay of slotted ALOHA DS-CDMA links with adaptive space-time auxiliary-vector receivers. IEEE Trans. Wirel. Commun. 4(1): 79-92 (2005) - 2003
- [j4]George N. Karystinos, Dimitrios A. Pados:
New bounds on the total squared correlation and optimum design of DS-CDMA binary signature sets. IEEE Trans. Commun. 51(1): 48-51 (2003) - 2002
- [j3]George N. Karystinos, Haoli Qian, Michael J. Medley, Stella N. Batalama:
Short Data Record Adaptive Filtering: The Auxiliary-Vector Algorithm. Digit. Signal Process. 12(2-3): 193-222 (2002) - 2001
- [j2]Dimitrios A. Pados, George N. Karystinos:
An iterative algorithm for the computation of the MVDR filter. IEEE Trans. Signal Process. 49(2): 290-300 (2001) - 2000
- [j1]George N. Karystinos, Dimitrios A. Pados:
On overfitting, generalization, and randomly expanded training sets. IEEE Trans. Neural Networks Learn. Syst. 11(5): 1050-1057 (2000)
Conference and Workshop Papers
- 2022
- [c34]Ioannis Mandourarakis, Eftichis Koutroulis, George N. Karystinos:
Control of Cascaded H-bridge Converters for Power Line Communication. IECON 2022: 1-6 - [c33]Ioannis Mandourarakis, Zoi Agorastou, Eftichios Koutroulis, George N. Karystinos, Stylianos Siskos:
On-chip Power Line Communication for Cascaded H-bridge Power Converters. MOCAST 2022: 1-5 - 2018
- [c32]Michail Ouroutzoglou, Aggelos Bletsas, George N. Karystinos:
Intelligent noncoherent sequence equals coherent detection: Experimental proof in industrial RFID. MOCAST 2018: 1-4 - 2016
- [c31]Yannis Fountzoulas, Dimitris G. Chachlakis, George N. Karystinos, Aggelos Bletsas:
GLRT-optimal blind MSK detection with log-linear complexity. ICT 2016: 1-5 - [c30]Yannis Fountzoulas, Angela Kosta, George N. Karystinos:
Polar-code-based security on the BSC-modeled HARQ in fading. ICT 2016: 1-5 - [c29]Maria Gkizeli, George N. Karystinos:
Polynomial-complexity GLRT-optimal noncoherent PNC. ISWCS 2016: 258-264 - 2015
- [c28]Panos N. Alevizos, Yannis Fountzoulas, George N. Karystinos, Aggelos Bletsas:
Noncoherent sequence detection of orthogonally modulated signals in flat fading with log-linear complexity. ICASSP 2015: 2974-2978 - [c27]George N. Karystinos, Aggelos Bletsas:
Cubic-complexity optimal noncoherent OOK sequence detection in flat fading. ICC 2015: 2721-2726 - [c26]Yannis Fountzoulas, George N. Karystinos:
Optimal Blind APSK Detection in Polynomial Time. VTC Fall 2015: 1-7 - 2013
- [c25]Maria Gkizeli, George N. Karystinos:
Maximum-SNR transmit antenna selection with unimodular beamforming and two receive antennas. CISS 2013: 1-6 - [c24]Maria Gkizeli, George N. Karystinos:
Maximum-SNR transmit antenna selection with two receive antennas is polynomially solvable. ICASSP 2013: 4749-4753 - [c23]Panos P. Markopoulos, George N. Karystinos:
Novel full-rate noncoherent alamouti encoding that allows polynomial-complexity optimal decoding. ICASSP 2013: 5075-5079 - [c22]Dimitrios A. Koupatsiaris, George N. Karystinos:
Efficient DOA, DOD, and target estimation for bistatic MIMO sonar. ICASSP 2013: 5155-5159 - [c21]Panos P. Markopoulos, George N. Karystinos, Dimitrios A. Pados:
Some Options for L1-subspace Signal Processing. ISWCS 2013: 1-5 - 2012
- [c20]Dimitris S. Papailiopoulos, Georgina Abou Elkheir, George N. Karystinos:
Maximum-likelihood blind PAM detection. ICC 2012: 2283-2287 - 2011
- [c19]Anastasios Kyrillidis, George N. Karystinos:
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments. ICASSP 2011: 3856-3859 - [c18]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
Sparse principal component of a rank-deficient matrix. ISIT 2011: 673-677 - [c17]John Kimionis, Aggelos Bletsas, Antonis G. Dimitriou, George N. Karystinos:
Inventory time reduction in Gen2 with single-antenna separation of FM0 RFID signals. RFID-TA 2011: 494-501 - 2008
- [c16]Dimitris S. Papailiopoulos, George N. Karystinos:
Efficient maximum-likelihood noncoherent orthogonal STBC detection. Allerton 2008: 294-300 - [c15]Dimitris S. Papailiopoulos, George N. Karystinos:
Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form. CISS 2008: 1086-1090 - [c14]Maria Gkizeli, George N. Karystinos:
Noncoherent Detection in Amplify-and-Forward Relay Systems. GLOBECOM 2008: 976-980 - [c13]Dimitris S. Papailiopoulos, George N. Karystinos:
Polynomial-complexity maximum-likelihood block noncoherent MPSK detection. ICASSP 2008: 2681-2684 - [c12]George N. Karystinos, Athanasios P. Liavas:
Outage capacity of a cooperative scheme with binary input and a simple relay. ICASSP 2008: 3221-3224 - [c11]George N. Karystinos, Athanasios P. Liavas:
Efficient computation of the binary vector that maximizes a rank-deficient quadratic form. ICASSP 2008: 3577-3580 - [c10]George N. Karystinos, Athanasios P. Liavas:
Quadratic form maximization over the binary field with polynomial complexity. ISIT 2008: 2449-2453 - [c9]Athanasios P. Liavas, George N. Karystinos:
Outage capacity of a noncoherent cooperative protocol with binary input and a simple relay. ISWPC 2008: 661-664 - 2007
- [c8]Harish Ganapathy, Dimitrios A. Pados, George N. Karystinos:
New Bounds on the Aperiodic Total Squared Correlation of Binary Signature Sets and Optimal Designs. ICC 2007: 914-919 - 2006
- [c7]George N. Karystinos, Dimitris A. Pados:
Rank-2-optimal Binary Spreading Codes. CISS 2006: 1534-1539 - [c6]George N. Karystinos, Dimitris A. Pados:
Code Division Multiplexing Properties of the Odd-length Minimum-TSC Binary Signature Sets. CISS 2006: 1540-1545 - 2003
- [c5]George N. Karystinos, Dimitrios A. Pados:
Code division multiplexing performance of minimum total-squared-correlation binary signature sets. GLOBECOM 2003: 1862-1866 - [c4]George N. Karystinos, Dimitrios A. Pados:
Binary CDMA signature sets with concurrently minimum total-squared-correlation and maximum-squared-correlation. ICC 2003: 2500-2503 - 2002
- [c3]John D. Matyjas, George N. Karystinos, Stella N. Batalama:
On the training of DS-CDMA neural-network receivers. ICASSP 2002: 1017-1020 - 2001
- [c2]George N. Karystinos, Dimitrios A. Pados:
Minimum total-squared-correlation design of DS-CDMA binary signature sets. GLOBECOM 2001: 801-805 - 2000
- [c1]Dimitrios A. Pados, George N. Karystinos:
Short-data-record estimators of the MVDR/NMSE filter. ICASSP 2000: 384-387
Informal and Other Publications
- 2021
- [i5]Vassilis Digalakis Jr., George N. Karystinos, Minos N. Garofalakis:
Improved Pan-Private Stream Density Estimation. CoRR abs/2111.08784 (2021) - 2014
- [i4]Anastasios Kyrillidis, George N. Karystinos:
Fixed-rank Rayleigh Quotient Maximization by an $M$PSK Sequence. CoRR abs/1401.6968 (2014) - [i3]Panos P. Markopoulos, George N. Karystinos, Dimitrios A. Pados:
Optimal Algorithms for L1-subspace Signal Processing. CoRR abs/1405.6785 (2014) - 2013
- [i2]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
The Sparse Principal Component of a Constant-rank Matrix. CoRR abs/1312.5891 (2013) - 2011
- [i1]Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos:
Sparse Principal Component of a Rank-deficient Matrix. CoRR abs/1106.1651 (2011)
Coauthor Index
aka: Dimitrios A. Pados
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-10-07 22:15 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:
