default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSourav Chakraborty 0006
Person information
- affiliation: Cooch Behar Government Engineering College, India
- affiliation (former): College of Engineering and Management, Kolaghat, India
Other persons with the same name
- Sourav Chakraborty 0001
![[0000-0001-9518-6204]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9518-6204")
— Indian Statistical Institute, Kolkata, India (and 1 more) - Sourav Chakraborty 0002 — University of Delhi, Delhi, India
- Sourav Chakraborty 0003 — Ohio State University, Columbus, OH, USA
- Sourav Chakraborty 0004 — Simon Fraser University
- Sourav Chakraborty 0005 — Boston University, MA, USA
- Sourav Chakraborty 0008 — National Institute of Technology Rourkela, Department of Electrical Engineering, India
- Sourav Chakraborty 0009 — University of Colorado Boulder, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Salah Berra, Sourav Chakraborty, Rui Dinis:
A Low Complexity Iterative SC-FDE Receiver for Massive MIMO Systems. IEEE Trans. Veh. Technol. 73(7): 10405-10420 (2024)- 2023
- [j4]Salah Berra, Sourav Chakraborty, Rui Dinis, Shahriar Shahabuddin:
Deep Unfolding of Chebyshev Accelerated Iterative Method for Massive MIMO Detection. IEEE Access 11: 52555-52569 (2023) - [j3]Sourav Chakraborty, Nirmalendu Bikas Sinha, Monojit Mitra:
Low Complexity, Pairwise Layered Tabu Search for Large Scale MIMO Detection. Wirel. Pers. Commun. 128(3): 1689-1713 (2023) - 2022
- [j2]Sourav Chakraborty, Nirmalendu Bikas Sinha, Monojit Mitra:
Dynamic branch pruning aided low switching fixed complexity sphere decoding for small scale and massive MIMO detection. Trans. Emerg. Telecommun. Technol. 33(7) (2022) - [j1]Sourav Chakraborty, Nirmalendu Bikas Sinha, Monojit Mitra:
Likelihood ascent search-aided low complexity improved performance massive MIMO detection in perfect and imperfect channel state information. Int. J. Commun. Syst. 35(8) (2022) - [c2]Sourav Chakraborty, Salah Berra, Nirmalendu Bikas Sinha, Monojit Mitra:
Efficient Low-Complexity Message Passing Algorithm for Massive MIMO Detection. DoSIER 2022: 261-270
2010 – 2019
- 2010
- [c1]Nirmalendu Bikas Sinha, Prosenjit Kumar Sutradhar, Sourav Chakraborty, Kaustav Chowdhury, Dipak Mondal, Soma Manna, Monojit Mitra:
Super high speed Hybrid technology challenges for smart solution in spectral-efficient high data-rate wireless networks. WOCN 2010: 1-5 - [i1]Nirmalendu Bikas Sinha, Sourav Chakraborty, P. K. Sutradhar, R. Bera, Monojit Mitra:
Optimization of MIMO detectors: Unleashing the multiplexing gain. CoRR abs/1002.3317 (2010)
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-10-07 22:11 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:
