A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Large Kernel Polar Codes with efficient Window Decoding
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper, we modify polar codes constructed with some 2^t x 2^t polarization kernels to reduce the time complexity of the window decoding. ...
This modification is based on the permutation of the columns of the kernels. ...
In [7] , Trifonov used a window decoder for polar codes constructed with non-binary Reed-Solomon (RS) kernels [4] . ...
arXiv:2005.11102v2
fatcat:b26efhtlargxtghxaiewk52fzi
Shortened Polarization Kernels
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The proposed algorithm is applied to some kernels of sizes 16 and 32 to obtain shortened kernels of sizes from 9 to 31. These kernels are used in mixed-kernel polar codes of various lengths. ...
Numerical results demonstrate the advantage of polar codes with shortened large kernels compared with shortened and punctured Arikan polar codes, and polar codes with small kernels. ...
ACKNOWLEDGEMENT This work is partially supported by the Ministry of Science and Higher Education of Russian Federation, passport of goszadanie no. 2019-0898. ...
arXiv:2110.07351v1
fatcat:f7a3idifr5e2notf7rxdd2xyjm
Efficient decoding of polar codes with some 16×16 kernels
2018
2018 IEEE Information Theory Workshop (ITW)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2001.03921v1 fatcat:aswifkvxmvcgbpf3mimhwige3y
A decoding algorithm for polar codes with binary 16×16 kernels with polarization rate 0.51828 and scaling exponents 3.346 and 3.450 is presented. ...
Simulation results show that polar (sub)codes with 16×16 kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity. ...
EFFICIENT PROCESSING OF 16 × 16 KERNELS To minimize complexity of proposed approach (13) one needs to find kernels with small decoding windows while preserving required polarization rate (> 0.5 in our ...
doi:10.1109/itw.2018.8613307
dblp:conf/itw/TrofimiukT18
fatcat:zuilf4jyo5hstjmys4awezx33y
Sliding Window Polar Codes
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Our approach is based on the design of an ad-hoc kernel to be inserted in a multi-kernel polar code framework; this structure enables the sliding window decoding of the code. ...
We propose a novel coupling technique for the design of polar codes of length N, making them decodable through a sliding window of size M < N. ...
SLIDING WINDOW POLAR CODES
A. Sliding window kernel The sliding window kernel W S is the cornerstone of the proposed construction. ...
arXiv:2004.07767v3
fatcat:q6vkqmvzsfeotca5gmjrqik3pe
Polar Run-Length Features in Segmentation of Retinal Blood Vessels
2009
2009 International Conference on Digital Image Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Polar run-length matrices are simply created by transforming the windows into polar coordinates and then constructing conventional run length matrices. ...
First the images are preprocessed so that the within class variability of the vessel and background classes are minimized. Next, the image is scanned with a window of a certain size. ...
The polar transformed window could also be interpreted as a form of shape signature. ...
doi:10.1109/icdip.2009.18
dblp:conf/icdip/RezatofighiRPS09
fatcat:2afnwgittvfatp5klfxrits7hq
Recursive Trellis Processing of Large Polarization Kernels
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The proposed algorithm exploits recursive trellis representation of the codes generated by submatrices of the polarization kernel, and enables codes based on large kernels to provide better performance ...
A reduced complexity algorithm is presented for computing the log-likelihood ratios arising in the successive cancellation decoder for polar codes with large kernels of arbitrary dimension. ...
Table I presents processing complexity for some polarization kernels. Here K l denotes a kernel of size l. ...
arXiv:2101.08081v2
fatcat:gx4lnh2zszdplewqedhdsj6pea
Image Forgery Detection using Multidimensional Spectral Hashing based Polar Cosine Transform
2015
Indian Journal of Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Accessibility and manipulability of the diverse and sophisticated digital image editing and processing tools has made the integrity of digital images debatable. ...
As much simple as image tampering been made by the image editing tools, that much difficult the tampering detection process has become. ...
Y gives the binary code of i th image. ...
doi:10.17485/ijst/2015/v8is9/54344
fatcat:3lrxex2of5dtnjonbeme5ridhy
A hardware accelerated approach for imaging flow cytometry
2013
2013 23rd International Conference on Field programmable Logic and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Imaging flow cytometry uses high-speed flows and a camera to capture morphological features of hundreds to thousands of cells per second. ...
Our FPGA design results in a 38× speedup over software, providing 2,262 FPS with 11.9 ms of latency. Our GPU implementation shows a 22× speedup, supporting 1,318 FPS with 152 ms of latency. ...
Each kernel is implemented in similar manner. The first set of kernels accelerate window operations. The hierarchy of the parallelism is demonstrated in Figure 10 (a). ...
doi:10.1109/fpl.2013.6645507
dblp:conf/fpl/LeeMJTCK13
fatcat:icu3k5ir2bhopehn4kzizgmlay
Predicting protein secondary structure by a support vector machine based on a new coding scheme
2004
Genome Informatics Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
When tested on the most popular dataset CB513, it achieved a Q(3) accuracy of 0.7844, which illustrates that it is one of the top range methods for protein of secondary structure prediction. ...
Different from the existing methods, this method takes into account of the physical-chemical properties and structure properties of amino acids. ...
In the process of protein folding, polar residues prefer to stay outside of the protein to prevent the non-polar residues from exposing to the polar solvent molecular, such as water molecular. ...
pmid:15706504
fatcat:n5d456kv3fdp5mnynr3uznkzui
Improved Protein Secondary Structure Prediction Using Support Vector Machine With a New Encoding Scheme and an Advanced Tertiary Classifier
2004
IEEE Transactions on Nanobioscience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Also, the optimal window length for six SVM binary classifiers is established by testing different window sizes and our new encoding scheme is tested based on this optimal window size via sevenfold cross ...
Finally, to combine the results of the six SVM binary classifiers, a new tertiary classifier which combines the results of one-versus-one binary classifiers is introduced and the performance is compared ...
process. ...
doi:10.1109/tnb.2004.837906
pmid:15631138
fatcat:glp4ns3aijctjp6lchzktcsssm
Player detection in field sports
2017
Machine Vision and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Given a set of binary edges in a sliding window, we introduce and solve a particular diffusion equation to generate a shape information image. ...
It also enables the use of polar and Fourier transforms in the next stage to achieve scale and rotation invariant feature extraction. ...
To further accelerate the detection, we process only the window regions which include a significant number of edge points. ...
doi:10.1007/s00138-017-0893-8
fatcat:r7wysjxlqngcrir4p5lya6goj4
VME–based DAQ system for the Deuteron Spin Structure setup at the Nuclotron internal target station
2019
EPJ Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The software dealing with VME hardware is a set of netgraph nodes in the form of the loadable kernel modules. ...
Since the spin studies at the Nuclotron require fast and precise determination of the deuteron and proton beam polarization, the polarization calculator software module is introduced. ...
The author has the pleasure to thank V.P.Ladygin for initiation of the polarization calculations development for DSS setup, S.G.Reznikov -for fruitful discussions about VME hardware, and all the DSS collaboration ...
doi:10.1051/epjconf/201920410003
fatcat:lfbkglmg7bghti73vlx44z7dhq
Low-cost space-varying FIR filter architecture for computational imaging systems
2010
Digital Photography VI
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Hence, the exploitation of the advantages of the jointly designed computational imaging system requires low-complexity algorithms enabling space-varying sharpening. ...
Recent research demonstrates the advantage of designing electro-optical imaging systems by jointly optimizing the optical and digital subsystems. ...
The controller determines the angular index and radial index of the polar tile where the current pixel being processed is located. ...
doi:10.1117/12.838977
dblp:conf/dphoto/FengSSR10
fatcat:2ktjxdoz5vcf3lonixgb62eey4
Tools to perform data reduction of time-of-flight data taken on BL4A (MagRef)—a Jupyter notebook approach
[article]
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The notebook offers two options for background subtraction, applies corrections for the wavelength dependence of the polarizer and flipper efficiencies, accounts for Zeeman energy splitting of the spin-flip ...
A collection of modules or tools to produce reflectivity profiles from data acquired with unpolarized and polarized neutron beams using the BL4A (MagRef) instrument at the Spallation Neutron Source. ...
Terminate the terminal window and jupyter.sns.gov notebook. o Issue (1): The MagH process variables are not being recorded to the log file. ...
doi:10.5281/zenodo.3968838
fatcat:a7tsaq2osnanbd6mgguw6wi5oi
Machine Learning for Seismic Signal Processing: Phase Classification on a Manifold
2011
2011 10th International Conference on Machine Learning and Applications and Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then apply kernel ridge regression on each feature manifold for phase classification. ...
This concept makes sense because the characteristics of the phase types are dictated by the physics of wave propagation. ...
These principles guide our window selection process. ...
doi:10.1109/icmla.2011.91
dblp:conf/icmla/RamirezM11
fatcat:fbevtbdgwngstg2p64dq7twkby
« Previous
Showing results 1 — 15 out of 8,833 results