default search action
Kritsada Mamat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Kritsada Mamat
, Wiroonsak Santipach
Optimal Transmit Power and Channel-Information Bit Allocation With Zeroforcing Beamforming in MIMO-NOMA and MIMO-OMA Downlinks. IEEE Trans. Commun. 71(4): 2028-2041 (2023) - [c5]Kritsada Mamat, Wiroonsak Santipach:
On Optimizing Transmit Power, Channel-Quantization Rate, and User Pairing for Power-Domain MIMO-NOMA Downlinks. GLOBECOM 2023: 2384-2389 - [i6]Kritsada Mamat, Wiroonsak Santipach:
Optimal Transmit Power and Channel-Information Bit Allocation With Zeroforcing Beamforming in MIMO-NOMA and MIMO-OMA Downlinks. CoRR abs/2301.10435 (2023) - 2020
- [j5]Kritsada Mamat
On Optimizing Feedback-Rate Allocation for Downlink MIMO-NOMA With Quantized CSIT. IEEE Open J. Commun. Soc. 1: 1551-1570 (2020)
2010 – 2019
- 2019
- [c4]Kritsada Mamat, Wiroonsak Santipach:
Optimal Feedback Allocation for Zeroforcing Beamforming Transmission in Downlink NOMA. WCNC 2019: 1-6 - 2018
- [j4]Kritsada Mamat, Wiroonsak Santipach
On Optimizing Feedback Interval for Temporally Correlated MIMO Channels With Transmit Beamforming and Finite-Rate Feedback. IEEE Trans. Commun. 66(8): 3407-3419 (2018) - 2017
- [i5]Kritsada Mamat, Wiroonsak Santipach:
On Optimizing Feedback Interval for Gauss-Markov MIMO Channels With Finite-Rate Feedback. CoRR abs/1703.03499 (2017) - 2016
- [j3]Wiroonsak Santipach
Outage Bound for Max-Based Downlink Scheduling With Imperfect CSIT and Delay Constraint. IEEE Commun. Lett. 20(8): 1675-1678 (2016) - 2015
- [j2]Kritsada Mamat, Wiroonsak Santipach
On Transmit Beamforming for MISO-OFDM Channels With Finite-Rate Feedback. IEEE Trans. Commun. 63(11): 4202-4213 (2015) - [i4]Wiroonsak Santipach, Kritsada Mamat, Chalie Charoenlarpnopparut:
Outage Bound for Max-Based Downlink Scheduling With Imperfect CSIT and Delay Constraint. CoRR abs/1510.04374 (2015) - 2014
- [i3]Wiroonsak Santipach, Kritsada Mamat, Ake Tonsirisittikun, Kaemmatat Jiravanstit:
Power and Bit Allocation for Wireless OFDM Channels with Finite-Rate Feedback and Subcarrier Clustering. CoRR abs/1402.5192 (2014) - [i2]Kritsada Mamat, Wiroonsak Santipach:
On Transmit Beamforming for MISO-OFDM Channels With Finite-Rate Feedback. CoRR abs/1410.1274 (2014) - 2013
- [c3]Kritsada Mamat, Wiroonsak Santipach
On transmit beamforming for multiantenna OFDM channels with finite-rate feedback. ICC 2013: 5689-5693 - 2011
- [j1]Wiroonsak Santipach
Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channels. IEEE Trans. Wirel. Commun. 10(9): 3012-3019 (2011) - [c2]Wiroonsak Santipach
Optimal Feedback Interval for Temporally-Correlated Multiantenna Channel. GLOBECOM 2011: 1-5 - [i1]Wiroonsak Santipach, Kritsada Mamat:
Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channel. CoRR abs/1104.4607 (2011) - 2010
- [c1]Kritsada Mamat, Wiroonsak Santipach
Kd-tree codebook for limited feedback CDMA. ICT 2010: 893-898
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:57 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: