Object recognition at higher regions of the ventral visual stream via dynamic inference

SK Sorooshyari, H Sheng, HV Poor - Frontiers in Computational …, 2020 - frontiersin.org
The ventral visual stream (VVS) is a fundamental pathway involved in visual object
identification and recognition. In this work, we present a hypothesis of a sequence of …

[PDF][PDF] 基于求解校验序列的 (n, 1, m) 卷积码盲识别

刘建成, 杨晓静 - 2012 - edit.jeit.ac.cn
基于求解校验序列的nm ( ,1, )卷积码盲识别Blind Recognition of nm ( ,1, ) Convolutional
Code Based on Solving Page 1 第34 卷第10 期 电子与信息学报 Vol.34No.10 2012 年10 月 …

Minimal trellis for systematic recursive convolutional encoders

C Pimentel, RD Souza, BF Uchôa-Filho… - … on Information Theory …, 2011 - ieeexplore.ieee.org
We consider high-rate systematic recursive convolutional encoders to be adopted as
constituent encoders in turbo schemes. It has been shown by Douillard and Berrou that the …

A new computational decoding complexity measure of convolutional codes

IB Benchimol, C Pimentel, RD Souza… - EURASIP Journal on …, 2014 - Springer
This paper presents a computational complexity measure of convolutional codes well
suitable for software implementations of the Viterbi algorithm (VA) operating with hard …

Blind Recognition of (n, 1, m) Convolutional CodeBased on Solving Check-sequence

JC Liu, XJ Yang - 电子与信息学报, 2012 - jeit.ac.cn
In view of the fast development of information countermeasure and intelligent
communication, recognition of channel coding has been a vital issue in information …

Turbo decoding using the sectionalized minimal trellis of the constituent code: performance-complexity trade-off

GL Moritz, RD Souza, C Pimentel… - IEEE transactions on …, 2013 - ieeexplore.ieee.org
The performance and complexity of turbo decoding using rate k/n constituent codes are
investigated. The conventional, minimal and sectionalized trellis modules of the constituent …

A computational complexity measure for trellis modules of convolutional codes

IB Benchimol, C Pimentel, RD Souza… - 2013 36th …, 2013 - ieeexplore.ieee.org
This paper presents a computational complexity measure of convolutional codes well
suitable for software implementations of the Viterbi algorithm (VA) operating with hard …

High-rate systematic recursive convolutional encoders: minimal trellis and code search

I Benchimol, C Pimentel, RD Souza… - EURASIP Journal on …, 2012 - Springer
We consider high-rate systematic recursive convolutional encoders to be adopted as
constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its …

Reduced complexity decoding of convolutional codes based on the M-algorithm and the minimal trellis

RD Souza, C Pimentel, DN Muniz - annals of telecommunications-annales …, 2012 - Springer
In this paper, we propose three new sub-optimum, reduced complexity decoding algorithms
for convolutional codes. The algorithms are based on the minimal trellis representation for …

Sectionalization of the minimal trellis module for convolutional codes

I Benchimol, C Pimentel… - 2012 35th International …, 2012 - ieeexplore.ieee.org
It has been shown by McEliece and Lin that convolutional codes can be represented by a
minimal trellis structure in order to reduce the decoding complexity of the Viterbi algorithm …