Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,052,320 papers from all fields of science
Search
Sign In
Create Free Account
Circulant matrix
Known as:
Circulant
, Circulant determinant
, Circulant matrices
In linear algebra, a circulant matrix is a special kind of Toeplitz matrix where each row vector is rotated one element to the right relative to the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
27 relations
Adjacency matrix
Circular convolution
Competitive Lotka–Volterra equations
Convolution
Expand
Broader (1)
Numerical linear algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Compressive radar imaging using white stochastic waveforms
Mahesh C. Shastry
,
R. Narayanan
,
M. Rangaswamy
International Waveform Diversity and Design…
2010
Corpus ID: 9470915
In this paper, we apply the principles of compressive sampling to ultra-wideband (UWB) stochastic waveform radar. The theory of…
Expand
2009
2009
Efficient receiver algorithms for DFT-spread OFDM systems
N. Prasad
,
Shuangquan Wang
,
Xiaodong Wang
IEEE Transactions on Wireless Communications
2009
Corpus ID: 4783442
For the 3GPP LTE uplink transmissions, the DFTspread OFDM technique has been adopted as the air interface in order to reduce the…
Expand
Highly Cited
2008
Highly Cited
2008
Mitigation of linear and nonlinear impairments in high-speed optical networks by using LDPC-coded turbo equalization
I. Djordjevic
,
L. Minkov
,
H. Batshon
IEEE Journal on Selected Areas in Communications
2008
Corpus ID: 6123274
We study a turbo equalization scheme based on low-density parity-check (LDPC) coded turbo equalization (TE). This scheme is…
Expand
2008
2008
Matching Preclusion Problem in Restricted HL-graphs and Recursive Circulant $G(2^m,4)$
Jung-Heum Park
2008
Corpus ID: 8614787
The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor…
Expand
2008
2008
A Low-Complexity LMMSE Channel Estimation Method for OFDM-Based Cooperative Diversity Systems with Multiple Amplify-and-Forward Relays
K. Yan
,
Sheng Ding
,
Yunzhou Qiu
,
Yingguan Wang
,
Haitao Liu
EURASIP Journal on Wireless Communications and…
2008
Corpus ID: 15397276
Orthogonal frequency division multiplexing- (OFDM-) based amplify-and-forward (AF) cooperative communication is an effective way…
Expand
2006
2006
Multilevel coding in M-ary DPSK/differential QAM high-speed optical transmission with direct detection
I. Djordjevic
,
B. Vasic
Journal of Lightwave Technology
2006
Corpus ID: 16430639
A bandwidth- and power-efficient modulation scheme using M-ary differential phase-shift keying (DPSK)/differential quadrature…
Expand
2005
2005
Synaptogenèses et épigenèses cérébrales
J. Bourgeois
2005
Corpus ID: 85997956
Aux mecanismes de plasticite cellulaire communs a toutes les cellules, les neurones ajoutent ceux de l’elaboration des formes et…
Expand
Highly Cited
2004
Highly Cited
2004
Near-Shannon-limit quasi-cyclic low-density parity-check codes
Lei Chen
,
Jun Xu
,
I. Djurdjevic
,
Shu Lin
IEEE Transactions on Communications
2004
Corpus ID: 45108712
This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.
Highly Cited
2004
Highly Cited
2004
Block-circulant low-density parity-check codes for optical communication systems
O. Milenkovic
,
I. Djordjevic
,
B. Vasic
IEEE Journal of Selected Topics in Quantum…
2004
Corpus ID: 5954821
A novel family of structured low-density parity-check (LDPC) codes with block-circulant parity-check matrices that consist of…
Expand
Review
1984
Review
1984
ON THE APPROXIMATION OF THE DISCRETE KARHUNEN-LOEVE TRANSFORM FOR STATIONARY PROCESSES
M. Unser
1984
Corpus ID: 18449954
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE