Reducing complexity of tail-biting trellises

Details Reducing complexity of tail-biting trellises Reducing complexity of tail-biting trellises

2012-02-07

arxiv.org/abs/1202.1336v1

Computer Science

Information Theory

5 pages; submitted to the 2012 IEEE International Symposium on Information Theory

Scientific paper

It is shown that a trellis realization can be locally reduced if it is not
state-trim, branch-trim, proper, observable, and controllable. These conditions
are not sufficient for local irreducibility. Making use of notions that amount
to "almost unobservability/uncontrollability", a necessary and sufficient
criterion of local irreducibility for tail-biting trellises is presented.

Affiliated with

Also associated with

No associations

Rating

Reducing complexity of tail-biting trellises does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reducing complexity of tail-biting trellises, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reducing complexity of tail-biting trellises will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578814