The problem of input identifiability in blind deconvolution is considered w
here the input belongs to a known discrete alphabet. Input identifiability
is an algorithm independent property, which does not necessarily imply chan
nel identifiability, Sufficient conditions for input identifiability are de
rived in terms of algebraic relations on the observed output. It is shown h
ow these new results relate to and unify other known sufficient conditions.